Polynomial-time algorithm for the legal firing sequences problem of a type of synchronous composition Petri nets

DOI10.1007/BF02714572zbMath1125.68391MaRDI QIDQ865943

Changjun Jiang

Publication date: 20 February 2007

Published in: Science in China. Series F (Search for Journal in Brave)

zbMATH Keywords

Petri netNP-complete problemlegal firing sequencepolynomial-time complexsynchronous compositiontesting algorithm

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (1)

Petri net representation and reachability analysis of 0--1 integer linear programming problems

This page was built for publication: Polynomial-time algorithm for the legal firing sequences problem of a type of synchronous composition Petri nets