The following pages link to (Q4551181):
Displaying 14 items.
- 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)
- Past pushdown timed automata and safety verification. (Q1426159) (← links)
- Adding dense-timed stack to integer reset timed automata (Q1685773) (← links)
- On store languages of language acceptors (Q1786598) (← links)
- Counter machines and verification problems. (Q1853523) (← links)
- Presburger liveness verification of discrete timed automata. (Q1874402) (← links)
- Eliminating the storage tape in reachability constructions. (Q1874416) (← links)
- Reachability relations of timed pushdown automata (Q2221811) (← links)
- On families of full trios containing counter machine languages (Q2333810) (← links)
- Reachability in two-clock timed automata is PSPACE-complete (Q2347796) (← links)
- Coalgebraic Semantic Model for the Clock Constraint Specification Language (Q3460225) (← links)
- Timed Basic Parallel Processes (Q5875376) (← links)