The following pages link to (Q4037384):
Displayed 12 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)
- 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)
- 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)
- Simulation relations and applications in formal methods (Q6113980) (← links)
- Equivalence checking 40 years after: a review of bisimulation tools (Q6163887) (← links)