An efficient state space construction for a class of timed automata

DOI10.1007/978-3-662-68191-6_10MaRDI QIDQ6550569zbMATH OpenFDO

Authors Johan Arcile, Raymond Devillers, Hanna Klaudel

Publication date 5 June 2024

Full work available at URL https://doi.org/10.1007/978-3-662-68191-6_10

zbMATH Keywords

abstractionmodel checkingtimed automatazone 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)

Recommendations

• Abstraction Strategies for Computing Travelling or Looping Durations in Networks of Timed Automata
• An introduction to timed automata
• scientific article; zbMATH DE number 1956585
• Automatic abstraction algorithm for timed automata
• scientific article; zbMATH DE number 1956600

Cites work

• A theory of timed automata
• Dynamic exploration of multi-agent systems with periodic timed tasks
• scientific article; zbMATH DE number 1748069 (Why is no real title available?)
• Lectures on Concurrency and Petri Nets
• Multi-valued verification of strategic ability
• Tools and Algorithms for the Construction and Analysis of Systems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6550569)