Quiescence, fairness, testing, and the notion of implementation

DOI10.1006/INCO.1997.2652zbMATH Open0889.68057OpenAlexW1974396748MaRDI QIDQ1376423FDOQ1376423

Authors: 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

Recommendations

• scientific article; zbMATH DE number 938070
• scientific article; zbMATH DE number 2013781
• On Conformance Testing for Timed Systems
• scientific article; zbMATH DE number 3956420

zbMATH Keywords

MUST preordertheory of testing

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Testing equivalences for processes
• A Theory of Communicating Sequential Processes
• Title not available (Why is that?)
• Extensional equivalences for transition systems
• Defining liveness
• Quiescence, fairness, testing, and the notion of implementation
• Receptive process theory

Cited In (9)

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

This page was built for publication: Quiescence, fairness, testing, and the notion of implementation

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