A polynomial time algorithm to decide pairwise concurrency of transitions for 1-bounded conflict-free Petri nets
type: Item
instance of: scholarly article
title: A polynomial time algorithm to decide pairwise concurrency of transitions for 1-bounded conflict-free Petri nets
zbMATH Open document ID: 0733.68060
DOI: 10.1016/0020-0190(91)90225-7
author: Hsu-Chun Yen
published in: Information Processing Letters
publication date: 1991-01-01T00:00:00Z
review text: The paper illustrates a polynomial time algorithm for which it is shown that the open \textit{M. Tiusanen's} [Bull. EATCS 36, 152-160 (1988; Zbl 0669.68046)] of determining whether two transitions in a 1-bounded conflict-free Petri net can become enabled simultaneously, is solvable in polynomial time.
Mathematics Subject Classification ID: 68Q85
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 4213469
zbMATH Keywords: concurrency
zbMATH Keywords: conflict-free Petri net
reviewed by: T. Mikosch
MaRDI profile type: Publication
full work available at URL: 0020-0190(91)90225-7
OpenAlex ID: W1993706145
cites work: A decidability theorem for a class of vector-addition systems
cites work: Completeness results for conflict-free vector replacement systems
cites work: Q3823147
cites work: An \(O(n^{1.5})\) algorithm to decide boundedness for conflict-free vector replacement systems
cites work: Complexity of some problems in Petri nets
cites work: Properties of Conflict-Free and Persistent Petri Nets
cites work: The covering and boundedness problems for vector addition systems
cites work: Q3823149
description: scientific article; zbMATH DE number 4213469