Equality of languages coincides with isomorphism of reachable state graphs for bounded and persistent Petri nets
type: Item
instance of: scholarly article
title: Equality of languages coincides with isomorphism of reachable state graphs for bounded and persistent Petri nets
zbMATH Open document ID: 1182.68138
published in: Information Processing Letters
publication date: 2009-12-04T00:00:00Z
Mathematics Subject Classification ID: 68Q85
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 5642347
zbMATH Keywords: Petri net
zbMATH Keywords: bounded
zbMATH Keywords: persistent
zbMATH Keywords: concurrency
zbMATH Keywords: minimal automaton
author: Philippe Darondeau
MaRDI profile type: Publication
full work available at URL: j.ipl.2005.03.002
OpenAlex ID: W2070402943
cites work: Properties of Conflict-Free and Persistent Petri Nets
cites work: The decidability of persistence for vector addition systems
cites work: Persistence of vector replacement systems is decidable
cites work: Q4202931
cites work: Polynomial algorithms for the synthesis of bounded nets
cites work: Concurrent transition systems
DOI: 10.1016/J.IPL.2005.03.002
description: scientific article; zbMATH DE number 5642347