Proving nonreachability by modulo-invariants
type: Item
instance of: scholarly article
title: Proving nonreachability by modulo-invariants
zbMATH Open document ID: 0872.68131
DOI: 10.1016/0304-3975(95)00117-4
author: Jörg Desel
author: Klaus-Peter Neuendorf
author: M.-D. Radola
published in: Theoretical Computer Science
publication date: 1997-02-28T00:00:00Z
Mathematics Subject Classification ID: 68Q85
zbMATH DE Number: 985234
zbMATH Keywords: nonreachable marking
zbMATH Keywords: Petri nets
zbMATH Keywords: place-invariants
MaRDI profile type: Publication
full work available at URL: 0304-3975(95)00117-4
OpenAlex ID: W2025727968
cites work: Q3967058
cites work: Q4152749
cites work: Q3214832
cites work: Reachability in cyclic extended free-choice systems
cites work: Q4198056
cites work: Q3766867
cites work: Q4001266
cites work: Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix
cites work: The Orderly Resolution of Memory Access Conflicts Among Competing Channel Processes
cites work: System modelling with high-level Petri nets
cites work: An Algorithm for the General Petri Net Reachability Problem
cites work: Q3749122
cites work: Q4692759
cites work: Q3670575
description: scientific article; zbMATH DE number 985234