Learn More
In Computer Science, propositional temporal logics are mainly used for the veriication of concurrent systems. Formulae are interpreted over state sequences, where each state is labeled with a set of propositions. A state sequence can be regarded as a discrete passage of time and the temporal logic provides the formalization and deduction of temporal(More)
We consider an implementation of Farin's algorithm, with some modiications, for`C 1 ' B ezier interpolation of a surface known only by an arbitrary triangulation. This algorithm was originally developed as a tool for computer aided design software, but it can be useful for visualization of Finite Element software outputs in numerical analysis and in(More)
  • 1