CONFLICTS AND FAIR TESTING

DOI10.1142/S012905410600411XzbMATH Open1096.68109WikidataQ59651705 ScholiaQ59651705MaRDI QIDQ5484903FDOQ5484903

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)

Recommendations

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

zbMATH Keywords

model checkingnonblockingdiscrete event systemsprocess-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)

Cites Work

• Title not available (Why is that?)
• Testing equivalences for processes
• Automatic verification of finite-state concurrent systems using temporal logic specifications
• Title not available (Why is that?)
• Modular control and coordination of discrete-event systems
• Supervisory control of distributed systems: Conflict resolution
• Automata theory: Its past and future

Cited In (14)

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

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)