A complete equational axiomatization for MPA with string iteration

DOI10.1016/S0304-3975(97)00182-5zbMath0913.68108OpenAlexW2257073366MaRDI QIDQ1274456

Luca Aceto, Jan Friso Groote

Publication date: 12 January 1999

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(97)00182-5

zbMATH Keywords

equational logicKleene starbisimulation equivalenceminimal process algebrastring iteration

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items

Embedding Untimed into Timed Process Algebra; the Case for Explicit Termination, Non-regular iterators in process algebra

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algèbre de processus et synchronisation
• Calculi for synchrony and asynchrony
• A complete inference system for a class of regular behaviours
• Determinacy \(\to\) (observation equivalence \(=\) trace equivalence)
• Structured operational semantics and bisimulation as a congruence
• A complete equational axiomatization for prefix iteration
• Termination modulo equations by abstract commutation with an application to iteration
• A structural approach to operational semantics
• Axiomatizing prefix iteration with silent steps
• Decidability of bisimulation equivalence for process generating context-free languages
• Realization of Events by Logical Nets
• A term model for synchronous processes
• Process Algebra
• Formal verification of parallel programs
• A menagerie of non-finitely based process semantics over BPA* – from ready simulation to completed traces
• Axiomatizations for the perpetual loop in process algebra
• A completeness theorem for nondeterministic Kleene algebras