Delay-Dependent Partial Order Reduction Technique for Time Petri Nets

DOI10.1007/978-3-319-10512-3_5MaRDI QIDQ5500554zbMATH OpenOpenAlexFDO

Authors H. Boucheneb, Kamel Barkaoui, Karim Weslati

Publication date 6 August 2015

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-10512-3_5

Mathematics Subject Classification ID

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

Recommendations

• Publication:4934360
• Delay-dependent partial order reduction technique for real time systems
• The use of partial-order technique for verification of time Petri nets
• scientific article; zbMATH DE number 1361136
• Reduction rules for time Petri nets
• scientific article; zbMATH DE number 1755150
• COMPLEXITY REDUCTION FOR OPTIMIZATION OF DETERMINISTIC TIMED PETRI-NET SCHEDULING BY TRUNCATION
• Partial order reduction for checking soundness of time workflow nets

Cited in

(2)

• Start pruning when time gets urgent: partial order reduction for timed systems
• Delay-dependent partial order reduction technique for real time systems

This page was built for publication: Delay-Dependent Partial Order Reduction Technique for Time Petri Nets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5500554)