Pages that link to "Item:Q4974830"
From MaRDI portal
The following pages link to Verification of Nonconflict of Supervisors Using Abstractions (Q4974830):
Displayed 11 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)
- Supervisory control of discrete event systems with distinguishers (Q889009) (← links)
- Computation of controllable and coobservable sublanguages in decentralized supervisory control via communication (Q1686848) (← links)
- On conditional decomposability (Q1932746) (← links)
- On the computation of counterexamples in compositional nonblocking verification (Q2197583) (← links)
- Coordination control of discrete-event systems revisited (Q2348358) (← links)
- Distributed computation of supremal conditionally controllable sublanguages (Q2792732) (← links)
- Optimal non‐blocking decentralized supervisory control with unobservable controllable events (Q5194895) (← links)
- Progressive events in supervisory control and compositional verification (Q5257781) (← links)
- A survey on compositional algorithms for verification and synthesis in supervisory control (Q6080680) (← links)