Efficient algorithms for three reachability problems in safe Petri nets
type: Item
instance of: scholarly article
title: Efficient algorithms for three reachability problems in safe Petri nets
zbMATH Open document ID: 1489.68153
DOI: 10.1007/978-3-030-76983-3_17
author: Pierre Bouvier
author: Hubert Garavel
publication date: 2022-03-21T00:00:00Z
full work available at URL: Bouvier-Garavel-21-a.pdf
Mathematics Subject Classification ID: 68Q85
Mathematics Subject Classification ID: 68Q60
Mathematics Subject Classification ID: 68W05
zbMATH DE Number: 7493584
describes a project that uses: caesar.bdd
describes a project that uses: NUPN_INFO
describes a project that uses: CAESAR
MaRDI profile type: Publication
OpenAlex ID: W3170262536
cites work: Automatic Decomposition of Petri Nets into Automata Networks – A Synthetic Account
cites work: Complexity results for 1-safe nets
cites work: Free Choice Petri Nets
cites work: Nested-unit Petri nets
cites work: State space reduction for process algebra specifications
cites work: Nets, sequential components and concurrency relations
description: scientific article; zbMATH DE number 7493584