Jirí Srba

	2009
39		Joakim Byg, Kenneth Yrke Jørgensen, Jirí Srba: TAPAAL: Editor, Simulator and Verifier of Timed-Arc Petri Nets. ATVA 2009: 84-89
38		Morten Kühnrich, Stefan Schwoon, Jirí Srba, Stefan Kiefer: Interprocedural Dataflow Analysis over Weight Domains with Infinite Descending Chains. FOSSACS 2009: 440-455
37		Nikola Benes, Jan Kretínský, Kim Guldstrand Larsen, Jirí Srba: Checking Thorough Refinement on Modal Transition Systems Is EXPTIME-Complete. ICTAC 2009: 112-126
36		Luca Aceto, Anna Ingólfsdóttir, Kim Guldstrand Larsen, Jirí Srba: Teaching Concurrency: Theory in Practice. TFM 2009: 158-175
35		Morten Kühnrich, Stefan Schwoon, Jirí Srba, Stefan Kiefer: Interprocedural Dataflow Analysis over Weight Domains with Infinite Descending Chains CoRR abs/0901.0501: (2009)
34		Jirí Srba: Beyond Language Equivalence on Visibly Pushdown Automata Logical Methods in Computer Science 5(1): (2009)
33		Nikola Benes, Jan Kretínský, Kim Guldstrand Larsen, Jirí Srba: On determinism in modal transition systems. Theor. Comput. Sci. 410(41): 4026-4043 (2009)
	2008
32		Jirí Srba: Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets. FORMATS 2008: 15-32
31		Patricia Bouyer, Ulrich Fahrenberg, Kim Guldstrand Larsen, Nicolas Markey, Jirí Srba: Infinite Runs in Weighted Timed Automata with Energy Constraints. FORMATS 2008: 33-47
30		Petr Jancar, Jirí Srba: Undecidability of bisimilarity by defender's forcing. J. ACM 55(1): (2008)
	2007
29		Dirk Nowotka, Jirí Srba: Height-Deterministic Pushdown Automata. MFCS 2007: 125-134
	2006
28		Giorgio Delzanno, Javier Esparza, Jirí Srba: Monotonic Set-Extended Prefix Rewriting and Verification of Recursive Ping-Pong Protocols. ATVA 2006: 415-429
27		Jirí Srba: Visibly Pushdown Automata: From Language Equivalence to Simulation and Bisimulation. CSL 2006: 89-103
26		Petr Jancar, Jirí Srba: Undecidability Results for Bisimilarity on Prefix Rewrite Systems. FoSSaCS 2006: 277-291
25		Jirí Srba, Scott A. Smolka: Preface. Electr. Notes Theor. Comput. Sci. 149(1): 1-2 (2006)
24		Hans Hüttel, Jirí Srba: Decidability Issues for Extended Ping-Pong Protocols. J. Autom. Reasoning 36(1-2): 125-147 (2006)
	2005
23		Jirí Srba: On Counting the Number of Consistent Genotype Assignments for Pedigrees. FSTTCS 2005: 470-482
22		Jirí Srba: Timed-Arc Petri Nets vs. Networks of Timed Automata. ICATPN 2005: 385-402
21		Hans Hüttel, Jirí Srba: Recursion Versus Replication in Simple Cryptographic Protocols. SOFSEM 2005: 178-187
	2004
20		Petr Jancar, Jirí Srba: Highly Undecidable Questions for Process Algebras. IFIP TCS 2004: 507-520
19		Jirí Srba: Completeness Results for Undecidable Bisimilarity Problems. Electr. Notes Theor. Comput. Sci. 98: 5-19 (2004)
18		Faron Moller, Scott A. Smolka, Jirí Srba: On the computational complexity of bisimulation, redux. Inf. Comput. 194(2): 129-143 (2004)
	2003
17		Jirí Srba: Strong bisimilarity of simple process algebras: complexity lower bounds. Acta Inf. 39(6-7): 469-499 (2003)
16		Marcin Jurdzinski, Mogens Nielsen, Jirí Srba: Undecidability of domino games and hhp-bisimilarity. Inf. Comput. 184(2): 343-368 (2003)
15		Jirí Srba: Complexity Of Weak Bisimilarity And Regularity For Bpa And Bpp. Mathematical Structures in Computer Science 13(4): 567-587 (2003)
	2002
14		Jirí Srba: Undecidability of Weak Bisimilarity for Pushdown Processes. CONCUR 2002: 579-593
13		Jirí Srba: Undecidability of Weak Bisimilarity for PA-Processes. Developments in Language Theory 2002: 197-208
12		Jirí Srba: Note on the Tableau Technique for Commutative Transition Systems. FoSSaCS 2002: 387-401
11		Jirí Srba: Strong Bisimilarity and Regularity of Basic Process Algebra Is PSPACE-Hard. ICALP 2002: 716-727
10		Jirí Srba: Strong Bisimilarity and Regularity of Basic Parallel Processes Is PSPACE-Hard. STACS 2002: 535-546
9		Jirí Srba: Roadmap of Infinite Results. Bulletin of the EATCS 78: 163-175 (2002)
	2001
8		Jirí Srba: On the Power of Labels in Transition Systems. CONCUR 2001: 277-291
7		Mogens Nielsen, Vladimiro Sassone, Jirí Srba: Properties of Distributed Timed-Arc Petri Nets. FSTTCS 2001: 280-291
6		Mogens Nielsen, Vladimiro Sassone, Jirí Srba: Towards a Notion of Distributed Time for Petri Nets. ICATPN 2001: 23-31
5		Jirí Srba: Basic process algebra with deadlocking states. Theor. Comput. Sci. 266(1-2): 605-630 (2001)
	2000
4		Ondrej Klíma, Jirí Srba: Matching Modulo Associativity and Idempotency Is NP-Complete. MFCS 2000: 456-466
3		Jirí Srba: Complexity of Weak Bisimilarity and Regularity for BPA and BPP. Electr. Notes Theor. Comput. Sci. 39(1): (2000)
	1999
2		Ivana Cerná, Ondrej Klíma, Jirí Srba: Pattern Equations and Equations with Stuttering. SOFSEM 1999: 369-378
	1998
1		Jirí Srba: Deadlocking States in Context-Free Process Algebra. MFCS 1998: 388-398

Coauthor Index

1	Luca Aceto	[36]
2	Nikola Benes	[33] [37]
3	Patricia Bouyer	[31]
4	Joakim Byg	[39]
5	Ivana Cerná (Ivana Cerna)	[2]
6	Giorgio Delzanno	[28]
7	Javier Esparza	[28]
8	Ulrich Fahrenberg	[31]
9	Hans Hüttel	[21] [24]
10	Anna Ingólfsdóttir	[36]
11	Petr Jancar	[20] [26] [30]
12	Kenneth Yrke Jørgensen	[39]
13	Marcin Jurdzinski	[16]
14	Stefan Kiefer	[35] [38]
15	Ondrej Klíma	[2] [4]
16	Jan Kretínský	[33] [37]
17	Morten Kühnrich	[35] [38]
18	Kim Guldstrand Larsen	[31] [33] [36] [37]
19	Nicolas Markey	[31]
20	Faron Moller	[18]
21	Mogens Nielsen	[6] [7] [16]
22	Dirk Nowotka	[29]
23	Vladimiro Sassone	[6] [7]
24	Stefan Schwoon	[35] [38]
25	Scott A. Smolka	[18] [25]

Colors in the list of coauthors