The following pages link to (Q4270062):
Displayed 12 items.
- Linear reachability problems and minimal solutions to linear Diophantine equation systems (Q703515) (← links)
- Verification in loosely synchronous queue-connected discrete timed automata. (Q1401187) (← links)
- Generalized discrete timed automata: Decidable approximations for safety verification. (Q1401259) (← links)
- Pushdown timed automata: A binary reachability characterization and safety verification. (Q1401320) (← links)
- Well-abstracted transition systems: Application to FIFO automata. (Q1401924) (← links)
- Past pushdown timed automata and safety verification. (Q1426159) (← links)
- Augmenting the discrete timed automaton with other data structures. (Q1853524) (← links)
- Presburger liveness verification of discrete timed automata. (Q1874402) (← links)
- Decidable first-order transition logics for PA-processes (Q2575856) (← links)
- Thin and Thick Timed Regular Languages (Q3172847) (← links)
- Removing All Silent Transitions from Timed Automata (Q3648827) (← links)
- An Automata-Theoretic Approach to the Reachability Analysis of RPPS Systems (Q4917080) (← links)