| 2013 | ||
|---|---|---|
| j17 | Abinoam P. Marques Jr., Anders P. Ravn, Jirí Srba, Saleem Vighio: Model-checking web services business activity protocols. STTT 15(2): 125-147 (2013) | |
| i2 | Petr Jancar, Jirí Srba: Note on Undecidability of Bisimilarity for Second-Order Pushdown Processes. CoRR abs/1303.0780 (2013) | |
| 2012 | ||
| j16 | Nikola Benes, Jan Kretínský, Kim G. Larsen, Jirí Srba: EXPTIME-completeness of thorough refinement on modal transition systems. Inf. Comput. 218: 54-68 (2012) | |
| j15 | Line Juhl, Kim G. Larsen, Jirí Srba: Modal transition systems with weight intervals. J. Log. Algebr. Program. 81(4): 408-421 (2012) | |
| j14 | Sebastian S. Bauer, Line Juhl, Kim G. Larsen, Axel Legay, Jirí Srba: Extending modal transition systems with structured labels. Mathematical Structures in Computer Science 22(4): 581-617 (2012) | |
| c42 | Ruzhen Dong, Johannes Faber, Zhiming Liu, Jirí Srba, Naijun Zhan, Jiaqi Zhu: Unblockable compositions of software components. CBSE 2012: 103-108 | |
| c41 | Nikola Benes, Jan Kretínský, Kim Guldstrand Larsen, Mikael H. Møller, Jirí Srba: Dual-Priced Modal Transition Systems with Time Durations. LPAR 2012: 122-137 | |
| c40 | Mathias Andersen, Heine Gatten Larsen, Jirí Srba, Mathias Grund Sørensen, Jakob Haahr Taankvist: Verification of Liveness Properties on Closed Timed-Arc Petri Nets. MEMICS 2012: 69-81 | |
| c39 | ||
| c38 | Alexandre David, Lasse Jacobsen, Morten Jacobsen, Kenneth Yrke Jørgensen, Mikael H. Møller, Jirí Srba: TAPAAL 2.0: Integrated Development Environment for Timed-Arc Petri Nets. TACAS 2012: 492-497 | |
| c37 | Sebastian S. Bauer, Line Juhl, Kim G. Larsen, Jirí Srba, Axel Legay: A Logic for Accumulated-Weight Reasoning on Multiweighted Modal Automata. TASE 2012: 77-84 | |
| c36 | Alexandre David, Lasse Jacobsen, Morten Jacobsen, Jirí Srba: A Forward Reachability Algorithm for Bounded Timed-Arc Petri Nets. SSV 2012: 125-140 | |
| c35 | Kenneth Yrke Jørgensen, Kim G. Larsen, Jirí Srba: Time-Darts: A Data Structure for Verification of Closed Timed Automata. SSV 2012: 141-155 | |
| 2011 | ||
| c34 | Nikola Benes, Jan Kretínský, Kim G. Larsen, Mikael H. Møller, Jirí Srba: Parametric Modal Transition Systems. ATVA 2011: 275-289 | |
| c33 | Uli Fahrenberg, Line Juhl, Kim G. Larsen, Jirí Srba: Energy Games in Multiweighted Automata. ICTAC 2011: 95-115 | |
| c32 | Andreas Engelbredt Dalsgaard, René Rydhof Hansen, Kenneth Yrke Jørgensen, Kim Guldstrand Larsen, Mads Chr. Olesen, Petur Olsen, Jirí Srba: opaal: A Lattice Model Checker. NASA Formal Methods 2011: 487-493 | |
| c31 | Lasse Jacobsen, Morten Jacobsen, Mikael H. Møller, Jirí Srba: Verification of Timed-Arc Petri Nets. SOFSEM 2011: 46-72 | |
| c30 | Anders P. Ravn, Jirí Srba, Saleem Vighio: Modelling and Verification of Web Services Business Activity Protocol. TACAS 2011: 357-371 | |
| 2010 | ||
| c29 | Jirí Srba: An experiment with using Google tools for project supervision at tertiary education. CompSysTech 2010: 430-435 | |
| c28 | Lasse Jacobsen, Morten Jacobsen, Mikael H. Møller, Jirí Srba: A Framework for Relating Timed Transition Systems and Preserving TCTL Model Checking. EPEW 2010: 83-98 | |
| c27 | Anders P. Ravn, Jirí Srba, Saleem Vighio: A Formal Analysis of the Web Services Atomic Transaction Protocol with UPPAAL. ISoLA (1) 2010: 579-593 | |
| 2009 | ||
| j13 | Jirí Srba: Beyond Language Equivalence on Visibly Pushdown Automata. Logical Methods in Computer Science 5(1) (2009) | |
| j12 | Nikola Benes, Jan Kretínský, Kim Guldstrand Larsen, Jirí Srba: On determinism in modal transition systems. Theor. Comput. Sci. 410(41): 4026-4043 (2009) | |
| c26 | Joakim Byg, Kenneth Yrke Jørgensen, Jirí Srba: TAPAAL: Editor, Simulator and Verifier of Timed-Arc Petri Nets. ATVA 2009: 84-89 | |
| c25 | Morten Kühnrich, Stefan Schwoon, Jirí Srba, Stefan Kiefer: Interprocedural Dataflow Analysis over Weight Domains with Infinite Descending Chains. FOSSACS 2009: 440-455 | |
| c24 | Joakim Byg, Kenneth Yrke Jørgensen, Jirí Srba: An Efficient Translation of Timed-Arc Petri Nets to Networks of Timed Automata. ICFEM 2009: 698-716 | |
| c23 | Nikola Benes, Jan Kretínský, Kim Guldstrand Larsen, Jirí Srba: Checking Thorough Refinement on Modal Transition Systems Is EXPTIME-Complete. ICTAC 2009: 112-126 | |
| c22 | Luca Aceto, Anna Ingólfsdóttir, Kim Guldstrand Larsen, Jirí Srba: Teaching Concurrency: Theory in Practice. TFM 2009: 158-175 | |
| i1 | Morten Kühnrich, Stefan Schwoon, Jirí Srba, Stefan Kiefer: Interprocedural Dataflow Analysis over Weight Domains with Infinite Descending Chains. CoRR abs/0901.0501 (2009) | |
| 2008 | ||
| j11 | ||
| c21 | Jirí Srba: Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets. FORMATS 2008: 15-32 | |
| c20 | Patricia Bouyer, Ulrich Fahrenberg, Kim Guldstrand Larsen, Nicolas Markey, Jirí Srba: Infinite Runs in Weighted Timed Automata with Energy Constraints. FORMATS 2008: 33-47 | |
| 2007 | ||
| c19 | ||
| 2006 | ||
| j10 | ||
| j9 | Hans Hüttel, Jirí Srba: Decidability Issues for Extended Ping-Pong Protocols. J. Autom. Reasoning 36(1-2): 125-147 (2006) | |
| c18 | Giorgio Delzanno, Javier Esparza, Jirí Srba: Monotonic Set-Extended Prefix Rewriting and Verification of Recursive Ping-Pong Protocols. ATVA 2006: 415-429 | |
| c17 | Jirí Srba: Visibly Pushdown Automata: From Language Equivalence to Simulation and Bisimulation. CSL 2006: 89-103 | |
| c16 | Petr Jancar, Jirí Srba: Undecidability Results for Bisimilarity on Prefix Rewrite Systems. FoSSaCS 2006: 277-291 | |
| 2005 | ||
| c15 | ||
| c14 | Jirí Srba: On Counting the Number of Consistent Genotype Assignments for Pedigrees. FSTTCS 2005: 470-482 | |
| c13 | Hans Hüttel, Jirí Srba: Recursion Versus Replication in Simple Cryptographic Protocols. SOFSEM 2005: 178-187 | |
| 2004 | ||
| j8 | Jirí Srba: Completeness Results for Undecidable Bisimilarity Problems. Electr. Notes Theor. Comput. Sci. 98: 5-19 (2004) | |
| j7 | Faron Moller, Scott A. Smolka, Jirí Srba: On the computational complexity of bisimulation, redux. Inf. Comput. 194(2): 129-143 (2004) | |
| c12 | ||
| 2003 | ||
| j6 | Jirí Srba: Strong bisimilarity of simple process algebras: complexity lower bounds. Acta Inf. 39(6-7): 469-499 (2003) | |
| j5 | Marcin Jurdzinski, Mogens Nielsen, Jirí Srba: Undecidability of domino games and hhp-bisimilarity. Inf. Comput. 184(2): 343-368 (2003) | |
| j4 | Jirí Srba: Complexity Of Weak Bisimilarity And Regularity For Bpa And Bpp. Mathematical Structures in Computer Science 13(4): 567-587 (2003) | |
| 2002 | ||
| j3 | ||
| c11 | ||
| c10 | Jirí Srba: Undecidability of Weak Bisimilarity for PA-Processes. Developments in Language Theory 2002: 197-208 | |
| c9 | ||
| c8 | Jirí Srba: Strong Bisimilarity and Regularity of Basic Process Algebra Is PSPACE-Hard. ICALP 2002: 716-727 | |
| c7 | Jirí Srba: Strong Bisimilarity and Regularity of Basic Parallel Processes Is PSPACE-Hard. STACS 2002: 535-546 | |
| 2001 | ||
| j2 | Jirí Srba: Basic process algebra with deadlocking states. Theor. Comput. Sci. 266(1-2): 605-630 (2001) | |
| c6 | Mogens Nielsen, Vladimiro Sassone, Jirí Srba: Towards a Notion of Distributed Time for Petri Nets. ICATPN 2001: 23-31 | |
| c5 | ||
| c4 | Mogens Nielsen, Vladimiro Sassone, Jirí Srba: Properties of Distributed Timed-Arc Petri Nets. FSTTCS 2001: 280-291 | |
| 2000 | ||
| j1 | Jirí Srba: Complexity of Weak Bisimilarity and Regularity for BPA and BPP. Electr. Notes Theor. Comput. Sci. 39(1): 79-93 (2000) | |
| c3 | Ondrej Klíma, Jirí Srba: Matching Modulo Associativity and Idempotency Is NP-Complete. MFCS 2000: 456-466 | |
| 1999 | ||
| c2 | Ivana Cerná, Ondrej Klíma, Jirí Srba: Pattern Equations and Equations with Stuttering. SOFSEM 1999: 369-378 | |
| 1998 | ||
| c1 | ||
Colors in the list of coauthors
Last update Wed May 22 04:20:14 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page