Pages that link to "Item:Q1300103"
From MaRDI portal
The following pages link to An undecidable problem for timed automata (Q1300103):
Displaying 5 items.
- Temporal logics with incommensurable distances are undecidable (Q879597) (← links)
- Time-Bounded Reachability Problem for Recursive Timed Automata is Undecidable (Q2799176) (← links)
- Undecidability over Continuous Time (Q3424115) (← links)
- Reachability in Timed Counter Systems (Q5179060) (← links)
- Tools and Algorithms for the Construction and Analysis of Systems (Q5308410) (← links)