Splitting bisimulations and retrospective conditions

DOI10.1016/J.IC.2006.03.003zbMATH Open1104.68070OpenAlexW2135597391MaRDI QIDQ2500474FDOQ2500474

Authors: C. A. Middelburg, J. A. Bergstra 

Publication date: 16 August 2006

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2006.03.003

Recommendations

• Algebra and Coalgebra in Computer Science
• A generalization of ACP using Belnap's logic
• A generalization of ACP using Belnap's logic
• Bisimulation for conditional modalities
• Bisimilarity of open terms.

zbMATH Keywords

process algebraBoolean algebrassplitting bisimulationstate operatorscondition evaluationretrospective conditionssignal emission

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Process algebra for hybrid systems
• Structural operational semantics.
• Process algebra for synchronous communication
• Laws of programming
• Algebraic laws for nondeterminism and concurrency
• Title not available (Why is that?)
• Title not available (Why is that?)
• Bisimulation through probabilistic testing
• Model theory.
• Process algebra with propositional signals
• A Theory of Communicating Sequential Processes
• Process Algebra
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the consistency of Koomen's fair abstraction rule
• Global renaming operators in concrete process algebra
• Process algebra and conditional composition
• Thread algebra with multi-level strategies
• Algebraic methods II: theory, tools and applications
• Algebra and Coalgebra in Computer Science
• Processes, Terms and Cycles: Steps on the Road to Infinity
• Discrete time process algebra and the semantics of SDL
• Title not available (Why is that?)

Cited In (8)

• Maurer computers for pipelined instruction processing
• Simulating Turing machines on Maurer machines
• Preferential choice and coordination conditions
• A thread calculus with molecular dynamics
• A process calculus with finitary comprehended terms
• Algebra and Coalgebra in Computer Science
• Divide and Congruence: From Decomposition of Modalities to Preservation of Branching Bisimulation
• Using Hoare Logic in a Process Algebra Setting

This page was built for publication: Splitting bisimulations and retrospective conditions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2500474)