On Interleaving in Timed Automata

DOI10.1007/11817949_31zbMath1151.68457OpenAlexW1546526613MaRDI QIDQ5756592

Ramzi Ben Salah, Oded Maler, Marius Bozga

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)

Related Items (9)

Performance Evaluation of Schedulers in a Probabilistic Setting ⋮ Model Checking Real-Time Systems ⋮ Delay-dependent partial order reduction technique for real time systems ⋮ Unnamed Item ⋮ Partial order reduction for checking soundness of time workflow nets ⋮ Computing reachable states for nonlinear biological models ⋮ Covering Steps Graphs of Time Petri Nets ⋮ An Inverse Method for Parametric Timed Automata ⋮ Efficient convex zone merging in parametric timed automata

This page was built for publication: On Interleaving in Timed Automata