Timed Unfoldings for Networks of Timed Automata
From MaRDI portal
Publication:3522916
Recommendations
- Symbolic Unfoldings for Networks of Timed Automata
- Complete Finite Prefixes of Symbolic Unfoldings of Safe Time Petri Nets
- Model checking of time Petri nets based on partial order semantics
- Partial order reduction for model checking of timed automata
- Symbolic unfolding of parametric stopwatch Petri nets
Cited in
(13)- Unifying behavioral equivalences of timed transition systems
- Event clock message passing automata: a logical characterization and an emptiness checking algorithm
- Symbolic unfolding of parametric stopwatch Petri nets
- Checking conformance for time-constrained scenario-based specifications
- Timed Petri nets and timed automata: On the discriminating power of Zeno sequences
- Adding Invariants to Event Zone Automata
- Symbolic Unfoldings for Networks of Timed Automata
- Distributed Timed Automata with Independently Evolving Clocks
- Regular set of representatives for time-constrained MSC graphs
- Abstraction Strategies for Computing Travelling or Looping Durations in Networks of Timed Automata
- A local-time semantics for negotiations
- Abstractions for the local-time semantics of timed automata: a foundation for partial-order methods
- Semantic domains of timed event structures
This page was built for publication: Timed Unfoldings for Networks of Timed Automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3522916)