Výpis publikací

ENEVOLDSEN, Soeren; Kim G. LARSEN a Jiří SRBA. Abstract Dependency Graphs and Their Application to Model Checking. In Proceedings of the 25th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'19). The Netherlands: Springer, 2019, s. 316-333. ISBN 978-3-030-17461-3. Dostupné z: https://doi.org/10.1007/978-3-030-17462-0_18.

JENSEN, Lasse S.; Isabella KAUFMANN; Kim G. LARSEN; Soeren M. NIELSEN a Jiří SRBA. Model Checking and Synthesis for Branching Multi-Weighted Logics. Journal of Logical and Algebraic Methods in Programming. 2019, roč. 105, June 2019, s. 28-46. ISSN 2352-2208. Dostupné z: https://doi.org/10.1016/j.jlamp.2019.02.001.

ENEVOLDSEN, Soeren; Kim G. LARSEN a Jiří SRBA. Model Verification Through Dependency Graphs. In Proceedings of the 26th International SPIN Symposium on Model Checking of Software (SPIN'19). The Nederlands: Springer, 2019, s. 1-19. ISBN 978-3-030-30922-0. Dostupné z: https://doi.org/10.1007/978-3-030-30923-7_1.

BOENNELAND, Frederik M.; Peter G. JENSEN; Kim G. LARSEN; Marco MUNIZ a Jiří SRBA. Partial Order Reduction for Reachability Games. Online. In Proceedings of the 30th International Conference on Concurrency Theory (CONCUR'19). Gernmany: Dagstuhl Publishing, 2019, s. 1-15. ISBN 978-3-95977-121-4. Dostupné z: https://doi.org/10.4230/LIPIcs.CONCUR.2019.23.

KARRA, Shyam Lal; Kim G. LARSEN; Florian LORBER a Jiří SRBA. Safe and Time-Optimal Control for Railway Games. In RSSRail 2019: Reliability, Safety, and Security of Railway Systems. Modelling, Analysis, Verification, and Certification. The Netherlands: Springer, 2019, s. 106-122. ISBN 978-3-030-18743-9. Dostupné z: https://doi.org/10.1007/978-3-030-18744-6_7.

BOENNELAND, Frederik M.; Jacob DYHR; Peter G. JENSEN; Mads JOHANNSEN a Jiří SRBA. Stubborn Versus Structural Reductions for Petri Nets. Journal of Logical and Algebraic Methods in Programming. 2019, roč. 102, January 2019, s. 46-63. ISSN 2352-2208. Dostupné z: https://doi.org/10.1016/j.jlamp.2018.09.002.

DALSGAARD, Andreas E.; Søren ENEVOLDSEN; Peter FOGH; Lasse S. JENSEN; Peter G. JENSEN; Tobias S. JEPSEN; Isabella KAUFMANN; Kim G. LARSEN; Søren M. NIELSEN; Mads Chr. OLESEN; Samuel PASTVA a Jiří SRBA. A Distributed Fixed-Point Algorithm for Extended Dependency Graphs. Fundamenta Informaticae. 2018, roč. 161, č. 4, s. 351-381. ISSN 0169-2968. Dostupné z: https://doi.org/10.3233/FI-2018-1707.

IVANOV, Dmitry; Kim G. LARSEN; Sibylle SCHUPP a Jiří SRBA. Analytical Solution for Long Battery Lifetime Prediction in Nonadaptive Systems. In Proceedings of the 15th International Conference on Quantitative Evaluation of SysTems (QEST'18). Netherlands: Springer, 2018, s. 173-189. ISBN 978-3-319-99153-5. Dostupné z: https://doi.org/10.1007/978-3-319-99154-2_11.

JENSEN, Peter G.; Kim G. LARSEN a Jiří SRBA. Discrete and Continuous Strategies for Timed-Arc Petri Net Games. International Journal on Software Tools for Technology Transfer (STTT). Springer, 2018, roč. 20, č. 5, s. 529-546. ISSN 1433-2779. Dostupné z: https://doi.org/10.1007/s10009-017-0473-2.

KORDON, F.; H. GARAVEL; L.-M. HILLAH; E. PAVIOT-ADET; L. JEZEQUEL; F. HULIN-HUBARD; E.G. AMPARORE; M. BECCUTI; B. BERTOMIEU; H. EVRARD; P. JENSEN; D. LE BOTLAN; T. LIEBKE; J. MEIJER; Jiří SRBA; Y. THIERRY-MIEG; J. van de POL a K. WOLF. MCC'2017 - The Seventh Model Checking Contest. In Transactions on Petri Nets and Other Models of Concurrency XIII. Berlin, Heidelberg: Springer, 2018, s. 181-209. ISBN 978-3-662-58380-7. Dostupné z: https://doi.org/10.1007/978-3-662-58381-4_9.

SCHMID, Stefan a Jiří SRBA. Polynomial-Time What-If Analysis for Prefix-Manipulating MPLS Networks. Online. In IEEE International Conference on Computer Communications (INFOCOM'18). USA: IEEE, 2018, s. 1799-1807. ISBN 978-1-5386-4128-6. Dostupné z: https://doi.org/10.1109/INFOCOM.2018.8486261.

JENSEN, Jesper S.; Troels B. KROEGH; Jonas S. MADSEN; Stefan SCHMID; Jiří SRBA a Marc T. THORGERSEN. P-Rex: Fast Verification of MPLS Networks with Multiple Link Failures. In Proceedings of the 14th International Conference on emerging Networking EXperiments and Technologies (CoNEXT'18). USA: ACM, 2018, s. 217-227. ISBN 978-1-4503-6080-7. Dostupné z: https://doi.org/10.1145/3281411.3281432.

BOENNELAND, F.M.; J. DYHR; P.G. JENSEN; M. JOHANNSEN a Jiří SRBA. Simplification of CTL Formulae for Efficient Model Checking of Petri Nets. In Proceedings of the 39th International Conference on Application and Theory of Petri Nets and Concurrency (Petri Nets'18). Holland: Springer-Verlag, 2018, s. 143-163. ISBN 978-3-319-91267-7. Dostupné z: https://doi.org/10.1007/978-3-319-91268-4_8.

BOENNELAND, Frederik M.; Peter G. JENSEN; Kim G. LARSEN; Marco MUNIZ a Jiří SRBA. Start Pruning When Time Gets Urgent: Partial Order Reduction for Timed Systems. In Proceedings of the 30th International Conference on Computer Aided Verification (CAV'18). Netherlands: Springer, 2018, s. 527-546. ISBN 978-3-319-96144-6. Dostupné z: https://doi.org/10.1007/978-3-319-96145-3_28.

DALSGAARD, Andreas E.; Søren ENEVOLDSEN; Peter FOGH; Lasse S. JENSEN; Tobias S. JEPSEN; Isabella KAUFMANN; Kim G. LARSEN; Søren M. NIELSEN; Mads Chr. OLESEN; Samuel PASTVA a Jiří SRBA. Extended Dependency Graphs and Efficient Distributed Fixed-Point Computation. In van der Aalst, Wil and Best, Eike. Petri Nets 2017. Holandsko: Springer International Publishing, 2017, s. 139-158. ISBN 978-3-319-57860-6. Dostupné z: https://doi.org/10.1007/978-3-319-57861-3_10.

JENSEN, Peter G.; Kim G. LARSEN a Jiří SRBA. PTrie: Data Structure for Compressing and Storing Sets via Prefix Sharing. In Proceedings of the 14th International Colloquium on Theoretical Aspects of Computing (ICTAC'17). Holland: Springer, 2017, s. 248-265. ISBN 978-3-319-67728-6. Dostupné z: https://doi.org/10.1007/978-3-319-67729-3_15.

DALSGAARD, Andreas E.; Soeren ENEVOLDSEN; Kim G. LARSEN a Jiří SRBA. Distributed Computation of Fixed Points on Dependency Graphs. In Proceedings of Symposium on Dependable Software Engineering: Theories, Tools and Applications (SETTA'16). Netherlands: Springer, 2016, s. 197-212. ISBN 978-3-319-47676-6. Dostupné z: https://doi.org/10.1007/978-3-319-47677-3_13.

JENSEN, Jonnas F.; Kim G. LARSEN; Jiří SRBA a Lars OESTERGAARD. Efficient Model Checking of Weighted CTL with Upper-Bound Constraints. International Journal on Software Tools for Technology Transfer (STTT). Springer-Verlag GmbH, 2016, roč. 18, č. 4, s. 409-426. ISSN 1433-2779. Dostupné z: https://doi.org/10.1007/s10009-014-0359-5.

LARSEN, Kim G.; Marius MIKUCIONIS; Marco MUNIZ; Jiří SRBA a Jakob H. TAANKVIST. Online and Compositional Learning of Controllers with Application to Floor Heating. In Proceedings of the 22nd International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'16). Nizozemsko: Springer, 2016, s. 244-259. ISBN 978-3-662-49673-2. Dostupné z: https://doi.org/10.1007/978-3-662-49674-9_14.

JENSEN, Peter G.; Kim G. LARSEN a Jiří SRBA. Real-Time Strategy Synthesis for Timed-Arc Petri Net Games via Discretization. In Proceedings of the 23rd International SPIN Symposium on Model Checking of Software (SPIN'16). Netherlands: Springer, 2016, s. 129-146. ISBN 978-3-319-32581-1. Dostupné z: https://doi.org/10.1007/978-3-319-32582-8_9.

JENSEN, Jonas F.; Thomas NIELSEN; Jiří SRBA a Lars K. OESTERGAARD. TAPAAL and Reachability Analysis of P/T Nets. In TRANSACTIONS ON PETRI NETS AND OTHER MODELS OF CONCURRENCY XI. Berlin: Springer, 2016, s. 307-318. ISBN 978-3-662-53400-7. Dostupné z: https://doi.org/10.1007/978-3-662-53401-4_16.

AGESEN, Mads K.; Kim G. LARSEN; Marius MIKUCIONIS; Marco MUNIZ; Petur OLSEN; Thomas PEDERSEN; Jiří SRBA a Arne SKOU. Toolchain for User-Centered Intelligent Floor Heating Control. Online. In Proceedings of the 42nd Annual Conference of the IEEE Industrial Electronics Society (IECON'16). Itally: IEEE, 2016, s. 5296-5301. ISBN 978-1-5090-3474-1. Dostupné z: https://doi.org/10.1109/IECON.2016.7794040.

ANDERSEN, Jesper R.; Nicklas ANDERSEN; Soeren ENEVOLDSEN; Mathias M. HANSEN; Kim G. LARSEN; Simon R. OLESEN; Jiří SRBA a Jacob K. WORTMANN. CAAL: Concurrency Workbench, Aalborg Edition. In Proceedings of the 12th International Colloquium on Theoretical Aspects of Computing (ICTAC'15). Netherlands: Springer, 2015, s. 573-582. ISBN 978-3-319-25149-3. Dostupné z: https://doi.org/10.1007/978-3-319-25150-9_33.

BENEŠ, Nikola; Peter BEZDĚK; Kim G. LARSEN a Jiří SRBA. Language Emptiness of Continuous-Time Parametric Timed Automata. In Magnús M. Halldórsson, Kazuo Iwama, Naoki Kobayashi, Bettina Speckmann. Automata, Languages, and Programming. Neuveden: Springer Berlin Heidelberg, 2015, s. 69-81. ISBN 978-3-662-47665-9. Dostupné z: https://doi.org/10.1007/978-3-662-47666-6_6.

KŘETÍNSKÝ, Jan; Kim Guldstrand LARSEN; Simon LAURSEN a Jiří SRBA. Polynomial Time Decidability of Weighted Synchronization under Partial Observability. Online. In 26th International Conference on Concurrency Theory (CONCUR 2015). Dagstuhl, Germany: Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2015, s. 142-154. ISBN 978-3-939897-91-0. Dostupné z: https://doi.org/10.4230/LIPIcs.CONCUR.2015.142.

BENEŠ, Nikola; Jan KŘETÍNSKÝ; Kim G. LARSEN; Mikael H. MOLLER; Salomon SICKERT a Jiří SRBA. Refinement checking on parametric modal transition systems. Acta Informatica. Springer, 2015, roč. 52, 2-3, s. 269-297. ISSN 0001-5903. Dostupné z: https://doi.org/10.1007/s00236-015-0215-4.

MATEO, Jose Antonio; Jiří SRBA a Mathias Grund SOERENSEN. Soundness of Timed-Arc Workflow Nets in Discrete and Continuous-Time Semantics. Fundamenta Informaticae. Państwowe Wydawnictwo Naukowe, 2015, roč. 140, č. 1, s. 89-121. ISSN 0169-2968. Dostupné z: https://doi.org/10.3233/FI-2015-1246.

BIRCH, Sine V.; Thomas S. JACOBSEN; Jacob J. JENSEN; Christoffer MOESGAARD; Niels N. SAMUELSEN a Jiří SRBA. Interval Abstraction Refinement for Model Checking of Timed-Arc Petri Nets. In Proceedings of the 12th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS'14). Nizozemsko: Springer-Verlag, 2014, s. 237-251. ISBN 978-3-319-10511-6. Dostupné z: https://doi.org/10.1007/978-3-319-10512-3_17.

JENSEN, Peter G.; Kim G. LARSEN; Jiří SRBA; Mathias SOERENSEN a Jakob TAANKVIST. Memory Efficient Data Structures for Explicit Verification of Timed Systems. In Proceedings of the 6th NASA Formal Methods Symposium (NFM'14). Nizozemsko: Springer-Verlag, 2014, s. 307-312. ISBN 978-3-319-06199-3. Dostupné z: https://doi.org/10.1007/978-3-319-06200-6_26.

MATEO, Jose A.; Jiří SRBA a Mathias SOERENSEN. Soundness of Timed-Arc Workflow Nets. In Proceedings of the 35th International Conference on Application and Theory of {P}etri Nets and Concurrency ({ICATPN}'14). Nizozemsko: Springer-Verlag, 2014, s. 51-70. ISBN 978-3-319-07733-8. Dostupné z: https://doi.org/10.1007/978-3-319-07734-5_4.

LARSEN, Kim G.; Simon LAURSEN a Jiří SRBA. Synchronizing Strategies under Partial Observability. In Proceedings of the 25th International Conference on Concurrency Theory (CONCUR'14). Nizozemsko: Springer-Verlag, 2014, s. 188-202. ISBN 978-3-662-44583-9. Dostupné z: https://doi.org/10.1007/978-3-662-44584-6_14.

BYG, Joakim; Morten JACOBSEN; Lasse JACOBSEN; Kenneth Yrke JORGENSEN; Mikael H. MOLLER a Jiří SRBA. TCTL-Preserving Translations from Timed-Arc {P}etri Nets to Networks of Timed Automata. Theoretical Computer Science. Amsterdam: Elsevier, 2014, roč. 537, č. 5, s. 3-28. ISSN 0304-3975. Dostupné z: https://doi.org/10.1016/j.tcs.2013.07.011.

LARSEN, Kim G.; Simon LAURSEN a Jiří SRBA. Action Investment Energy Games. In Kucera, A.; Henzinger, Th.A.; Nesetril, J.; Vojnar, T.; Antos, D. Proceedings of Mathematical and Engineering Methods in Computer Science (MEMICS'12). Netherlands: Springer, 2013, s. 155-167. ISBN 978-3-642-36044-2. Dostupné z: https://doi.org/10.1007/978-3-642-36046-6_15.

JENSEN, Jonas F.; Kim G. LARSEN; Jiří SRBA a Lars K. OESTERGAARD. Local Model Checking of Weighted CTL with Upper-Bound Constraints. In Ezio Bartocci and C. R. Ramakrishnan. Proceedings of International SPIN Symposium on Model Checking of Software (SPIN'13). Netherlands: Springer, 2013, s. 178-195. ISBN 978-3-642-39175-0. Dostupné z: https://doi.org/10.1007/978-3-642-39176-7_12.

ANDERSEN, Mathias; Heine G. LARSEN; Jiří SRBA; Mathias G. SOERENSEN a Jakob H. TAANKVIST. Verification of Liveness Properties on Closed Timed-Arc Petri Nets. In Kucera, A.; Henzinger, Th.A.; Nesetril, J.; Vojnar, T.; Antos, D. Proceedings of Mathematical and Engineering Methods in Computer Science (MEMICS'12). Netherlands: Springer, 2013, s. 69-81. ISBN 978-3-642-36044-2. Dostupné z: https://doi.org/10.1007/978-3-642-36046-6_8.

BERTOLINI, Cristiano; Zhiming LIU a Jiří SRBA. Verification of Timed Healthcare Workflows Using Component Timed-Arc Petri Nets. In Proceedings of the 2nd International Symposium on the Foundations of Health Information Engineering and Systems (FHIES'12). Netherlands: Springer, 2013, s. 19-36. ISBN 978-3-642-39087-6. Dostupné z: https://doi.org/10.1007/978-3-642-39088-3_2.

DAVID, Alexandre; Lasse JACOBSEN; Morten JACOBSEN a Jiří SRBA. A Forward Reachability Algorithm for Bounded Timed-Arc Petri Nets. Electronic Proceedings of Theoretical Computer Science. Nizozemi: Open Publishing Association, 2012, roč. 102, č. 1, s. 125-140. ISSN 2075-2180. Dostupné z: https://doi.org/10.4204/EPTCS.102.12.

BAUER, Sebastian S.; Line JUHL; Kim G. LARSEN; Axel LEGAY a Jiří SRBA. A Logic for Accumulated-Weight Reasoning on Multiweighted Modal Automata. In Proceedings of the 6th International Symposium on Theoretical Aspects of Software Engineering (TASE'12). USA: IEEE Computer Society Press, 2012, s. 77-84. ISBN 978-1-4673-2353-6. Dostupné z: https://doi.org/10.1109/TASE.2012.9.

BENEŠ, Nikola; Jan KŘETÍNSKÝ; Kim G. LARSEN; Mikael H. MOLLER a Jiří SRBA. Dual-Priced Modal Transition Systems with Time Durations. In LPAR-18 - Logic for Programming, Artificial Intelligence, and Reasoning: 18th International Conference. Heidelberg Dordrecht London New York: Springer, 2012, s. 122-137. ISBN 978-3-642-28716-9. Dostupné z: https://doi.org/10.1007/978-3-642-28717-6_12.

BENEŠ, Nikola; Jan KŘETÍNSKÝ; Kim G. LARSEN a Jiří SRBA. EXPTIME-Completeness of Thorough Refinement on Modal Transition Systems. Information and Computation. Elsevier, 2012, roč. 218, September, s. 54-68. ISSN 0890-5401. Dostupné z: https://doi.org/10.1016/j.ic.2012.08.001.

BAUER, Sebastian S.; Line JUHL; Kim G. LARSEN; Axel LEGAY a Jiří SRBA. Extending Modal Transition Systems with Structured Labels. Mathematical Structures in Computer Science. 2012, roč. 22, č. 4, s. 581-617. ISSN 0960-1295. Dostupné z: https://doi.org/10.1017/S0960129511000697.

JUHL, Line; Kim G. LARSEN a Jiří SRBA. Modal Transition Systems with Weight Intervals. Journal of Logic and Algebraic Programming. 2012, roč. 81, č. 4, s. 408-421. ISSN 1567-8326. Dostupné z: https://doi.org/10.1016/j.jlap.2012.03.008.

JUHL, Line; Kim G. LARSEN a Jiří SRBA. Modal Transition Systems with Weight Intervals. Journal of Logic and Algebraic Programming. Elsevier, 2012, roč. 81, č. 4, s. 408-421. ISSN 1567-8326. Dostupné z: https://doi.org/10.1016/j.jlap.2012.03.008.

MARQUES, Abinoam P.; Andres P. RAVN; Jiří SRBA a Saleem VIGHIO. Model-Checking Web Services Business Activity Protocols. International Journal on Software Tools for Technology Transfer (STTT). 2012, roč. 2012, č. 1, s. 1-23. ISSN 1433-2779. Dostupné z: https://doi.org/10.1007/s10009-012-0231-4.

DAVID, Alexandre; Lasse JACOBSEN; Morten JACOBSEN; Kenneth Y. JOERGENSEN; Mikael H. MOELLER a Jiří SRBA. TAPAAL 2.0: Integrated Development Environment for Timed-Arc Petri Nets. In Proceedings of the 18th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'12). Netherlands: Springer, 2012, s. 492-497. ISBN 978-3-642-28755-8. Dostupné z: https://doi.org/10.1007/978-3-642-28756-5_36.

JOERGENSEN, Kenneth Yrke; Kim G. LARSEN a Jiří SRBA. Time-Darts: A Data Structure for Verification of Closed Timed Automata. Electronic Proceedings of Theoretical Computer Science. Nizozemi: Open Publishing Association, 2012, roč. 102, č. 1, s. 141-155. ISSN 2075-2180. Dostupné z: https://doi.org/10.4204/EPTCS.102.13.

DONG, Ruzhen; Johannes FABER; Zhiming LIU; Jiří SRBA; Naijun ZHAN a Jiaqi ZHU. Unblockable Compositions of Software Components. In Proceedings of the 15th International ACM SIGSOFT Symposium on Component Based Software Engineering (CBSE'12). USA: ACM, 2012, s. 103-108. ISBN 978-1-4503-1345-2. Dostupné z: https://doi.org/10.1145/2304736.2304754.

FAHRENBERG, Uli; Line JUHL; Kim G. LARSEN a Jiří SRBA. Energy Games in Multiweighted Automata. In Proceedings of the 8th International Colloquium on Theoretical Aspects of Computing ({ICTAC}'11). Neuveden: Springer-Verlag, 2011, s. 95-115. ISBN 978-3-642-23282-4. Dostupné z: https://doi.org/10.1007/978-3-642-23283-1_9.

RAVN, Anders P.; Jiří SRBA a Saleem VIGHIO. Modelling and Verification of Web Services Business Activity Protocol. In Proceedings of the 17th International Conference on Tools and Algorithms for the Construction and Analysis of Systems ({TACAS}'11). Neuveden: Springer-Verlag, 2011, s. 357-371. ISBN 978-3-642-19834-2. Dostupné z: https://doi.org/10.1007/978-3-642-19835-9_32.

DALSGAARD, Andreas E.; Rene R. HANSEN; Kenneth Y. JOERGENSEN; Kim G. LARSEN; Mads Chr. OLESEN a Jiří SRBA. opaal: A Lattice Model Checker. In Proceedings of the 3rd NASA Formal Methods Symposium ({NFM}'11). Neuveden: Springer-Verlag, 2011, s. 487-493. ISBN 978-3-642-20397-8. Dostupné z: https://doi.org/10.1007/978-3-642-20398-5.

BENEŠ, Nikola; Jan KŘETÍNSKÝ; Kim G. LARSEN; Mikael H. MOLLER a Jiří SRBA. Parametric Modal Transition Systems. In ATVA 2011 - Automated Technology for Verification and Analysis: 9th International Symposium. Heidelberg Dordrecht London New York: Springer, 2011, s. 275-289. ISBN 978-3-642-24371-4.

MARQUES, Abinoam Jr.; Anders P. RAVN; Jiří SRBA a Saleem VIGHIO. Tool Supported Analysis of Web Services Protocols. In Proceedings of the 5th International Workshop of Harnessing Theories for Tool Support in Software ({TTSS}'11). Oslo: University of Oslo, 2011, s. 50--64. ISBN 82-7368-371-0.

JACOBSEN, Lasse; Morten JACOBSEN; H. Mikael MOLLER a Jiří SRBA. Verification of Timed-Arc {P}etri Nets. In Cerná, Ivana, Gyimóthy, Tibor, Hromkovic, Juraj, Jefferey, Keith, Královic, Rastislav, Vukolic, Marko, Wolf, Stefan. Proceedings of the 37th International Conference on Current Trends in Theory and Practice of Computer Science ({SOFSEM}'11). Neuveden: Springer-Verlag, 2011, s. 46-72, 26 s. ISBN 978-3-642-18380-5. Dostupné z: https://doi.org/10.1007/978-3-642-18381-2_4.

JACOBSEN, Lasse; Morten JACOBSEN; H. Mikael MOLLER a Jiří SRBA. Verification of Timed-Arc Petri Nets (invited talk). In Proceedings of the 37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM'11. 2011. Dostupné z: https://doi.org/10.1007/978-3-642-18381-2_4.

RAVN P., Anders; Jiří SRBA a Saleem VIGHIO. A Formal Analysis of the Web Services Atomic Transaction Protocol with UPPAAL. In Proceedings of the 4th International Symposium On Leveraging Applications of Formal Methods, Verification and Validation (ISOLA'10). Holland: Springer, 2010, s. 579-593. ISBN 978-3-642-16557-3. Dostupné z: https://doi.org/10.1007/978-3-642-16558-0_47.

JACOBSEN, Lasse; Morten JACOBSEN; Mikael H. MOLLER a Jiří SRBA. A Framework for Relating Timed Transition Systems and Preserving TCTL Model Checking. In Proceedings of the 7th European Performance Engineering Workshop (EPEW'10). Holland: Springer, 2010, s. 83-98. ISBN 978-3-642-15783-7. Dostupné z: https://doi.org/10.1007/978-3-642-15784-4_6.

SRBA, Jiří. An Experiment with Using Google Tools for Project Supervision at Tertiary Education. In Proceedings of the 11th International Conference on Computer Systems and Technologies ({CompSysTech}'10). Neuveden: ACM, 2010, 6 s. ISBN 978-1-4503-0243-2.

BYG, Joakim; Kenneth Yrke JOERGENSEN a Jiří SRBA. An Efficient Translation of Timed-Arc Petri Nets to Networks of Timed Automata. In Proceedings of 11th International Conference on Formal Engineering Methods (ICFEM'09), pages 698-716 , volume 5885 of LNCS, Springer-Verlag, 2009. Netherlands: Springer Verlag, 2009, s. 698-716. ISBN 978-3-642-10372-8. Dostupné z: https://doi.org/10.1007/978-3-642-10373-5_36.

SRBA, Jiří. Beyond Language Equivalence on Visibly Pushdown Automata. Logical Methods in Computer Science. 2009, roč. 5/200, 1:2, 22 s. ISSN 1860-5974.

BENEŠ, Nikola; Jan KŘETÍNSKÝ; Kim G. LARSEN a Jiří SRBA. Checking Thorough Refinement on Modal Transition Systems Is EXPTIME-Complete. In Theoretical Aspects of Computing - ICTAC 2009, 6th International Colloquium, Kuala Lumpur, Malaysia, August 16-20, 2009. Proceedings. Heidelberg: Springer-Verlag, 2009, s. 112-126. ISBN 978-3-642-03465-7. Dostupné z: https://doi.org/10.1007/978-3-642-03466-4_7.

KUHNRICH, Morten; Stefan SCHWOON; Stefan KIEFER a Jiří SRBA. Interprocedural Dataflow Analysis over Weight Domains with Infinite Descending Chains. In Proceedings of 12th International Conference on Foundations of Software Science and Computation Structures (FOSSACS'09), pages 440-455, volume 5504 of LNCS, Springer-Verlag, 2009. Netherlands: Springer Verlag, 2009, s. 440-455. ISBN 978-3-642-00595-4. Dostupné z: https://doi.org/10.1007/978-3-642-00596-1_31.

BENEŠ, Nikola; Jan KŘETÍNSKÝ; Kim G. LARSEN a Jiří SRBA. On Determinism in Modal Transition Systems. Theoretical Computer Science. Elsevier, 2009, roč. 410/2009, č. 41, s. 4026-4043. ISSN 0304-3975.

BYG, Joakim; Kenneth Yrke JOERGENSEN a Jiří SRBA. TAPAAL: Editor, Simulator and Verifier of Timed-Arc Petri Nets. In Proceedings of 7th International Symposium on Automated Technology for Verification and Analysis (ATVA'09), pages 84-89, volume 5799 of LNCS, Springer-Verlag, 2009. Netherlands: Springer Verlag, 2009, s. 84-89. ISBN 978-3-642-04760-2. Dostupné z: https://doi.org/10.1007/978-3-642-04761-9_7.

ACETO, Luca; Anna INGOLFSDOTTIR; Kim G. LARSEN a Jiří SRBA. Teaching Concurrency: Theory in Practice. In Proceedings of 2nd International FME Conference on Teaching Formal Methods (TFM'09), pages 158-175, volume 5846 of LNCS, Springer-Verlag, 2009. Netherlands: Springer Verlag, 2009, s. 158-175. ISBN 978-3-642-04911-8. Dostupné z: https://doi.org/10.1007/978-3-642-04912-5_11.

SRBA, Jiří. Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets. In 6th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS'08). Netherlands: Springer-Verlag, 2008, s. 15-32, 17 s. ISBN 978-3-540-85777-8.

BOUYER, Patricia; Uli FAHRENBERG; Kim G. LARSEN; Nicolas MARKEY a Jiří SRBA. Infinite Runs in Weighted Timed Automata with Energy Constraints. In Proceedings of Formal Modeling and Analysis of Timed Systems (FORMATS'08), Lecture Notes in Computer Science 5215. Netherlands: Springer-Verlag, 2008, s. 33-47. ISBN 978-3-540-85777-8.

JANČAR, Petr a Jiří SRBA. Undecidability of Bisimilarity by Defender's Forcing. Journal of the ACM. New York: ACM, 2008, roč. 55/2008, č. 1, s. 1-26. ISSN 0004-5411.

NOWOTKA, Dirk a Jiří SRBA. Height-Deterministic Pushdown Automata. In 32nd International Symposium on Mathematical Foundations of Computer Science (MFCS'07). Netherlands: Springer-Verlag, 2007, s. 125-134. ISBN 978-3-540-74455-9.

ACETO, Luca; Anna INGOLFSDOTTIR; Kim Guldstrand LARSEN a Jiří SRBA. Reactive Systems: Modelling, Specification and Verification. 1. vyd. Cambridge, UK: Cambridge University Press, 2007, 300 s. Cambridge University Press. ISBN 978-0-521-87546-2.

DELZANNO, Giorgio; Javier ESPARZA a Jiří SRBA. Monotonic Set-Extended Prefix Rewriting and Verification of Recursive Ping-Pong Protocols. In Automated Technology for Verification and Analysis (ATVA'06). Netherlands: Springer-Verlag, 2006, 15 s. ISBN 3-540-47237-1.

JANČAR, Petr a Jiří SRBA. Undecidability Results for Bisimilarity on Prefix Rewrite Systems. LNCS, Foundations of Software Science and Computation Structures (FOSSACS'06). Netherlands: Spinger-Verlag, 2006, roč. 2006, č. 3921, s. 277-291.

SRBA, Jiří. Visibly Pushdown Automata: From Language Equivalence to Simulation and Bisimulation. LNCS, Annual Conference on Computer Science Logic (CSL'06). Netherlands: Springer-Verlag, 2006, roč. 2006, č. 4207, s. 89-103.

HUTTEL, Hans a Jiří SRBA. Decidability Issues for Extended Ping-Pong Protocol. Journal of Automated Reasoning. USA: Kluwer, 2005, ?, ?, s. 1-26.

SRBA, Jiří. On Counting the Number of Consistent Genotype Assignments for Pedigrees. In Proceedings of 25th International Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'05). Netherlands: Spring-Verlag, 2005, s. 1-12.

HUTTEL, Hans a Jiří SRBA. Recursion vs. Replication in Simple Cryptographic Protocols. In Proceedings of 31st Annual Conference on Current Trends in Theory and Practice of Informatics (SOFSEM'05). Netherlands: Springer-Verlag, 2005, s. 175-184.

SRBA, Jiří. Timed-Arc Petri Nets vs. Networks of Timed Automata. In Proceedings of the 26th International Conference on Application and Theory of {P}etri Nets (ICATPN 2005). Netherlands: Springer-Verlag, 2005, s. 385-402.

SRBA, Jiří. Completeness Results for Undecidable Bisimilarity Problems. In Proccedings of the 5th International Workshop on Verification of Infinite-State Systems (INFINITY'03). Marseille, France: Universire de Provence, Marseille, 2004, s. 9-22.

JANCAR, Petr a Jiří SRBA. Highly Undecidable Questions for Process Algebras. In Proceedings of 3rd IFIP International Conference on Theoretical Computer Science (TCS'04). USA: Kluwer, 2004, s. ?, 14 s.

MOLLER, Faron; Scot SMOLKA a Jiří SRBA. On the Computational Complexity of Bisimulation, Redux. Information and Computation. Netherlands: Elsevier Science, 2004, ?, ?, s. ?, 20 s. ISSN 0890-5401.

HUTTEL, Hans a Jiří SRBA. Recursive Ping-Pong Protocols. In Proceedings of 4th International Workshop on Issues in the Theory of Security (WITS'04). Barcelona: Peter Ryan, 2004, s. 129-140.

SRBA, Jiří. Roadmap of Infinite Results. Current Trends in Theoretical Computer Science, The Challenge of the New Century. New York, USA: World Scientific Publishing, 2004, roč. 2, č. 1, s. 337-350.

SRBA, Jiří. Complexity of Weak Bisimilarity and Regularity for BPA and BPP. Mathematical Structures in Computer Science. Great Britain: Cambridge University Press, 2003, roč. 12, č. 1, s. 567587-567607. ISSN 0960-1295.

SRBA, Jiří. Strong Bisimilarity of Simple Process Algebras: Complexity Lower Bounds. Acta Informatica. The Netherlands: Springer-Verlag, 2003, roč. 39, č. 1, s. 469-499.

JURDZINSKI, Martin; Nielsen MOGENS a Jiří SRBA. Undecidability of Domino Games and Hhp-Bisimilarity. Information and Computation. Netherlands: Springer-Verlag, 2003, roč. 184, č. 2, s. 343-368. ISSN 0890-5401.

SRBA, Jiří. Undecidability of Weak Bisimilarity for PA-Processes. In Proceedings of 6th International Conference on Developments in Language Theory (DLT'02),. Netherlands: Springer-Verlag, 2003, s. 197-208.

SRBA, Jiří. Note on the Tableau Technique for Commutative Transition Systems. In Proceedings of 5th Foundations of Software Science and Computation Structures (FOSSACS'02). Holland: Springer-Verlag, 2002, s. 387-401.

SRBA, Jiří. Roadmap of Infinite Results. Bulletin of the European Association for Theoretical Computer Science. Bratislava: EATCS, 2002, roč. 2002, č. 78, s. 163-175. ISSN 78.

SRBA, Jiří. Strong Bisimilarity and Regularity of Basic Parallel Processes is PSPACE-Hard. In Proceedings of 19th International Symposium on Theoretical Aspects of Computer Science (STACS'02). Holland: Springer-Verlag, 2002, s. 535-546.

SRBA, Jiří. Strong Bisimilarity and Regularity of Basic Process Algebra is PSPACE-Hard. In Proceedings of 29th International Colloquium on Automata, Languages and Programming (ICALP'02). Netherlands: Springer-Verlag, 2002, s. 716-727.

SRBA, Jiří. Undecidability of Weak Bisimilarity for Pushdown Processes. In Proceedings of 13th International Conference on Concurrency Theory (CONCUR'02). Holland: Springer-Verlag, 2002, s. 579-593.

SRBA, Jiří. Basic Process Algebra with Deadlocking States. Theoretical Computer Science. 2001, roč. 2001, 266(1-2), s. 605-1234. ISSN 0304-3975.

SRBA, Jiří. On the Power of Labels in Transition Systems. In Proceedings of 12th International Conference on Concurrency Theory (CONCUR'01). Holland: Springer-Verlag, 2001, s. 277-567. LNCS 2154.

NIELSEN, Mogens; Vladimiro SASSONE a Jiří SRBA. Properties of Distributed Timed-Arc Petri Nets. In Proceedings of 21st International Conference on Foundations of SoftwareTechnology and Theoretical Computer Science (FSTTCS'01). Holland: Springer Verlag, 2001, s. 280-291. LNCS 2245.

NIELSEN, Mogens; Sassone VLADIMIRO a Jiří SRBA. Towards a Notion of Distributed Time for Petri Nets. In Proceedings of 22nd International Conference on Application and Theory ofPetri Nets (ICATPN'01). Holland: Springer-Verlag, 2001, s. 23-53. LNCS 2075.

SRBA, Jiří. Complexity of Weak Bisimilarity and Regularity for BPA and BPP. In Expressiveness in Concurrency, EXPRESS'00. 1. vyd. State College: Elsevier, 2000, s. 1-20. ENTCS, Vol.39.

KLÍMA, Ondřej a Jiří SRBA. Matching Modulo Associativity and Idempotency is NP-Complete. In Mathematical Foundation of Computer Science 2000, 25th International Symposium. Berlin: Springer-Verlag, 2000, s. 456-466. Lecture Notes in Computer Science, 1893. ISBN 3-540-67901-4.

KLÍMA, Ondřej a Jiří SRBA. Complexity Issues of the Pattern Equations in Idempotent Semigroups. Technical Report, Faculty of Informatics, Masaryk University. Brno, 1999, roč. 1999, č. 02, s. 1, 14 s. ISSN FIMU-RS-99-02.

ČERNÁ, Ivana; Ondřej KLÍMA a Jiří SRBA. On the Pattern Equations. Technical Report, Faculty of Informatics, Masaryk University. Brno, 1999, roč. 1999, č. 01, s. 1, 11 s. ISSN FIMU-RS-99-01.

ČERNÁ, Ivana; Jiří SRBA a Ondřej KLÍMA. Pattern Equations and Equations with Stuttering. In SOFSEM'99: Theory and Practise of Informatics. Heidelberg: Springer, 1999, s. 369-378. ISBN 3-540-66694-X.

SRBA, Jiří. Comparing the Classes BPA and BPA with Deadlocks. Technical report, Faculty of Informatics, Masaryk University, Brno. 1998, roč. 1998, č. 05, s. 1-36. ISSN FIMU-RS-98-05.

SRBA, Jiří. Deadlocking States in Context-Free Process Algebra. In Proceedings of the The 23rd International Symposium on Mathematical Foundations of Computer Science (MFCS'98). Heidelberg: Springer-Verlag, 1998, s. 388-397. volume 1450 of LNCS.