Polynomial-Time Many-One reductions for Petri nets

Lecture Notes in Computer Science - Foundations of Software Technology and Theoretical Computer Science ◽

10.1007/bfb0058039 ◽

1997 ◽

pp. 312-326 ◽

Cited By ~ 2

Author(s):

Catherine Dufourd ◽

Alain Finkel

Keyword(s):

Petri Nets ◽

Polynomial Time

A polynomial-time graph algorithm to decide liveness of some basic classes of bounded Petri nets

Application and Theory of Petri Nets 1992 - Lecture Notes in Computer Science ◽

10.1007/3-540-55676-1_4 ◽

1992 ◽

pp. 62-75 ◽

Cited By ~ 21

Author(s):

Kamel Barkaoui ◽

Michel Minoux

Keyword(s):

Petri Nets ◽

Polynomial Time ◽

Graph Algorithm ◽

Time Graph

A polynomial time flow for implementing free-choice Petri-nets

2012 IEEE 30th International Conference on Computer Design (ICCD) ◽

10.1109/iccd.2012.6378645 ◽

2012 ◽

Cited By ~ 2

Author(s):

Pavlos M. Mattheakis ◽

Christos P. Sotiriou ◽

Peter A. Beerel

Keyword(s):

Petri Nets ◽

Polynomial Time ◽

Free Choice ◽

Time Flow

A Polynomial-time Decomposition Algorithm for Petri Nets Based on Indexes of Transitions

Information Technology Journal ◽

10.3923/itj.2011.856.862 ◽

2011 ◽

Vol 10 (4) ◽

pp. 856-862 ◽

Cited By ~ 4

Author(s):

Qingtian Zeng

Keyword(s):

Petri Nets ◽

Polynomial Time ◽

Decomposition Algorithm ◽

Time Decomposition

A polynomial time algorithm to decide pairwise concurrency of transitions for 1-bounded conflict-free Petri nets

Information Processing Letters ◽

10.1016/0020-0190(91)90225-7 ◽

1991 ◽

Vol 38 (2) ◽

pp. 71-76 ◽

Cited By ~ 11

Author(s):

Hsu-Chun Yen

Keyword(s):

Petri Nets ◽

Polynomial Time ◽

Polynomial Time Algorithm ◽

Time Algorithm

A Polynomial-Time Algorithm to Obtain State Machine Cover of Live and Safe Petri Nets

IEEE Transactions on Systems Man and Cybernetics Systems ◽

10.1109/tsmc.2019.2894778 ◽

2020 ◽

Vol 50 (10) ◽

pp. 3592-3597 ◽

Cited By ~ 5

Author(s):

Andrei G. Karatkevich ◽

Remigiusz Wisniewski

Keyword(s):

Petri Nets ◽

Polynomial Time ◽

Polynomial Time Algorithm ◽

Time Algorithm ◽

State Machine

Fixed Parameter Tractability and Polynomial Time Results for the Synthesis of b-bounded Petri Nets

Application and Theory of Petri Nets and Concurrency - Lecture Notes in Computer Science ◽

10.1007/978-3-030-21571-2_10 ◽

2019 ◽

pp. 148-168 ◽

Cited By ~ 1

Author(s):

Ronny Tredup

Keyword(s):

Petri Nets ◽

Polynomial Time ◽

Fixed Parameter Tractability ◽

Fixed Parameter

A Restricted Reachability Problem of Petri Nets Solvable in Pseudo-Polynomial Time

Transactions of the Society of Instrument and Control Engineers ◽

10.9746/sicetr1965.29.1352 ◽

1993 ◽

Vol 29 (11) ◽

pp. 1352-1360

Author(s):

Keiko TAKAHASHI ◽

Kiyohiko NAKAMURA ◽

Atsunobu ICHIKAWA

Keyword(s):

Petri Nets ◽

Polynomial Time ◽

Reachability Problem ◽

Pseudo Polynomial Time

A class of Petri nets and a reachability problem solvable in deterministic polynomial time

10.1109/pnpm.1989.68559 ◽

2003 ◽

Author(s):

K. Nakamura ◽

A. Ichikawa

Keyword(s):

Petri Nets ◽

Polynomial Time ◽

Reachability Problem

Petri nets

AccessScience ◽

10.1036/1097-8542.yb021270 ◽

2015 ◽

Keyword(s):

Petri Nets

Modeling behavior and performance of air traffic controllers using coloured petri nets

PsycEXTRA Dataset ◽

10.1037/e557102013-034 ◽

2012 ◽

Cited By ~ 1

Author(s):

Hardy Smieszek

Keyword(s):

Petri Nets ◽

Air Traffic ◽

Coloured Petri Nets ◽

Air Traffic Controllers ◽

And Performance ◽

Modeling Behavior