The following pages link to (Q4037384):
Displaying 13 items.
- Weighted o-minimal hybrid systems (Q636266) (← links)
- The algorithmic analysis of hybrid systems (Q673868) (← links)
- \(\text{DELFIN}^+\): an efficient deadlock detection tool for CCS processes (Q856423) (← links)
- Generating symbolic traces in the insertion modeling system (Q895075) (← links)
- Minimal state graph generation (Q1193742) (← links)
- An efficient algorithm for computing bisimulation equivalence (Q1884935) (← links)
- Discrete-time control for rectangular hybrid automata (Q1960531) (← links)
- On the expressiveness and decidability of o-minimal hybrid systems (Q2387414) (← links)
- Modular construction of minimal models (Q2401922) (← links)
- Using heuristic search for finding deadlocks in concurrent systems (Q2573636) (← links)
- Abstraction and Abstraction Refinement (Q3176371) (← links)
- Hybrid automata with finite bisimulations (Q4645189) (← links)
- Rank-Based Symbolic Bisimulation (Q4916208) (← links)