An efficient state space construction for a class of timed automata
From MaRDI portal
Recommendations
- Abstraction Strategies for Computing Travelling or Looping Durations in Networks of Timed Automata
- An introduction to timed automata
- Static guard analysis in timed automata verification
- Automatic abstraction algorithm for timed automata
- State class constructions for branching analysis of time Petri nets
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?)
- Multi-valued verification of strategic ability
- Timed automata: Semantics, algorithms and tools
- 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)