The following pages link to (Q4418006):
Displaying 11 items.
- On parametric timed automata and one-counter machines (Q515666) (← links)
- Network invariants for real-time systems (Q1019007) (← links)
- Detectability of labeled weighted automata over monoids (Q2081085) (← links)
- Classes of timed automata and the undecidability of universality (Q2842589) (← links)
- Incremental Language Inclusion Checking for Networks of Timed Automata (Q2842668) (← links)
- Model-Based Verification, Optimization, Synthesis and Performance Evaluation of Real-Time Systems (Q2948229) (← links)
- Time-Bounded Verification (Q3184695) (← links)
- Unambiguity in Timed Regular Languages: Automata and Logics (Q3588092) (← links)
- Automata, Languages and Programming (Q5716855) (← links)
- Timed Bounded Verification of Inclusion Based on Timed Bounded Discretized Language (Q5859682) (← links)
- Reachability in two-parametric timed automata with one parameter is EXPSPACE-complete (Q6614617) (← links)