Efficient verification of a class of time Petri nets using linear programming

DOI10.1016/S0020-0190(00)00156-3zbMath0996.68524MaRDI QIDQ1603403

Johan Lilius, Xuandong Li

Publication date: 14 July 2002

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

Real-time systemsConcurrencyDuration calculusModel-checking

Mathematics Subject Classification ID

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

Related Items (2)

On-the-fly \(TCTL\) model checking for time Petri nets ⋮ Efficient verification of a class of time Petri nets using linear programming

Cites Work

• A calculus of durations
• Efficient verification of a class of time Petri nets using linear programming
• Recoverability of Communication Protocols--Implications of a Theoretical Study

This page was built for publication: Efficient verification of a class of time Petri nets using linear programming