Preferential choice and coordination conditions
type: Item
instance of: scholarly article
title: Preferential choice and coordination conditions
zbMATH Open document ID: 1106.68071
author: C. A. Middelburg
author: J. A. Bergstra
published in: The Journal of Logic and Algebraic Programming
publication date: 2007-02-09T00:00:00Z
Mathematics Subject Classification ID: 68Q85
zbMATH DE Number: 5123662
zbMATH Keywords: coordination conditions
zbMATH Keywords: preferential choice
zbMATH Keywords: splitting bisimulation
zbMATH Keywords: process algebra
zbMATH Keywords: Boolean algebra
MaRDI profile type: Publication
full work available at URL: j.jlap.2006.08.004
OpenAlex ID: W2129235856
cites work: Splitting bisimulations and retrospective conditions
cites work: Process algebra for synchronous communication
cites work: Process Algebra
cites work: Priority in process algebra.
cites work: Q4727412
cites work: A Theory of Communicating Sequential Processes
cites work: Q3777424
cites work: Algebraic laws for nondeterminism and concurrency
cites work: Q3992568
cites work: CCS with priority choice
cites work: Q4791842
cites work: Q3994998
cites work: Global renaming operators in concrete process algebra
cites work: Algebraic methods II: theory, tools and applications
cites work: Q4385539
cites work: Q4702592
cites work: Process algebra with propositional signals
cites work: Laws of programming
cites work: Q5721231
cites work: Q4023900
cites work: Algebra of communicating processes with abstraction
cites work: Bisimulation through probabilistic testing
cites work: Symbolic bisimulations
cites work: Processes, Terms and Cycles: Steps on the Road to Infinity
cites work: Branching time and abstraction in bisimulation semantics
cites work: On the consistency of Koomen's fair abstraction rule
cites work: Algebra and Coalgebra in Computer Science
cites work: Branching time and orthogonal bisimulation equivalence
DOI: 10.1016/J.JLAP.2006.08.004
description: scientific article; zbMATH DE number 5123662