Delay-dependent partial order reduction technique for real time systems

DOI10.1007/s11241-017-9297-0zbMath1484.68138OpenAlexW2775713557MaRDI QIDQ1645216

Hanifa Boucheneb, Kamel Barkaoui

Publication date: 28 June 2018

Published in: Real-Time Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11241-017-9297-0

zbMATH Keywords

time Petri netscontracted state-class graph methodpartial-order techniquesstate-space abstractions

Mathematics Subject Classification ID

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

Related Items (2)

Stubborn set reduction for timed reachability and safety games ⋮ Time based deadlock prevention for Petri nets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Stutter-invariant temporal properties are expressible without the next-time operator
• Partial-order methods for the verification of concurrent systems. An approach to the state-explosion problem
• The expressive power of time Petri nets
• CTL* model checking for time Petri nets
• A partial order semantics approach to the clock explosion problem of timed automata
• Partial Order Reduction for Verification of Real-Time Components
• Can Stubborn Sets Be Optimal?
• Complete Finite Prefixes of Symbolic Unfoldings of Safe Time Petri Nets
• TCTL Model Checking of Time Petri Nets
• On Multi-enabledness in Time Petri Nets
• Delay-Dependent Partial Order Reduction Technique for Time Petri Nets
• On Interleaving in Timed Automata

This page was built for publication: Delay-dependent partial order reduction technique for real time systems