The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Petr Jancar: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Javier Esparza, Petr Jancar, Alexander Miller
    On the Complexity of Consistency and Complete State Coding for Signal Transition Graphs. [Citation Graph (0, 0)][DBLP]
    ACSD, 2006, pp:47-56 [Conf]
  2. Mark Schäfer, Walter Vogler, Petr Jancar
    Determinate STG Decomposition of Marked Graphs. [Citation Graph (0, 0)][DBLP]
    ICATPN, 2005, pp:365-384 [Conf]
  3. Petr Jancar, Frantisek Mráz, Martin Plátek, Jörg Vogel
    On Restarting Automata with Rewriting. [Citation Graph (0, 0)][DBLP]
    New Trends in Formal Languages, 1997, pp:119-136 [Conf]
  4. Petr Jancar, Antonín Kucera, Faron Moller
    Deciding Bisimilarity between BPA and BPP Processes. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2003, pp:157-171 [Conf]
  5. Petr Jancar, Faron Moller
    Checking Regular Properties of Petri Nets. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1995, pp:348-362 [Conf]
  6. Petr Jancar, Faron Moller
    Techniques for Decidability and Undecidability of Bisimilarity. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1999, pp:30-45 [Conf]
  7. Petr Jancar, Frantisek Mráz, Martin Plátek, Martin Procházka, Jörg Vogel
    Restarting Automata, Marcus Grammars and Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 1995, pp:102-111 [Conf]
  8. Petr Jancar, Frantisek Mráz, Martin Plátek, Jörg Vogel
    Restarting Automata. [Citation Graph (0, 0)][DBLP]
    FCT, 1995, pp:283-292 [Conf]
  9. Petr Jancar, Antonín Kucera, Faron Moller, Zdenek Sawa
    Equivalence-Checking with One-Counter Automata: A Generic Method for Proving Lower Bounds. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2002, pp:172-186 [Conf]
  10. Petr Jancar, Jirí Srba
    Undecidability Results for Bisimilarity on Prefix Rewrite Systems. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2006, pp:277-291 [Conf]
  11. Petr Jancar, Frantisek Mráz, Martin Plátek, Jörg Vogel
    Different Types of Monotonicity for Restarting Automata. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1998, pp:343-354 [Conf]
  12. Catherine Dufourd, Petr Jancar, Ph. Schnoebelen
    Boundedness of Reset P/T Nets. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:301-310 [Conf]
  13. Petr Jancar
    Bisimulation Equivalence is Decidable for One-Counter Processes. [Citation Graph (0, 0)][DBLP]
    ICALP, 1997, pp:549-559 [Conf]
  14. Petr Jancar, Javier Esparza
    Deciding Finiteness of Petri Nets Up To Bisimulation. [Citation Graph (0, 0)][DBLP]
    ICALP, 1996, pp:478-489 [Conf]
  15. Petr Jancar, Antonín Kucera, Richard Mayr
    Deciding Bisimulation-Like Equivalences with Finite-State Processes. [Citation Graph (0, 0)][DBLP]
    ICALP, 1998, pp:200-211 [Conf]
  16. Petr Jancar, Jirí Srba
    Highly Undecidable Questions for Process Algebras. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2004, pp:507-520 [Conf]
  17. Petr Jancar
    Strong Bisimilarity on Basic Parallel Processes is PSPACE-complete. [Citation Graph (0, 0)][DBLP]
    LICS, 2003, pp:218-0 [Conf]
  18. Rodney R. Howell, Petr Jancar, Louis E. Rosier
    Single-Path Petri Nets. [Citation Graph (0, 0)][DBLP]
    MFCS, 1991, pp:202-210 [Conf]
  19. Petr Jancar, Frantisek Mráz, Martin Plátek
    Characterization of Context-Free Languages by Erasing Automata. [Citation Graph (0, 0)][DBLP]
    MFCS, 1992, pp:307-314 [Conf]
  20. Petr Jancar, Frantisek Mráz, Martin Plátek
    A Taxonomy of Forgetting Automata. [Citation Graph (0, 0)][DBLP]
    MFCS, 1993, pp:527-536 [Conf]
  21. Antonín Kucera, Petr Jancar
    Equivalence-Checking with Infinite-State Systems: Techniques and Results. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 2002, pp:41-73 [Conf]
  22. Petr Jancar, Faron Moller, Zdenek Sawa
    Simulation Problems for One-Counter Machines. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 1999, pp:404-413 [Conf]
  23. Frantisek Mráz, Martin Plátek, Petr Jancar, Jörg Vogel
    Monotonic Rewriting Automata with a Restart Operation. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 1997, pp:505-512 [Conf]
  24. Zdenek Sawa, Petr Jancar
    P-Hardness of Equivalence Testing on Finite-State Processes. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 2001, pp:326-335 [Conf]
  25. Petr Jancar
    Decidability of Waek Fairness in Petri Nets. [Citation Graph (0, 0)][DBLP]
    STACS, 1989, pp:446-457 [Conf]
  26. Petr Jancar
    Decidability Questions for Bismilarity of Petri Nets and Some Related Problems. [Citation Graph (0, 0)][DBLP]
    STACS, 1994, pp:581-592 [Conf]
  27. Petr Jancar, Antonín Kucera, Faron Moller
    Simulation and Bisimulation over One-Counter Processes. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:334-345 [Conf]
  28. Petr Jancar
    High Undecidability of Weak Bisimilarity for Petri Nets. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1995, pp:349-363 [Conf]
  29. Petr Jancar, Frantisek Mráz, Martin Plátek
    Forgetting Automata and Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1996, v:33, n:5, pp:409-420 [Journal]
  30. Zdenek Sawa, Petr Jancar
    Behavioural Equivalences on Finite-State Systems are PTIME-hard. [Citation Graph (0, 0)][DBLP]
    Computers and Artificial Intelligence, 2005, v:24, n:5, pp:- [Journal]
  31. Petr Jancar
    All action-based behavioural equivalences are undecidable for labelled Petri nets. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1995, v:56, n:, pp:- [Journal]
  32. Petr Jancar, Antonín Kucera
    Bisimilarity of processes with finite-state systems. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1997, v:9, n:, pp:- [Journal]
  33. Petr Jancar, Mojmír Kretínský
    Preface. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1998, v:18, n:, pp:- [Journal]
  34. Rodney R. Howell, Petr Jancar, Louis E. Rosier
    Completeness Results for Single-Path Petri Nets [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1993, v:106, n:2, pp:253-265 [Journal]
  35. Petr Jancar
    Decidability of Bisimilarity for One-Counter Processes. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2000, v:158, n:1, pp:1-17 [Journal]
  36. Petr Jancar, Antonín Kucera, Faron Moller, Zdenek Sawa
    DP lower bounds for equivalence-checking and model-checking of one-counter automata. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2004, v:188, n:1, pp:1-19 [Journal]
  37. Petr Jancar
    A Note on Well Quasi-Orderings for Powersets. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1999, v:72, n:5-6, pp:155-160 [Journal]
  38. Petr Jancar, Frantisek Mráz, Martin Plátek, Jörg Vogel
    On Monotonic Automata with a Restart Operation. [Citation Graph (0, 0)][DBLP]
    Journal of Automata, Languages and Combinatorics, 1999, v:4, n:4, pp:287-312 [Journal]
  39. Petr Jancar, Javier Esparza, Faron Moller
    Petri Nets and Regular Processes. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1999, v:59, n:3, pp:476-503 [Journal]
  40. Petr Jancar
    Nonprimitive recursive complexity and undecidability for Petri net equivalences. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:256, n:1-2, pp:23-30 [Journal]
  41. Petr Jancar
    Decidability of a Temporal Logic Problem for Petri Nets. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1990, v:74, n:1, pp:71-93 [Journal]
  42. Petr Jancar
    Undecidability of Bisimilarity for Petri Nets and Some Related Problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:148, n:2, pp:281-301 [Journal]
  43. Petr Jancar, Antonín Kucera, Richard Mayr
    Deciding bisimulation-like equivalences with finite-state processes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:258, n:1-2, pp:409-433 [Journal]
  44. Antonín Kucera, Petr Jancar
    Equivalence-checking on infinite-state systems: Techniques and results. [Citation Graph (0, 0)][DBLP]
    TPLP, 2006, v:6, n:3, pp:227-264 [Journal]
  45. Petr Jancar, Zdenek Sawa
    A note on emptiness for alternating finite automata with a one-letter alphabet. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2007, v:104, n:5, pp:164-167 [Journal]

  46. Normed BPA vs. Normed BPP Revisited. [Citation Graph (, )][DBLP]


  47. Bisimilarity of One-Counter Processes Is PSPACE-Complete. [Citation Graph (, )][DBLP]


  48. Selected Ideas Used for Decidability and Undecidability of Bisimilarity. [Citation Graph (, )][DBLP]


  49. Deleting Automata with a Restart Operation. [Citation Graph (, )][DBLP]


  50. Reachability Games on Extended Vector Addition Systems with States. [Citation Graph (, )][DBLP]


  51. Hardness of equivalence checking for composed finite-state systems. [Citation Graph (, )][DBLP]


  52. Equivalence-Checking on Infinite-State Systems: Techniques and Results [Citation Graph (, )][DBLP]


  53. Reachability Games on Extended Vector Addition Systems with States [Citation Graph (, )][DBLP]


Search in 0.006secs, Finished in 0.007secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002