A structure to decide reachability in Petri nets
type: Item
instance of: scholarly article
title: A structure to decide reachability in Petri nets
zbMATH Open document ID: 0769.68104
DOI: 10.1016/0304-3975(92)90173-D
author: J. L. Lambert
published in: Theoretical Computer Science
publication date: 1992-09-27T00:00:00Z
Mathematics Subject Classification ID: 68Q85
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 65324
zbMATH Keywords: Petri nets
zbMATH Keywords: reachability
zbMATH Keywords: precovering graph
MaRDI profile type: Publication
cites work: Q4190106
cites work: Q4198075
cites work: On the reachability problem for 5-dimensional vector addition systems
cites work: Q4190159
cites work: Parallel program schemata
cites work: Finding a partial solution to a linear system of equations in positive integers
cites work: Q4529547
cites work: Q3702518
cites work: Q4720790
cites work: Q3911403
Wikidata QID: Q127976180
Recommended article: Decidability of the Petri net reachability problem
Recommended article: Q3820016
Recommended article: On reachability graphs of Petri nets
Recommended article: Q4835904
Recommended article: Q4515247
Recommended article: Q3018198
Recommended article: Structuring acyclic Petri nets for reachability analysis and control
Recommended article: Q4823615
Recommended article: Petri net reachability graphs: decidability status of FO properties
Recommended article: A sufficient condition for reachability in a general Petri net
description: scientific article; zbMATH DE number 65324