A well-structured framework for analysing Petri net extensions
type: Item
instance of: scholarly article
title: A well-structured framework for analysing Petri net extensions
zbMATH Open document ID: 1101.68696
author: Alain Finkel
author: Pierre McKenzie
author: Claudine Picaronny
published in: Information and Computation
publication date: 2005-02-22T00:00:00Z
Mathematics Subject Classification ID: 68Q85
zbMATH DE Number: 2136249
zbMATH Keywords: Transition systems
MaRDI profile type: Publication
full work available at URL: j.ic.2004.01.005
OpenAlex ID: W1987557885
cites work: Some decision problems related to the reachability problem for Petri nets
cites work: Petri nets: central models and their properties. Advances in Petri nets 1986, Part I. Proceedings of an advanced course, Bad Honnef, September 8--19, 1986
cites work: Q3619797
cites work: Q4219024
cites work: Q3771630
cites work: Reduction and covering of infinite reachability trees
cites work: Well-structured transition systems everywhere!
cites work: Ordering by Divisibility in Abstract Algebras
cites work: Q5508985
cites work: Remarks on blind and partially blind one-way multicounter machines
cites work: Q4023496
cites work: Parallel program schemata
cites work: Bounds for permanents of non-negative matrices
cites work: Q3221403
cites work: Q3911403
cites work: Classes of Recursively Enumerable Sets and Their Decision Problems
cites work: Q4405301
cites work: Q3051391
cites work: Q3933750
cites work: The residue of vector sets with applications to decidability problems in Petri nets
DOI: 10.1016/J.IC.2004.01.005
description: scientific article; zbMATH DE number 2136249