Quiescence, fairness, testing, and the notion of implementation
From MaRDI portal
(Redirected from Publication:1376423)
Recommendations
Cites work
- scientific article; zbMATH DE number 3902016 (Why is no real title available?)
- scientific article; zbMATH DE number 4039251 (Why is no real title available?)
- scientific article; zbMATH DE number 3716792 (Why is no real title available?)
- scientific article; zbMATH DE number 48630 (Why is no real title available?)
- A Theory of Communicating Sequential Processes
- Defining liveness
- Extensional equivalences for transition systems
- Quiescence, fairness, testing, and the notion of implementation
- Receptive process theory
- Testing equivalences for processes
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
- Using schedulers to test probabilistic distributed systems
- Fair must testing for I/O automata
- Relational concurrent refinement. III: Traces, partial relations and automata
- Relational concurrent refinement: automata
- scientific article; zbMATH DE number 2013781 (Why is no real title available?)
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)
