Weak Alternating Timed Automata

DOI10.2168/LMCS-8(3:18)2012zbMath1258.03047arXiv1208.5909OpenAlexW3104737963MaRDI QIDQ5891771

Paweł Parys, Igor Walukiewicz

Publication date: 25 September 2012

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1208.5909

zbMATH Keywords

verificationdecidabilityinfinite wordstimed systemstimed temporal logicalternating timed automata

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Specification and verification (program logics, model checking, etc.) (68Q60) Decidability of theories and sets of sentences (03B25) Temporal logic (03B44)

This page was built for publication: Weak Alternating Timed Automata