Divergence and fair testing

DOI10.1007/3-540-60084-1_112MaRDI QIDQ4645218zbMATH OpenOpenAlexFDO

Authors

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

zbMATH Keywords

alternative characterizationlabeled transition systemtraditional testingvisible actionvisible content

Mathematics Subject Classification ID

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)

Recommendations

• Explicit fairness in testing semantics
• scientific article; zbMATH DE number 1418454
• scientific article; zbMATH DE number 39877
• Concurrent testing of processes
• Divergence in testing and readiness semantics

Cites work

• A Theory of Communicating Sequential Processes
• Algebraic specification and verification of communication protocols
• An algebraic theory of fair asynchronous communicating processes
• Applications of Process Algebra
• Extensional equivalences for transition systems
• Fairness and conspiracies
• scientific article; zbMATH DE number 3972158 (Why is no real title available?)
• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 48630 (Why is no real title available?)
• Testing equivalences for processes
• Weak and strong fairness in CCS

Cited in

(29)

• An invitation to friendly testing
• Basic observables for processes
• Impossible futures and determinism
• On the validity of encodings of the synchronous in the asynchronous -calculus
• On the representation of McCarthy's amb in the -calculus
• A hierarchy of equivalences for asynchronous calculi
• Fair simulation
• Ensuring liveness properties of distributed systems: open problems
• Separation of synchronous and asynchronous communication via testing
• A logical process calculus
• Fair \(\pi\)
• Synchrony vs asynchrony in communication primitives
• Explicit fairness in testing semantics
• Basic observables for processes
• Trace- and failure-based semantics for responsiveness
• Structural rewriting in the pi-calculus
• Observing success in the pi-calculus
• Automated Technology for Verification and Analysis
• CONFLICTS AND FAIR TESTING
• An introduction to metric semantics: Operational and denotational models for programming and specification languages
• Divergence in testing and readiness semantics
• Fair simulation
• Just testing
• Fair must testing for I/O automata
• A unifying approach to probabilistic testing equivalences
• Fair testing
• Theory of interaction
• Relating fair testing and accordance for service replaceability
• Closures of may-, should- and must-convergences for contextual equivalence

This page was built for publication: Divergence and fair testing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4645218)