On Interleaving in Timed Automata

DOI10.1007/11817949_31MaRDI QIDQ5756592zbMATH OpenOpenAlexFDO

Authors Ramzi Ben Salah, Marius Bozga, Oded Maler

Publication date 4 September 2007

Published in CONCUR 2006 – Concurrency Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11817949_31

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

• Tools and Algorithms for the Construction and Analysis of Systems
• A partial order semantics approach to the clock explosion problem of timed automata
• Better abstractions for timed automata
• An introduction to timed automata
• Better abstractions for timed automata

Cited in

(14)

• Delay-dependent partial order reduction technique for real time systems
• Lazy reachability checking for timed automata using interpolants
• Adding dense-timed stack to integer reset timed automata
• Efficient convex zone merging in parametric timed automata
• A partial order semantics approach to the clock explosion problem of timed automata
• Using non-convex approximations for efficient analysis of timed automata
• Performance evaluation of schedulers in a probabilistic setting
• Model Checking Real-Time Systems
• An inverse method for parametric timed automata
• Partial order reduction for checking soundness of time workflow nets
• Covering steps graphs of time Petri nets
• Tools and Algorithms for the Construction and Analysis of Systems
• Computing reachable states for nonlinear biological models
• Revisiting local time semantics for networks of timed automata

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)