| 2009 |
|---|
| 35 | EE | Morten Kühnrich,
Stefan Schwoon,
Jirí Srba,
Stefan Kiefer:
Interprocedural Dataflow Analysis over Weight Domains with Infinite Descending Chains.
FOSSACS 2009: 440-455 |
| 34 | EE | Morten Kühnrich,
Stefan Schwoon,
Jirí Srba,
Stefan Kiefer:
Interprocedural Dataflow Analysis over Weight Domains with Infinite Descending Chains
CoRR abs/0901.0501: (2009) |
| 33 | EE | Jirí Srba:
Beyond Language Equivalence on Visibly Pushdown Automata
CoRR abs/0901.2068: (2009) |
| 2008 |
|---|
| 32 | EE | Jirí Srba:
Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets.
FORMATS 2008: 15-32 |
| 31 | EE | 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 | EE | Petr Jancar,
Jirí Srba:
Undecidability of bisimilarity by defender's forcing.
J. ACM 55(1): (2008) |
| 2007 |
|---|
| 29 | EE | Dirk Nowotka,
Jirí Srba:
Height-Deterministic Pushdown Automata.
MFCS 2007: 125-134 |
| 2006 |
|---|
| 28 | EE | Giorgio Delzanno,
Javier Esparza,
Jirí Srba:
Monotonic Set-Extended Prefix Rewriting and Verification of Recursive Ping-Pong Protocols.
ATVA 2006: 415-429 |
| 27 | EE | Jirí Srba:
Visibly Pushdown Automata: From Language Equivalence to Simulation and Bisimulation.
CSL 2006: 89-103 |
| 26 | EE | Petr Jancar,
Jirí Srba:
Undecidability Results for Bisimilarity on Prefix Rewrite Systems.
FoSSaCS 2006: 277-291 |
| 25 | EE | Jirí Srba,
Scott A. Smolka:
Preface.
Electr. Notes Theor. Comput. Sci. 149(1): 1-2 (2006) |
| 24 | EE | Hans Hüttel,
Jirí Srba:
Decidability Issues for Extended Ping-Pong Protocols.
J. Autom. Reasoning 36(1-2): 125-147 (2006) |
| 2005 |
|---|
| 23 | EE | Jirí Srba:
On Counting the Number of Consistent Genotype Assignments for Pedigrees.
FSTTCS 2005: 470-482 |
| 22 | EE | Jirí Srba:
Timed-Arc Petri Nets vs. Networks of Timed Automata.
ICATPN 2005: 385-402 |
| 21 | EE | 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 | EE | Jirí Srba:
Completeness Results for Undecidable Bisimilarity Problems.
Electr. Notes Theor. Comput. Sci. 98: 5-19 (2004) |
| 18 | EE | Faron Moller,
Scott A. Smolka,
Jirí Srba:
On the computational complexity of bisimulation, redux.
Inf. Comput. 194(2): 129-143 (2004) |
| 2003 |
|---|
| 17 | EE | Jirí Srba:
Strong bisimilarity of simple process algebras: complexity lower bounds.
Acta Inf. 39(6-7): 469-499 (2003) |
| 16 | EE | 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 | EE | Jirí Srba:
Undecidability of Weak Bisimilarity for Pushdown Processes.
CONCUR 2002: 579-593 |
| 13 | EE | Jirí Srba:
Undecidability of Weak Bisimilarity for PA-Processes.
Developments in Language Theory 2002: 197-208 |
| 12 | EE | Jirí Srba:
Note on the Tableau Technique for Commutative Transition Systems.
FoSSaCS 2002: 387-401 |
| 11 | EE | Jirí Srba:
Strong Bisimilarity and Regularity of Basic Process Algebra Is PSPACE-Hard.
ICALP 2002: 716-727 |
| 10 | EE | 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 | EE | Jirí Srba:
On the Power of Labels in Transition Systems.
CONCUR 2001: 277-291 |
| 7 | EE | Mogens Nielsen,
Vladimiro Sassone,
Jirí Srba:
Properties of Distributed Timed-Arc Petri Nets.
FSTTCS 2001: 280-291 |
| 6 | EE | Mogens Nielsen,
Vladimiro Sassone,
Jirí Srba:
Towards a Notion of Distributed Time for Petri Nets.
ICATPN 2001: 23-31 |
| 5 | EE | Jirí Srba:
Basic process algebra with deadlocking states.
Theor. Comput. Sci. 266(1-2): 605-630 (2001) |
| 2000 |
|---|
| 4 | EE | Ondrej Klíma,
Jirí Srba:
Matching Modulo Associativity and Idempotency Is NP-Complete.
MFCS 2000: 456-466 |
| 3 | EE | Jirí Srba:
Complexity of Weak Bisimilarity and Regularity for BPA and BPP.
Electr. Notes Theor. Comput. Sci. 39(1): (2000) |
| 1999 |
|---|
| 2 | EE | Ivana Cerná,
Ondrej Klíma,
Jirí Srba:
Pattern Equations and Equations with Stuttering.
SOFSEM 1999: 369-378 |
| 1998 |
|---|
| 1 | EE | Jirí Srba:
Deadlocking States in Context-Free Process Algebra.
MFCS 1998: 388-398 |
