Revisiting reachability in polynomial interrupt timed automata (Q2059890)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Revisiting reachability in polynomial interrupt timed automata |
scientific article; zbMATH DE number 7444822
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Revisiting reachability in polynomial interrupt timed automata |
scientific article; zbMATH DE number 7444822 |
Statements
Revisiting reachability in polynomial interrupt timed automata (English)
0 references
14 December 2021
0 references
interrupt timed automata
0 references
reachability problems
0 references
complexity
0 references
real-time systems
0 references
