Pages that link to "Item:Q3566992"
From MaRDI portal
The following pages link to Compositional Verification in Supervisory Control (Q3566992):
Displayed 14 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)
- On a structural property in the state complexity of projected regular languages (Q443744) (← links)
- Conceptual design of discrete-event systems using templates (Q539490) (← links)
- Supervisory control of discrete event systems with distinguishers (Q889009) (← links)
- On conditional decomposability (Q1932746) (← links)
- Time-optimal control of large-scale systems of systems using compositional optimization (Q2177769) (← 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 VERIFICATION OF THE GENERALIZED NONBLOCKING PROPERTY USING ABSTRACTION AND CANONICAL AUTOMATA (Q5168410) (← links)
- State Complexity of Projected Languages (Q5200092) (← links)
- Progressive events in supervisory control and compositional verification (Q5257781) (← 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)