When is partial trace equivalence adequate?

DOI10.1007/BF01215409zbMath0942.68609MaRDI QIDQ1333407

Bard Bloom

Publication date: 14 August 2000

Published in: Formal Aspects of Computing (Search for Journal in Brave)

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Semantics in the theory of computing (68Q55)

Related Items (4)

Unnamed Item ⋮ Unnamed Item ⋮ Sequencing and intermediate acceptance: Axiomatisation and decidability of bisimilarity ⋮ Divide and congruence. III: From decomposition of modal formulas to preservation of stability and divergence

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bisimulation and divergence
• Calculi for synchrony and asynchrony
• Determinacy \(\to\) (observation equivalence \(=\) trace equivalence)
• Higher-level synchronising devices in Meije-SCCS
• The lambda calculus, its syntax and semantics
• Experimenting with process equivalence
• Structured operational semantics and bisimulation as a congruence
• Testing equivalences for processes
• Determinism \(\to\) (event structure isomorphism \(=\) step sequence equivalence)
• Synchronous and asynchronous experiments on processes
• A Theory of Communicating Sequential Processes
• Communicating sequential processes
• Quantales, observational logic and process semantics
• Bisimulation can't be traced
• Branching time and abstraction in bisimulation semantics
• The meaning of negative premises in transition system specifications

This page was built for publication: When is partial trace equivalence adequate?