Efficient Detection of Zeno Runs in Timed Automata

DOI10.1007/978-3-540-75454-1_15zbMath1141.68435OpenAlexW1603296878MaRDI QIDQ3510844

Rodolfo Gomez, Howard Bowman

Publication date: 3 July 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://kar.kent.ac.uk/14538/1/GomezBowman_FORMATS07.pdf

zbMATH Keywords

Model-checkingUppaalTimed AutomataZeno Runs

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (9)

Thin and Thick Timed Regular Languages ⋮ Distributed parametric model checking timed automata under non-zenoness assumption ⋮ Diagnosis of timed patterns for discrete event systems by means of state isolation ⋮ Efficient emptiness check for timed Büchi automata ⋮ Finding minimum and maximum termination time of timed automata models with cyclic behaviour ⋮ Efficient controller synthesis for a fragment of \(\mathrm{MTL}_{0,\infty}\) ⋮ A menagerie of timed automata ⋮ Coarse Abstractions Make Zeno Behaviours Difficult to Detect ⋮ Entropy of regular timed languages

Uses Software

• Kronos
• Uppaal

This page was built for publication: Efficient Detection of Zeno Runs in Timed Automata