Efficient Reachability Analysis for Time Petri Nets

DOI10.1109/TC.2010.195zbMath1368.68263OpenAlexW2113375901MaRDI QIDQ5280543

Hanifa Boucheneb, Rachid Hadjidj

Publication date: 27 July 2017

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tc.2010.195

Mathematics Subject Classification ID

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

Related Items (5)

Liveness enforcement for production systems modeled by time Petri nets ⋮ Least-cost transition sequence estimation in labelled time Petri net systems with unobservable transitions ⋮ State estimation in labeled time Petri net systems using observed modified state class graph ⋮ An approach for enforcing a class of GMECs on time Petri nets with uncontrollable transitions ⋮ Time based deadlock prevention for Petri nets

This page was built for publication: Efficient Reachability Analysis for Time Petri Nets