Trace, failure and testing equivalences for communicating processes
DOI10.1007/BF01407903zbMATH Open0646.68033OpenAlexW2058636690MaRDI QIDQ1104076FDOQ1104076
Authors: Michael Main
Publication date: 1987
Published in: International Journal of Parallel Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01407903
Recommendations
testing equivalencecommunicating processesfailure equivalenceimproved failure semanticsmust testing- semanticsstring-based semantic order
Specification and verification (program logics, model checking, etc.) (68Q60) Theory of operating systems (68N25)
Cites Work
- Title not available (Why is that?)
- A calculus of communicating systems
- Communicating sequential processes
- Formal verification of parallel programs
- Observation equivalence as a testing equivalence
- A Theory of Communicating Sequential Processes
- Guarded commands, nondeterminacy and formal derivation of programs
- Power domains
- Title not available (Why is that?)
- Semantics of communicating processes
- Synchronous and asynchronous experiments on processes
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (19)
- Title not available (Why is that?)
- Trace- and failure-based semantics for responsiveness
- Basic observables for processes
- On an effective hierarchy of communicating processes: Separation principle and testing
- Title not available (Why is that?)
- Determinacy \(\to\) (observation equivalence \(=\) trace equivalence)
- Refusal testing
- Observation equivalence as a testing equivalence
- Readies and Failures in the Algebra of Communicating Processes
- Branching vs. Linear Time: Semantical Perspective
- Testing equivalences for processes
- Power simulation and its relation to traces and failures refinement
- Trace and testing equivalence on asynchronous processes
- Removing redundant refusals: minimal complete test suites for failure trace semantics
- Basic observables for processes
- A logical process calculus
- Title not available (Why is that?)
- Axiomatising Finite Concurrent Processes
- Compositional failure-based semantic models for basic LOTOS
This page was built for publication: Trace, failure and testing equivalences for communicating processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1104076)