Axiomatising finite delay operators

DOI10.1007/BF00289140MaRDI QIDQ1055190zbMATH OpenFDO

Authors Matthew Hennessy

Publication date 1984

Published in Acta Informatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF00289140

zbMATH Keywords

complete axiomatisation for finite termsdelay operatorslanguage for finite automata

Mathematics Subject Classification ID

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

Cites work

• A calculus of communicating systems
• A complete inference system for a class of regular behaviours
• A term model for synchronous processes
• Algebraic semantics
• Calculi for synchrony and asynchrony
• scientific article; zbMATH DE number 3814961 (Why is no real title available?)
• scientific article; zbMATH DE number 3716792 (Why is no real title available?)
• scientific article; zbMATH DE number 3754002 (Why is no real title available?)
• scientific article; zbMATH DE number 3793435 (Why is no real title available?)
• scientific article; zbMATH DE number 3640837 (Why is no real title available?)
• Initial Algebra Semantics and Continuous Algebras

Cited in

(8)

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

This page was built for publication: Axiomatising finite delay operators

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1055190)