Fast algorithms for handling diagonal constraints in timed automata

DOI10.1007/978-3-030-25540-4_3arXiv1904.08590MaRDI QIDQ6154574

Sayan Mukherjee, Paul Gastin, B. Srivathsan

Publication date: 16 February 2024

Published in: Computer Aided Verification (Search for Journal in Brave)

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

zbMATH Keywords

reachabilitytimed automatadiagonal constraints

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

Fast zone-based algorithms for reachability in pushdown timed automata ⋮ Zone-based verification of timed automata: extrapolations, simulations and what next?

This page was built for publication: Fast algorithms for handling diagonal constraints in timed automata