Alternating timed automata

DOI10.1145/1342991.1342994zbMath1367.68172OpenAlexW1964297656MaRDI QIDQ5277799

Sławomir Lasota, Igor Walukiewicz

Publication date: 12 July 2017

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1342991.1342994

zbMATH Keywords

timed automataalternationemptiness problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (14)

Model Checking Real-Time Systems ⋮ On the Modeling of Sequential Reactive Systems by Means of Real Time Automata ⋮ A survey of timed automata for the development of real-time systems ⋮ A survey on temporal logics for specifying and verifying real-time systems ⋮ Unnamed Item ⋮ Mixing Lossy and Perfect Fifo Channels ⋮ Timed Basic Parallel Processes ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Determinization and Expressiveness of Integer Reset Timed Automata with Silent Transitions ⋮ Unnamed Item ⋮ Complexity Hierarchies beyond Elementary ⋮ Model-checking Timed Temporal Logics ⋮ Generalized Post embedding problems

This page was built for publication: Alternating timed automata