Trace, failure and testing equivalences for communicating processes
From MaRDI portal
Publication:1104076
Recommendations
Cites work
- scientific article; zbMATH DE number 3817027 (Why is no real title available?)
- scientific article; zbMATH DE number 3819069 (Why is no real title available?)
- scientific article; zbMATH DE number 3902016 (Why is no real title available?)
- scientific article; zbMATH DE number 3903937 (Why is no real title available?)
- A Theory of Communicating Sequential Processes
- A calculus of communicating systems
- Communicating sequential processes
- Formal verification of parallel programs
- Guarded commands, nondeterminacy and formal derivation of programs
- Observation equivalence as a testing equivalence
- Power domains
- Semantics of communicating processes
- Synchronous and asynchronous experiments on processes
Cited in
(22)- Trace- and failure-based semantics for responsiveness
- Testing equivalence vs. runtime monitoring
- On an effective hierarchy of communicating processes: Separation principle and testing
- Refusal testing
- Power simulation and its relation to traces and failures refinement
- Removing redundant refusals: minimal complete test suites for failure trace semantics
- Observation equivalence as a testing equivalence
- Determinacy \(\to\) (observation equivalence \(=\) trace equivalence)
- scientific article; zbMATH DE number 3956420 (Why is no real title available?)
- Compositional failure-based semantic models for basic LOTOS
- Processes, systems \& tests: defining contextual equivalences
- scientific article; zbMATH DE number 3902016 (Why is no real title available?)
- Basic observables for processes
- A logical process calculus
- Testing equivalences for processes
- Trace and testing equivalence on asynchronous processes
- Axiomatising Finite Concurrent Processes
- scientific article; zbMATH DE number 4104372 (Why is no real title available?)
- Branching vs. Linear Time: Semantical Perspective
- Basic observables for processes
- Readies and Failures in the Algebra of Communicating Processes
- All congruences below stability-preserving fair testing or CFFD
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)