Axiomatizing flat iteration

DOI10.1007/3-540-63141-0_16zbMath1512.68175arXivcs/9810008OpenAlexW2124928973MaRDI QIDQ6044120

Robert J. van Glabbeek

Publication date: 17 May 2023

Published in: CONCUR '97: Concurrency Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cs/9810008

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (2)

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
• Specification-oriented semantics for communicating processes
• On the consistency of Koomen's fair abstraction rule
• A complete axiomatisation for observational congruence of finite-state behaviours
• A complete equational axiomatization for prefix iteration
• Branching bisimilarity is an equivalence indeed!
• Axiomatizing prefix iteration with silent steps
• Algebraic laws for nondeterminism and concurrency
• Branching time and abstraction in bisimulation semantics

This page was built for publication: Axiomatizing flat iteration