Proving nonreachability by modulo-invariants

DOI10.1016/0304-3975(95)00117-4MaRDI QIDQ672866zbMATH OpenOpenAlexFDO

Authors Jörg Desel, Klaus-Peter Neuendorf, M.-D. Radola

Publication date 28 February 1997

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(95)00117-4

zbMATH Keywords

Petri netsnonreachable markingplace-invariants

Mathematics Subject Classification ID

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

Recommendations

• Modular Analysis of Petri Nets
• Reachability in cyclic extended free-choice systems
• scientific article; zbMATH DE number 2064230
• scientific article; zbMATH DE number 4037224
• Algebraic method of determining nonexistence of deadlock markings in Petri nets

Cites work

• scientific article; zbMATH DE number 3427234 (Why is no real title available?)
• scientific article; zbMATH DE number 3825182 (Why is no real title available?)
• scientific article; zbMATH DE number 3985313 (Why is no real title available?)
• scientific article; zbMATH DE number 4024806 (Why is no real title available?)
• scientific article; zbMATH DE number 3789841 (Why is no real title available?)
• scientific article; zbMATH DE number 50851 (Why is no real title available?)
• scientific article; zbMATH DE number 3582425 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 194764 (Why is no real title available?)
• An Algorithm for the General Petri Net Reachability Problem
• Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix
• Reachability in cyclic extended free-choice systems
• System modelling with high-level Petri nets
• The Orderly Resolution of Memory Access Conflicts Among Competing Channel Processes

Cited in

(5)

• scientific article; zbMATH DE number 2064230 (Why is no real title available?)
• Structural place invariants for analyzing the behavioral properties of nested Petri nets
• Flexibility in Algebraic Nets
• Algebraic nets with flexible arcs
• Petri net based verification of distributed algorithms: An example

This page was built for publication: Proving nonreachability by modulo-invariants

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