The following pages link to CONFLICTS AND FAIR TESTING (Q5484903):
Displaying 13 items.
- A framework for compositional nonblocking verification of extended finite-state machines (Q262429) (← links)
- Conflict-preserving abstraction of discrete event systems using annotated automata (Q351736) (← links)
- Trace- and failure-based semantics for responsiveness (Q478516) (← links)
- Relating fair testing and accordance for service replaceability (Q974133) (← links)
- Relational concurrent refinement. II: Internal operations and outputs (Q1019018) (← links)
- On the computation of counterexamples in compositional nonblocking verification (Q2197583) (← links)
- Hierarchical modelling of manufacturing systems using discrete event systems and the conflict preorder (Q2348366) (← links)
- Compositional synthesis of maximally permissive supervisors using supervision equivalence (Q2465421) (← links)
- COMPOSITIONAL VERIFICATION OF THE GENERALIZED NONBLOCKING PROPERTY USING ABSTRACTION AND CANONICAL AUTOMATA (Q5168410) (← links)
- Progressive events in supervisory control and compositional verification (Q5257781) (← links)
- Fair subtyping for multi-party session types (Q5741567) (← links)
- Modular supervisory control with equivalence-based abstraction and covering-based conflict resolution (Q5962026) (← links)
- A survey on compositional algorithms for verification and synthesis in supervisory control (Q6080680) (← links)
