Petr Jancar

	2010
61		Stanislav Böhm, Stefan Göller, Petr Jancar: Bisimilarity of One-Counter Processes Is PSPACE-Complete. CONCUR 2010: 177-191
60		Tomás Brázdil, Petr Jancar, Antonín Kucera: Reachability Games on Extended Vector Addition Systems with States. ICALP (2) 2010: 478-489
59		Tomás Brázdil, Petr Jancar, Antonín Kucera: Reachability Games on Extended Vector Addition Systems with States CoRR abs/1002.2557: (2010)
58		Petr Jancar: Short Decidability Proof for DPDA Language Equivalence via 1st Order Grammar Bisimilarity CoRR abs/1010.4760: (2010)
57		Sibylle B. Fröschle, Petr Jancar, Slawomir Lasota, Zdenek Sawa: Non-interleaving bisimulation equivalences on Basic Parallel Processes. Inf. Comput. 208(1): 42-62 (2010)
56		Petr Jancar, Martin Kot, Zdenek Sawa: Complexity of deciding bisimilarity between normed BPA and normed BPP. Inf. Comput. 208(10): 1193-1205 (2010)
	2009
55		Zdenek Sawa, Petr Jancar: Hardness of equivalence checking for composed finite-state systems. Acta Inf. 46(3): 169-191 (2009)
	2008
54		Petr Jancar, Martin Kot, Zdenek Sawa: Normed BPA vs. Normed BPP Revisited. CONCUR 2008: 434-446
53		Petr Jancar: Selected Ideas Used for Decidability and Undecidability of Bisimilarity. Developments in Language Theory 2008: 56-71
52		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		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		Petr Jancar, Jirí Srba: Undecidability of bisimilarity by defender's forcing. J. ACM 55(1): (2008)
	2007
49		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		Javier Esparza, Petr Jancar, Alexander Miller: On the Complexity of Consistency and Complete State Coding for Signal Transition Graphs. ACSD 2006: 47-56
46		Petr Jancar, Jirí Srba: Undecidability Results for Bisimilarity on Prefix Rewrite Systems. FoSSaCS 2006: 277-291
45		Antonín Kucera, Petr Jancar: Equivalence-checking on infinite-state systems: Techniques and results. TPLP 6(3): 227-264 (2006)
	2005
44		Mark Schäfer, Walter Vogler, Petr Jancar: Determinate STG Decomposition of Marked Graphs. ICATPN 2005: 365-384
43		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): 513-528 (2005)
	2004
41		Petr Jancar, Jirí Srba: Highly Undecidable Questions for Process Algebras. IFIP TCS 2004: 507-520
40		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		Petr Jancar, Antonín Kucera, Faron Moller: Deciding Bisimilarity between BPA and BPP Processes. CONCUR 2003: 157-171
38		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		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		Antonín Kucera, Petr Jancar: Equivalence-Checking with Infinite-State Systems: Techniques and Results. SOFSEM 2002: 41-73
	2001
34		Zdenek Sawa, Petr Jancar: P-Hardness of Equivalence Testing on Finite-State Processes. SOFSEM 2001: 326-335
33		Petr Jancar: Nonprimitive recursive complexity and undecidability for Petri net equivalences. Theor. Comput. Sci. 256(1-2): 23-30 (2001)
32		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		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		Petr Jancar, Faron Moller: Techniques for Decidability and Undecidability of Bisimilarity. CONCUR 1999: 30-45
28		Catherine Dufourd, Petr Jancar, Ph. Schnoebelen: Boundedness of Reset P/T Nets. ICALP 1999: 301-310
27		Petr Jancar, Faron Moller, Zdenek Sawa: Simulation Problems for One-Counter Machines. SOFSEM 1999: 404-413
26		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		Petr Jancar, Antonín Kucera, Richard Mayr: Deciding Bisimulation-Like Equivalences with Finite-State Processes. ICALP 1998: 200-211
21		Petr Jancar, Mojmír Kretínský: Preface. Electr. Notes Theor. Comput. Sci. 18: 1-2 (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		Petr Jancar, Antonín Kucera: Bisimilarity of processes with finite-state systems. Electr. Notes Theor. Comput. Sci. 9: 41 (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		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

Coauthor Index

1	Stanislav Böhm	[61]
2	Tomás Brázdil	[59] [60]
3	Lubos Brim	[37]
4	Catherine Dufourd	[28]
5	Javier Esparza	[15] [25] [47] [52]
6	Sibylle B. Fröschle	[57]
7	Stefan Göller	[61]
8	Rodney R. Howell	[3] [5]
9	Martin Kot	[54] [56]
10	Mojmír Kretínský	[21] [37]
11	Antonín Kucera	[16] [22] [31] [32] [35] [36] [37] [39] [40] [43] [45] [59] [60]
12	Slawomir Lasota	[57]
13	Richard Mayr	[22] [32]
14	Alexander Miller	[47] [52]
15	Faron Moller	[13] [25] [27] [29] [31] [36] [39] [40]
16	Frantisek Mráz	[4] [6] [11] [12] [14] [17] [18] [20] [23] [24] [48]
17	Martin Plátek	[4] [6] [11] [12] [14] [17] [18] [20] [23] [24] [48]
18	Martin Procházka	[12] [20]
19	Louis E. Rosier	[3] [5]
20	Zdenek Sawa	[27] [34] [36] [40] [42] [49] [54] [55] [56] [57]
21	Mark Schäfer	[44]
22	Ph. Schnoebelen (Philippe Schnoebelen)	[28]
23	Jirí Srba	[41] [46] [50]
24	Jörg Vogel	[11] [12] [17] [18] [20] [23] [24] [48]
25	Walter Vogler	[44]

Colors in the list of coauthors

Last update Sat Jun 2 20:57:36 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page