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

1992 ◽  
pp. 62-75 ◽  
Author(s):  
Kamel Barkaoui ◽  
Michel Minoux
Keyword(s):  
Petri Nets ◽  
Polynomial Time ◽  
Graph Algorithm ◽  
Time Graph

Isomorphism Testing via Polynomial-Time Graph Extensions

2010 ◽  
Vol 10 (2) ◽  
pp. 119-143 ◽  
Author(s):  
Daniel Cosmin Porumbel
Keyword(s):  
Polynomial Time ◽  
Time Graph

On polynomial time graph grammars

2006 ◽  
pp. 227-236 ◽  
Author(s):  
Franz J. Brandenburg
Keyword(s):  
Polynomial Time ◽  
Graph Grammars ◽  
Time Graph

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

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
Sign in / Sign up

Export Citation Format

Share Document