For the most recent entries see the
Petri Nets Newsletter.
Keyword: reachability
-
Kostin, Alexander E.:
A Reachability Algorithm for General Petri Nets Based on Transition Invariants.
2006.
-
Yen, Hsu-Chun;
Yu, Lien-Po:
Dependability Analysis of a Class of Probabilistic Petri Nets.
2004.
-
Xu, Dianxiang;
He, Xudong;
Deng, Yi:
Schedulability Analysis of Real-Time Systems Using Time Petri Nets.
2002.
-
Silva, Fabiano;
Castilho, Marcos Alexandre;
Künzle, Luis Allan:
Petriplan: A New Algorithm for Plan Generation.
2000.
-
Miyamoto, T.;
Nakano, S.;
Kumagai, S.:
An algorithm for Petri nets reachability by unfoldings.
1999.
-
Tomisaka, M.;
Yoneda, T.:
Partial order reduction in symbolic state space traversal using ZBDDs.
1999.
-
Valero Ruiz, V.;
Cuartero Gomez, F.;
de Frutos Escrig, D.:
On non-decidability of reachability for timed-arc Petri nets.
1999.
-
Matsumoto, T.;
Mayano, Y.:
Reachability criterion for Petri nets with known firing vectors.
1998.
-
Kostin, A.E.:
The Novel Algorithm for Determining the Reachability in Acyclic Petri Nets.
1997.
-
Desel, Jörg;
Esparza, Javier:
Reachability in Reversible Free Choice Systems.
1991.
-
Zhang, Lan;
Li, Ren Hou:
A GSPN-Based Petri Net Analyzer.
1991.
-
Howell, Rodney R.:
The Complexity of Problems Involving Structurally Bounded and Conservative Petri Nets.
1991.
-
Dong, Ik Lee;
Kumagai, S.;
Kodama, S.:
Reachability of LSFC Nets.
1990.
-
Dong, Ik Lee;
Kumagai, Sadatoshi;
Kodama, Shinzo:
Reachability of LSFC Nets.
1990.
-
Tsuji, Kohkichi;
Matsumoto, Tadashi:
Extended Petri Net Models for Neural Networks and Fuzzy Inference Engines --- Their Net Structural Properties.
1990.
-
Gill, J.A.:
Safety Analysis of Heterogeneous-Multiprocessor Control System Software.
1990.
-
Howell, Rodney R.;
Jancar, Petr;
Rosier, Louis E.:
Single-Path Petri Nets.
1990.
-
Desel, Jörg;
Esparza, Javier:
Reachability in Reversible Free Choice Systems.
1990.
-
Laserre, Jean B.;
Mahey, Philippe:
Using Linear Programming in Petri Net Analysis.
1989.
-
Morse, J.A.:
Performance Estimation of Distributed Computer Systems.
1988.
-
Kettunen, E.;
Lindqvist, M.:
Towards Practicality of Predicate/Transition Petri Net Reachability Analysis of SDL.
1987.
-
Laucht, C.M.:
Reachability Determination for a Non-Syntactic Subclass of Vector Replacement Systems (Petri Nets).
1982.
-
Müller, Horst:
Cover picture story: Reachability Problem.
1980.
-
Köhler, M.:
Reachable Markings of Object Petri Nets.
06.
Do you need a refined search? Try our search engine
which allows complex field-based queries.
Back to the Petri Nets Bibliography