Pages that link to "Item:Q707597"
From MaRDI portal
The following pages link to Reachability results for timed automata with unbounded data structures (Q707597):
Displaying 5 items.
- Weak bisimulation for probabilistic timed automata (Q606996) (← links)
- Perfect timed communication is hard (Q1631220) (← links)
- Time-Bounded Reachability Problem for Recursive Timed Automata is Undecidable (Q2799176) (← links)
- A rewriting framework and logic for activities subject to regulations (Q2973251) (← links)
- Verification for Timed Automata extended with Unbounded Discrete Data Structures (Q3196352) (← links)