Axiomatising finite delay operators

DOI10.1007/BF00289140zbMath0521.68047MaRDI QIDQ1055190

Matthew C. B. Hennessy

Publication date: 1984

Published in: Acta Informatica (Search for Journal in Brave)

zbMATH Keywords

delay operatorscomplete axiomatisation for finite termslanguage for finite automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05)

Related Items (8)

On the consistency of Koomen's fair abstraction rule ⋮ A fixpoint approach to finite delay and fairness ⋮ Semantics for finite delay ⋮ Fairness and regularity for SCCS processes ⋮ Modal logics for communicating systems ⋮ Non-regular iterators in process algebra ⋮ Weak and strong fairness in CCS ⋮ A fair calculus of communicating systems

Cites Work

• Calculi for synchrony and asynchrony
• A complete inference system for a class of regular behaviours
• A calculus of communicating systems
• Algebraic semantics
• A term model for synchronous processes
• Initial Algebra Semantics and Continuous Algebras
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Axiomatising finite delay operators