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

visible actionlabeled transition systemalternative characterizationtraditional testingvisible 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

• 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?)
• 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
• Testing equivalences for processes
• Weak and strong fairness in CCS

Cited in

(28)

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

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)