Power simulation and its relation to traces and failures refinement

DOI10.1016/S0304-3975(03)00200-7zbMath1070.68103OpenAlexW2054356921MaRDI QIDQ1884900

Paul H. B. Gardiner

Publication date: 27 October 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(03)00200-7

zbMATH Keywords

UnificationBisimulationFailuresPredicate transformerProgram semantics

Mathematics Subject Classification ID

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

Related Items (5)

An analysis of refinement in an abortive paradigm ⋮ CSP is a retract of CCS ⋮ Synchronous Message Passing: On the Relation between Bisimulation and Refusal Equivalence ⋮ (Bi)simulations up-to characterise process semantics ⋮ Relational Decomposition

Cites Work

• Algebraic proofs of consistency and completeness
• A single complete rule for data refinement
• An algebraic construction of predicate transformers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Power simulation and its relation to traces and failures refinement