Non-regular iterators in process algebra

DOI10.1016/S0304-3975(00)00413-8zbMath0983.68138OpenAlexW2147246587MaRDI QIDQ5958616

Jan A. Bergstra, Alban Ponse

Publication date: 3 March 2002

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

Full work available at URL: https://doi.org/10.1016/s0304-3975(00)00413-8

zbMATH Keywords

iterationprocess algebraexpressivenessconcurrencyback and forth operationKleene starnesting operationpush-down operation

Mathematics Subject Classification ID

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

Related Items (4)

Branching time and orthogonal bisimulation equivalence ⋮ Execution architectures for program algebra ⋮ Unnamed Item ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Calculi for synchrony and asynchrony
• Axiomatising finite delay operators
• A complete inference system for a class of regular behaviours
• Algebra of communicating processes with abstraction
• Top-down design and the algebra of communicating processes
• On the consistency of Koomen's fair abstraction rule
• Global renaming operators in concrete process algebra
• A complete equational axiomatization for MPA with string iteration
• A complete equational axiomatization for prefix iteration
• An equational axiomatization for multi-exit iteration
• Nonaxiomatisability of equivalences over finite state processes
• Two finite specifications of a queue
• Axiomatizing prefix iteration with silent steps
• Computable processes and bisimulation equivalence
• Decidability of bisimulation equivalence for process generating context-free languages
• Process algebra for synchronous communication
• Process Algebra
• A menagerie of non-finitely based process semantics over BPA* – from ready simulation to completed traces
• Branching time and abstraction in bisimulation semantics
• Axiomatizations for the perpetual loop in process algebra
• Axiomatizing flat iteration

This page was built for publication: Non-regular iterators in process algebra