Let's be lazy, we have time -- or, lazy reachability analysis for timed automata

DOI10.1007/978-3-319-65765-3_14zbMath1494.68182MaRDI QIDQ1683453

Didier Lime, Loïg Jezequel

Publication date: 1 December 2017

Full work available at URL: https://doi.org/10.1007/978-3-319-65765-3_14

Mathematics Subject Classification ID

68Q45: Formal languages and automata

68Q60: Specification and verification (program logics, model checking, etc.)

68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)

Related Items

A lazy query scheme for reachability analysis in Petri nets

Uses Software

• Uppaal