Let's be lazy, we have time -- or, lazy reachability analysis for timed automata
From MaRDI portal
Publication:1683453
DOI10.1007/978-3-319-65765-3_14zbMath1494.68182MaRDI QIDQ1683453
Publication date: 1 December 2017
Full work available at URL: https://doi.org/10.1007/978-3-319-65765-3_14
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
Uses Software