Preferential choice and coordination conditions

DOI10.1016/j.jlap.2006.08.004zbMath1106.68071OpenAlexW2129235856MaRDI QIDQ864506

C. A. Middelburg, Jan A. Bergstra

Publication date: 9 February 2007

Published in: The Journal of Logic and Algebraic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jlap.2006.08.004

zbMATH Keywords

process algebraBoolean algebrapreferential choicecoordination conditionssplitting bisimulation

Mathematics Subject Classification ID

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

Related Items (4)

On Rule Formats for Zero and Unit Elements ⋮ Priority and abstraction in process algebra ⋮ Formal modeling of evolving self-adaptive systems ⋮ SOS rule formats for zero and unit elements

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Symbolic bisimulations
• Algebra of communicating processes with abstraction
• On the consistency of Koomen's fair abstraction rule
• Global renaming operators in concrete process algebra
• Bisimulation through probabilistic testing
• Algebraic methods II: theory, tools and applications
• CCS with priority choice
• Process algebra with propositional signals
• Branching time and orthogonal bisimulation equivalence
• Splitting bisimulations and retrospective conditions
• Process algebra for synchronous communication
• A Theory of Communicating Sequential Processes
• Laws of programming
• Algebraic laws for nondeterminism and concurrency
• Process Algebra
• Branching time and abstraction in bisimulation semantics
• Algebra and Coalgebra in Computer Science
• Processes, Terms and Cycles: Steps on the Road to Infinity

This page was built for publication: Preferential choice and coordination conditions