Splitting bisimulations and retrospective conditions

DOI10.1016/J.IC.2006.03.003MaRDI QIDQ2500474zbMATHzbMATHOpenAlexFDO

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

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)

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.

Cites work

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

Cited in

(8)

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

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)