On Interleaving in Timed Automata

DOI10.1007/11817949_31zbMATH Open1151.68457OpenAlexW1546526613MaRDI QIDQ5756592FDOQ5756592

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

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

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)

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
• Using non-convex approximations for efficient analysis of timed automata
• Delay-dependent partial order reduction technique for real time systems
• Performance evaluation of schedulers in a probabilistic setting
• Model Checking Real-Time Systems
• Lazy reachability checking for timed automata using interpolants
• Computing reachable states for nonlinear biological models
• An inverse method for parametric timed automata
• Adding dense-timed stack to integer reset 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
• Title not available (Why is that?)

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)