An efficient state space construction for a class of timed automata

DOI10.1007/978-3-662-68191-6_10MaRDI QIDQ6550569

Hanna Klaudel, Johan Arcile, Raymond Devillers

Publication date: 5 June 2024

zbMATH Keywords

timed automatamodel checkingabstractionzone graph

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

This page was built for publication: An efficient state space construction for a class of timed automata