On Interleaving in Timed Automata
From MaRDI portal
Publication:5756592
Recommendations
Cited in
(14)- Efficient convex zone merging in parametric timed automata
- Tools and Algorithms for the Construction and Analysis of Systems
- Covering steps graphs of time Petri nets
- Delay-dependent partial order reduction technique for real time systems
- Using non-convex approximations for efficient analysis of timed automata
- Performance evaluation of schedulers in a probabilistic setting
- Model Checking Real-Time Systems
- Computing reachable states for nonlinear biological models
- Lazy reachability checking for timed automata using interpolants
- Adding dense-timed stack to integer reset timed automata
- An inverse method for parametric timed automata
- A partial order semantics approach to the clock explosion problem of timed automata
- Partial order reduction for checking soundness of time workflow nets
- scientific article; zbMATH DE number 7649924 (Why is no real title available?)
This page was built for publication: On Interleaving in Timed Automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5756592)