Verifying time Petri nets by linear programming

DOI10.1007/BF02948851zbMath0974.68140OpenAlexW146353516MaRDI QIDQ5934289

Xuandong Li

Publication date: 19 June 2001

Published in: Journal of Computer Science and Technology (Search for Journal in Brave)

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

zbMATH Keywords

linear programmingtime Petri netsverification problems

Mathematics Subject Classification ID

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

Cites Work

• Minimum and maximum delay problems in real-time systems
• Recoverability of Communication Protocols--Implications of a Theoretical Study

This page was built for publication: Verifying time Petri nets by linear programming