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