Alternating timed automata

DOI10.1145/1342991.1342994MaRDI QIDQ5277799zbMATH OpenOpenAlexFDO

Authors 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

alternationemptiness problemtimed automata

Mathematics Subject Classification ID

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

Recommendations

• Foundations of Software Science and Computational Structures
• Weak Alternating Timed Automata
• Weak alternating timed automata
• Universality analysis for one-clock timed automata
• Automata, Languages and Programming

Cited in

(28)

• A survey on temporal logics for specifying and verifying real-time systems
• Complexity hierarchies beyond elementary
• Emptiness and universality problems in timed automata with positive frequency
• Model Checking Real-Time Systems
• Mixing Lossy and Perfect Fifo Channels
• Universality analysis for one-clock timed automata
• Determinization and Expressiveness of Integer Reset Timed Automata with Silent Transitions
• A survey of timed automata for the development of real-time systems
• Language equations for timed alternating finite automata
• Model-checking timed temporal logics
• Logics meet 1-clock alternating timed automata
• On the Modeling of Sequential Reactive Systems by Means of Real Time Automata
• scientific article; zbMATH DE number 7559498 (Why is no real title available?)
• Determinisability of register and timed automata
• scientific article; zbMATH DE number 7056237 (Why is no real title available?)
• Foundations of Software Science and Computational Structures
• Automata, Languages and Programming
• Timed Basic Parallel Processes
• Weak alternating timed automata
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
• Weak Alternating Timed Automata
• From non-punctuality to non-adjacency: a quest for decidability of timed temporal logics with quantifiers
• Model-checking real-time systems: revisiting the alternating automaton route
• Constraint automata on infinite data trees: from \(\mathrm{CTL}(\mathbb{Z})/\mathrm{CTL}^*(\mathbb{Z})\) to decision procedures
• Constraint automata on infinite data trees: from CTL\((\mathbb{Z})\text{CTL}^*(\mathbb{Z})\) to decision procedures
• Satisfiability checking of multi-variable TPTL with unilateral intervals is PSPACE-complete
• Metric quantifiers and counting in timed logics and automata
• Expressive equivalence between decidable freeze and metric timed temporal logics.

This page was built for publication: Alternating timed automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5277799)