Proving nonreachability by modulo-invariants

DOI10.1016/0304-3975(95)00117-4zbMATH Open0872.68131OpenAlexW2025727968MaRDI QIDQ672866FDOQ672866

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

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

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix
• Title not available (Why is that?)
• Title not available (Why is that?)
• System modelling with high-level Petri nets
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• An Algorithm for the General Petri Net Reachability Problem
• Title not available (Why is that?)
• The Orderly Resolution of Memory Access Conflicts Among Competing Channel Processes
• Reachability in cyclic extended free-choice systems

Cited In (5)

• Title not available (Why is that?)
• 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)