Impossible futures and determinism

DOI10.1016/S0020-0190(01)00217-4zbMath1003.68090MaRDI QIDQ1607117

Marc Voorhoeve, Sjouke Mauw

Publication date: 25 July 2002

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

process preorders

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (12)

Fair testing ⋮ Coupled similarity: the first 32 years ⋮ Complete and ready simulation semantics are not finitely based over BCCSP, even with a singleton alphabet ⋮ A Context-Free Process as a Pushdown Automaton ⋮ Axiomatizing weak simulation semantics over BCCSP ⋮ Trace- and failure-based semantics for responsiveness ⋮ Coinductive Characterisations Reveal Nice Relations Between Preorders and Equivalences ⋮ On Finite Bases for Weak Semantics: Failures Versus Impossible Futures ⋮ On the Unification of Process Semantics: Observational Semantics ⋮ A general approach to comparing infinite-state systems with their finite-state specifications ⋮ On the Unification of Process Semantics: Equational Semantics ⋮ Axiomatizing Weak Ready Simulation Semantics over BCCSP

Cites Work

• Determinacy \(\to\) (observation equivalence \(=\) trace equivalence)
• Testing equivalences for processes
• Algebraic laws for nondeterminism and concurrency
• Process Algebra
• Bisimulation can't be traced
• Divergence and fair testing
• Unnamed Item

This page was built for publication: Impossible futures and determinism