An undecidable problem for timed automata

DOI10.1023/A:1008319830371zbMath0947.93031OpenAlexW1563786920MaRDI QIDQ1300103

Anuj Puri

Publication date: 2 November 2000

Published in: Discrete Event Dynamic Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1008319830371

zbMATH Keywords

undecidabilityhybrid systemsreachabilitytimed automatacounter machines

Mathematics Subject Classification ID

Discrete event control/observation systems (93C65) Attainable sets, reachability (93B03) Control/observation systems governed by functional relations other than differential equations (such as hybrid and switching systems) (93C30)

Related Items (1)

Temporal logics with incommensurable distances are undecidable

This page was built for publication: An undecidable problem for timed automata