Strong splitting bisimulation equivalence

Authors:
J. A. Bergstra;C. A. Middelburg
Affiliations:
Programming Research Group, University of Amsterdam, Amsterdam, The Netherlands;Computing Science Department, Eindhoven University of Technology, Eindhoven, The Netherlands
Venue:
CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
Year:
2005

Citing 12
Cited 3

A Theory of Communicating Sequential Processes

Journal of the ACM (JACM)
Algebraic laws for nondeterminism and concurrency

Journal of the ACM (JACM)
Laws of programming

Communications of the ACM
Global renaming operators in concrete process algebra

Information and Computation
Process algebra

Process algebra
A process specification formalism based on static COLD

Algebraic methods II
Concrete process algebra

Handbook of logic in computer science (vol. 4)
Process algebra with propositional signals

ACP '95 Proceedings from the international workshop on Algebra of communicating processes
Process algebra and conditional composition

Information Processing Letters
Proof Theory for muCRL: A Language for Processes with Data

Proceedings of the International Workshop on Semantics of Specification Languages (SoSL)
Axiomatising ST-Bisimulation Equivalence

PROCOMET '94 Proceedings of the IFIP TC2/WG2.1/WG2.2/WG2.3 Working Conference on Programming Concepts, Methods and Calculi
Process Algebra with Backtracking

A Decade of Concurrency, Reflections and Perspectives, REX School/Symposium

Splitting bisimulations and retrospective conditions

Information and Computation
Thread Algebra with Multi-Level Strategies

Fundamenta Informaticae
Thread Algebra with Multi-Level Strategies

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present ACPc, a process algebra with conditional expressions in which the conditions are taken from a Boolean algebra, and extensions of this process algebra with mechanisms for condition evaluation. We confine ourselves to finitely branching processes. This restriction makes it possible to presentc in a concise and intuitively clear way, and to bring the notion of splitting bisimulation equivalence and the issue of condition evaluation in process algebras with conditional expressions to the forefront.