Complete Finite Prefixes of Symbolic Unfoldings of Safe Time Petri Nets

DOI10.1007/11767589_8zbMath1234.68292OpenAlexW1546958647MaRDI QIDQ3618702

Thomas Chatain, Claude Jard

Publication date: 2 April 2009

Published in: Petri Nets and Other Models of Concurrency - ICATPN 2006 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11767589_8

Mathematics Subject Classification ID

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

Related Items (5)

Delay-dependent partial order reduction technique for real time systems ⋮ An Algorithm for Direct Construction of Complete Merged Processes ⋮ Symbolic unfolding of parametric stopwatch Petri nets ⋮ Combining free choice and time in Petri nets ⋮ Realizability of Schedules by Stochastic Time Petri Nets with Blocking Semantics

This page was built for publication: Complete Finite Prefixes of Symbolic Unfoldings of Safe Time Petri Nets