When is partial trace equivalence adequate?
From MaRDI portal
Cites work
- A Theory of Communicating Sequential Processes
- Bisimulation and divergence
- Bisimulation can't be traced
- Branching time and abstraction in bisimulation semantics
- Calculi for synchrony and asynchrony
- Communicating sequential processes
- Determinacy \(\to\) (observation equivalence \(=\) trace equivalence)
- Determinism \(\to\) (event structure isomorphism \(=\) step sequence equivalence)
- Experimenting with process equivalence
- Higher-level synchronising devices in Meije-SCCS
- scientific article; zbMATH DE number 3978362 (Why is no real title available?)
- scientific article; zbMATH DE number 17804 (Why is no real title available?)
- scientific article; zbMATH DE number 4119615 (Why is no real title available?)
- scientific article; zbMATH DE number 3894457 (Why is no real title available?)
- Quantales, observational logic and process semantics
- Structured operational semantics and bisimulation as a congruence
- Synchronous and asynchronous experiments on processes
- Testing equivalences for processes
- The lambda calculus, its syntax and semantics
- The meaning of negative premises in transition system specifications
Cited in
(5)- Divide and congruence. III: From decomposition of modal formulas to preservation of stability and divergence
- Sequential composition in the presence of intermediate termination (extended abstract)
- scientific article; zbMATH DE number 7453959 (Why is no real title available?)
- Sequencing and intermediate acceptance: Axiomatisation and decidability of bisimilarity
- Sequential value passing yields a Kleene theorem for processes
This page was built for publication: When is partial trace equivalence adequate?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1333407)
