Proceedings of the Estonian Academy of Sciences, Physics and Mathematics |
Expressions et termes fréquents
abstract algebraic specification algorithm alphabet apomorphisms bisimulation catamorphism causal coalgebras component transition systems Computer Science consider data types denote dependent function described deterministic distributed system diversors dynamic function dynamic system Estonian event example execution F snd f st F-algebra finite formalism functional programming functor fundamental solutions g C ST given global transition system guard Gurevich Machines higher-order fundamental solutions Huygens principle imperative programming induction initial initial algebras instance instant algebra Kripke frame Lemma List'A Lj-satisfiable many-sorted modal logics model checking morphism MSCPDL nodes non-determinism notation object equality object expressions operators paper paramorphisms prefixed formula prefixed tableau primitive corecursion Proc programming language proof system propositional reachability properties ready relation recursion rules and axioms semantics sequence signature state/event system Stream sub-reachability synchronization tableau rule Tallinn Theorem three-valued tool trace set transition rules valued formula variables vector verification wave equation well-behaved subsystem