CONFLICTS AND FAIR TESTING

DOI10.1142/S012905410600411XzbMath1096.68109WikidataQ59651705 ScholiaQ59651705MaRDI QIDQ5484903

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)

zbMATH Keywords

model checkingdiscrete event systemsnonblockingprocess-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)

Related Items

Conflict-preserving abstraction of discrete event systems using annotated automata, A survey on compositional algorithms for verification and synthesis in supervisory control, On the computation of counterexamples in compositional nonblocking verification, Trace- and failure-based semantics for responsiveness, Compositional synthesis of maximally permissive supervisors using supervision equivalence, COMPOSITIONAL VERIFICATION OF THE GENERALIZED NONBLOCKING PROPERTY USING ABSTRACTION AND CANONICAL AUTOMATA, Fair subtyping for multi-party session types, Relating fair testing and accordance for service replaceability, Modular supervisory control with equivalence-based abstraction and covering-based conflict resolution, Relational concurrent refinement. II: Internal operations and outputs, Progressive events in supervisory control and compositional verification, Hierarchical modelling of manufacturing systems using discrete event systems and the conflict preorder, A framework for compositional nonblocking verification of extended finite-state machines

Cites Work

• Modular control and coordination of discrete-event systems
• Testing equivalences for processes
• Supervisory control of distributed systems: Conflict resolution
• Automatic verification of finite-state concurrent systems using temporal logic specifications
• Unnamed Item
• Unnamed Item
• Unnamed Item