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

DOI10.1016/S0020-0190(00)00156-3zbMATH Open0996.68524MaRDI QIDQ1603403FDOQ1603403

Authors: Xuandong Li, Johan Lilius 

Publication date: 14 July 2002

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

zbMATH Keywords

ConcurrencyDuration calculusReal-time systemsModel-checking

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (3)

• On-the-fly \(TCTL\) model checking for time Petri nets
• Efficient verification of a class of time Petri nets using linear programming
• Cycle encoding-based parameter synthesis for timed automata safety

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

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