Jancar, P.

• Schäfer, Mark; Vogler, Walter; Jancar, Petr:
  Determinate STG Decomposition of Marked Graphs. 2005.

• Jancar, Petr:
  Strong Bisimilarity on Basic Parallel Processes is PSPACE-complete. 2003.

• Jancar, Petr:
  Nonprimitive recursive complexity and undecidability for Petri net equivalences. 2001.

• Jancar, Petr:
  Bouzinae's algorithm for the Petri net reachability problem is incorrect. 2000.

• Dufourd, C.; Jancar, P.; Schnoebelen, P.:
  Boundedness of reset P/T nets. 1999.

• Jancar, Petr; Esparza, Javier:
  Deciding Finiteness of Petri Nets Up To Bisimulation. 1996.

• Jancar, Petr:
  High Undecidability of Weak Bisimilarity for Petri Nets. 1995.

• Jancar, P.:
  Undecidability of bisimilarity for Petri nets and some related problems. 1995.

• Jancar, Petr:
  A concise proof of Commoners's theorem. 1995.

• Jancar, Petr:
  Decidability Questions for Bismilarity of Petri Nets and Some Related Problems. 1994.

• Howell, Rodney R.; Jancar, Petr; Rosier, Louis E.:
  Completeness Results for Single-Path Petri Nets. 1993.

• Howell, Rodney R.; Jancar, Petr; Rosier, Louis E.:
  Single-Path Petri Nets. 1990.

• Jancar, Petr:
  Decidability of a Temporal Logic Problem for Petri Nets. 1990.

• Jancar, Petr:
  Decidability of Weak Fairness in Petri Nets. 1989.

• Jancar, Petr:
  Decidability Questions for Some Dynamic Properties of Petri Nets. (Abstract of Thesis). 1989.

Back to the Petri Nets Bibliography