LP deadlock checking using partial order dependencies

DOI10.1007/3-540-44618-4_30MaRDI QIDQ4536617zbMATH OpenFDO

Authors Victor Khomenko, Maciej Koutny

Publication date 28 November 2002

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

Full work available at URL https://doi.org/10.1007/3-540-44618-4_30

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Verification of bounded Petri nets using integer programming
• scientific article; zbMATH DE number 1863174
• Model checking using net unfoldings
• Model checking of time Petri nets based on partial order semantics
• Deadlock detection-oriented unfolding of unbounded Petri nets

Cited in

(6)

• Deadlock detection-oriented unfolding of unbounded Petri nets
• Structure-based deadlock checking of asynchronous circuits
• Directed Unfolding of Petri Nets
• scientific article; zbMATH DE number 1337888 (Why is no real title available?)
• Model checking using net unfoldings
• Verification of bounded Petri nets using integer programming

This page was built for publication: LP deadlock checking using partial order dependencies

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