CONFLICTS AND FAIR TESTING

DOI10.1142/S012905410600411XMaRDI QIDQ5484903zbMATH OpenWikidataFDO

Authors Robi Malik, David Streader, Steve Reeves

Publication date 21 August 2006

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S012905410600411X

zbMATH Keywords

discrete event systemsmodel checkingnonblockingprocess-algebra

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Automated Technology for Verification and Analysis
• Divergence and fair testing
• scientific article; zbMATH DE number 4096790
• FM 2005: Formal Methods
• Refusal testing

Cites work

• Automata theory: Its past and future
• Automatic verification of finite-state concurrent systems using temporal logic specifications
• scientific article; zbMATH DE number 4039251 (Why is no real title available?)
• scientific article; zbMATH DE number 48630 (Why is no real title available?)
• Modular control and coordination of discrete-event systems
• Supervisory control of distributed systems: Conflict resolution
• Testing equivalences for processes

Cited in

(14)

• Relational concurrent refinement. II: Internal operations and outputs
• On the computation of counterexamples in compositional nonblocking verification
• Hierarchical modelling of manufacturing systems using discrete event systems and the conflict preorder
• Compositional synthesis of maximally permissive supervisors using supervision equivalence
• A framework for compositional nonblocking verification of extended finite-state machines
• Conflict-preserving abstraction of discrete event systems using annotated automata
• Trace- and failure-based semantics for responsiveness
• Compositional verification of the generalized nonblocking property using abstraction and canonical automata
• Progressive events in supervisory control and compositional verification
• Automated Technology for Verification and Analysis
• Fair subtyping for multi-party session types
• Modular supervisory control with equivalence-based abstraction and covering-based conflict resolution
• A survey on compositional algorithms for verification and synthesis in supervisory control
• Relating fair testing and accordance for service replaceability

This page was built for publication: CONFLICTS AND FAIR TESTING

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