The following pages link to (Q4037383):
Displayed 11 items.
- A framework for compositional nonblocking verification of extended finite-state machines (Q262429) (← links)
- Compositional synthesis of supervisors in the form of state machines and state maps (Q503186) (← links)
- Using partial orders for the efficient verification of deadlock freedom and safety properties (Q1801499) (← links)
- Iterating transducers (Q1858440) (← links)
- On the computation of counterexamples in compositional nonblocking verification (Q2197583) (← links)
- Cartesian difference categories (Q2200813) (← links)
- Compositional verification of asynchronous concurrent systems using CADP (Q2350492) (← links)
- Compositional Failure-based Equivalence of Constraint Automata (Q2810975) (← links)
- Compositional Reasoning (Q3176370) (← links)
- Sharp Congruences Adequate with Temporal Logics Combining Weak and Strong Modalities (Q5164168) (← links)
- Progressive events in supervisory control and compositional verification (Q5257781) (← links)