Quiescence, fairness, testing, and the notion of implementation

DOI10.1006/inco.1997.2652zbMath0889.68057OpenAlexW1974396748MaRDI QIDQ1376423

Roberto Segala

Publication date: 6 April 1998

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/8090682ada18aeed9d656ed7c4dcfc086af38d16

zbMATH Keywords

MUST preordertheory of testing

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items

Quiescence, fairness, testing, and the notion of implementation ⋮ An algebraic theory of interface automata ⋮ Using schedulers to test probabilistic distributed systems ⋮ Fair must testing for I/O automata ⋮ Relational Concurrent Refinement: Automata ⋮ A process algebraic view of input/output automata ⋮ Relational concurrent refinement. III: Traces, partial relations and automata ⋮ Liveness in timed and untimed systems

Cites Work

• Receptive process theory
• Defining liveness
• Extensional equivalences for transition systems
• Testing equivalences for processes
• Quiescence, fairness, testing, and the notion of implementation
• A Theory of Communicating Sequential Processes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item