State space computation and analysis of Time Petri Nets

DOI10.1017/S147106840600264XzbMath1104.68071OpenAlexW2040791800MaRDI QIDQ5476391

Guillaume Gardey, Olivier H. Roux, Olivier Roux

Publication date: 14 July 2006

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s147106840600264x

zbMATH Keywords

timed automatatime Petri netsbisimulationreachability analysiszones

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (10)

Formal verification of real-time systems with preemptive scheduling ⋮ Symbolic State Space of Stopwatch Petri Nets with Discrete-Time Semantics (Theory Paper) ⋮ A concurrency-preserving translation from time Petri nets to networks of timed automata ⋮ Relevant Timed Schedules / Clock Valuations for Constructing Time Petri Net Reachability Graphs ⋮ Symbolic unfolding of parametric stopwatch Petri nets ⋮ Backward symbolic optimal reachability in weighted timed automata ⋮ Relevant timed schedules/clock vectors for constructing time Petri net reachability graphs ⋮ Time Recursive Petri Nets ⋮ Post and pre-initialized stopwatch Petri nets: formal semantics and state space computation ⋮ The On-Line Diagnosis of Time Petri Nets

Uses Software

• Kronos
• Uppaal

This page was built for publication: State space computation and analysis of Time Petri Nets