Time-Bounded Reachability Problem for Recursive Timed Automata is Undecidable (Q2799176)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Time-Bounded Reachability Problem for Recursive Timed Automata is Undecidable |
scientific article |
Statements
Time-Bounded Reachability Problem for Recursive Timed Automata is Undecidable (English)
0 references
8 April 2016
0 references
recursive state machines
0 references
timed automata
0 references
reachability
0 references
