A partial order semantics approach to the clock explosion problem of timed automata

DOI10.1016/j.tcs.2005.07.023zbMath1079.68052OpenAlexW2036670017MaRDI QIDQ2575733

Denis Lugiez, S. Zennou, Peter Niebert

Publication date: 6 December 2005

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2005.07.023

zbMATH Keywords

AlgorithmsVerificationTimed automataPartial order

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

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 ⋮ Regular set of representatives for time-constrained MSC graphs ⋮ A concurrency-preserving translation from time Petri nets to networks of timed automata ⋮ Distributed Timed Automata with Independently Evolving Clocks ⋮ Structural transformations for data-enriched real-time systems ⋮ Partial order reduction for checking soundness of time workflow nets

Uses Software

• Kronos

Cites Work

• Partial-order reduction techniques for real-time model checking
• A theory of timed automata
• Symbolic model checking for real-time systems
• Kronos: A verification tool for real-time systems
• Partial-order methods for the verification of concurrent systems. An approach to the state-explosion problem
• Model-checking for real-time systems
• Tools and Algorithms for the Construction and Analysis of Systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A partial order semantics approach to the clock explosion problem of timed automata