Detecting Quasi-equal Clocks in Timed Automata

DOI10.1007/978-3-642-40229-6_14zbMATH Open1390.68437OpenAlexW76851266MaRDI QIDQ2842671

Andreas Podelski, Bernd Westphal, Marco Muñiz

Publication date: 16 August 2013

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

Full work available at URL: https://doi.org/10.1007/978-3-642-40229-6_14

Mathematics Subject Classification ID

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

Related Items (3)

Biased clocks: a novel approach to improve the ability to perform predicate detection with \(O(1)\) clocks ⋮ The efficiency of identifying timed automata and the power of clocks ⋮ Automated verification for real-time systems. Via implicit clocks and an extended Antimirov algorithm

This page was built for publication: Detecting Quasi-equal Clocks in Timed Automata

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