Divergence and fair testing
From MaRDI portal
Publication:4645218
DOI10.1007/3-540-60084-1_112zbMath1412.68155OpenAlexW1557260581MaRDI QIDQ4645218
No author found.
Publication date: 10 January 2019
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-60084-1_112
visible actionlabeled transition systemalternative characterizationtraditional testingvisible content
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (23)
On the validity of encodings of the synchronous in the asynchronous \(\pi\)-calculus ⋮ Just testing ⋮ Theory of interaction ⋮ Fair must testing for I/O automata ⋮ Observing Success in the Pi-Calculus ⋮ Structural Rewriting in the pi-Calculus. ⋮ Trace- and failure-based semantics for responsiveness ⋮ Separation of synchronous and asynchronous communication via testing ⋮ Fair simulation ⋮ On the representation of McCarthy's \(amb\) in the \(\pi\)-calculus ⋮ Ensuring liveness properties of distributed systems: open problems ⋮ Relating fair testing and accordance for service replaceability ⋮ An introduction to metric semantics: Operational and denotational models for programming and specification languages ⋮ A hierarchy of equivalences for asynchronous calculi ⋮ Closures of may-, should- and must-convergences for contextual equivalence ⋮ Divergence in testing and readiness semantics ⋮ Basic observables for processes ⋮ Basic observables for processes ⋮ A Logical Process Calculus ⋮ Fair simulation ⋮ Fair Π ⋮ Synchrony vs Asynchrony in Communication Primitives ⋮ Impossible futures and determinism
Cites Work
- Fairness and conspiracies
- An algebraic theory of fair asynchronous communicating processes
- Extensional equivalences for transition systems
- Testing equivalences for processes
- Weak and strong fairness in CCS
- Algebraic specification and verification of communication protocols
- A Theory of Communicating Sequential Processes
- Applications of Process Algebra
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Divergence and fair testing
