The following pages link to (Q4259992):
Displaying 8 items.
- Fairness of transitions in diagnosability of discrete event systems (Q708892) (← links)
- PSPACE-completeness of modular supervisory control problems (Q1773103) (← links)
- On the complexity of verifying concurrent transition systems (Q1854510) (← links)
- Automatic discovery of fair paths in infinite-state transition systems (Q2147176) (← links)
- (Q4472203) (← links)
- Theoretical Aspects of Computing – ICTAC 2005 (Q5395127) (← links)
- Logic for Programming, Artificial Intelligence, and Reasoning (Q5705922) (← links)
- Checking history-determinism is NP-hard for parity automata (Q6629459) (← links)