Mgr. Jiří Srba, Ph.D.


E‑mail:
Životopis

Curriculum vitae

Person Identification
  • Jiri Srba, born June 21st, 1975, in Trebic, Czech Republic, single.
Workplace
  • PhD Student at BRICS, Basic Research in Computer Science, Aarhus, Denmark.
Employment Position
  • Phd student, teaching assistant
Education and Academic Qualifications
  • 1. 9. 1999 - PhD studies at BRICS, Aarhus University, Denmark
  • 1. 9. 1998 - 1998: Mgr. (master's degree) in Theoretical Computer Science, Faculty of Informatics, Masaryk University, Brno, Czech Republic Thesis: Context-Free Process Algebras Extended with Deadlocking States
  • PhD studies at Faculty of Informatics, Masaryk University in Brno
  • 1998: Mgr. (master's degree) in Didactics for Secondary Schools, Faculty of Informatics, Masaryk University, Brno, Czech Republic
  • 1996: Bc. in Computer Science, Faculty of Informatics, Masaryk University, Brno, Czech Republic
  • 1. 9. 1996 - 8. 6. 1998 Faculty of Informatics, MU Brno, Didactics for Secondary Schools
  • 1. 9. 1993 - 29. 6. 1998 Faculty of Informatics, MU Brno, Theoretical Computer Science
  • 1. 9. 1989 - 30. 6. 1993 Secondary grammar school in Trebic
  • 1. 9. 1981 - 30. 6. 1989 Basic school in Trebic
Employment Summary
  • 1999 - : Teaching Assistant, Dept. of Computer Science, Faculty of Science, University of Aarhus, Denmark.
  • 1998 - 1999: Assistant, Dept. of Computer Science, Faculty of Informatics, Masaryk University, Czech Republic.
Pedagogical Activities
  • Programming Language Semantics, Formal Languages and Automata (seminar leader), Fundamentale Modeller (seminar leader), Programming Languages and Formal Semantics (seminar leader).
Scientific and Research Activities
  • Concurrency theory, process algebras, timed Petri nets, logics over partial orders, algebraic specification, decidability issues in various classes of (infinite-state) systems, verification of concurrent systems, modal and temporal logics, word equations, semantic unification, computational complexity.
Academical Stays
  • 1999: BRICS PhD school, Aarhus, Denmark.
  • 1999: Summer School in Semantics of Computation, May 3-7, BRICS, University of Aarhus, Denmark.
Appreciation of Science Community
  • 1998: Awarded the MFCS'98 prize for the Best Students' Contribution
  • 1998: Awarded the annual rector's prize, Masaryk University
  • 1998: Awarded the annual dean's prize, Faculty of Informatics, Masaryk University
  • 1996: Awarded the annual dean's prize, Faculty of Informatics, Masaryk University
Selected Publications
  • 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. doi:10.1007/s10009-014-0359-5. Link to publisher info
  • 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. doi:10.1016/j.tcs.2013.07.011. Link to publisher info
  • 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, 6 s. ISBN 978-3-319-06199-3. doi:10.1007/978-3-319-06200-6_26. Link info
  • 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, 20 s. ISBN 978-3-319-07733-8. doi:10.1007/978-3-319-07734-5_4. Link info
  • 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, 15 s. ISBN 978-3-662-44583-9. doi:10.1007/978-3-662-44584-6_14. Link info
  • 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, 15 s. ISBN 978-3-319-10511-6. doi:10.1007/978-3-319-10512-3_17. Link info
  • 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. doi:10.1016/j.jlap.2012.03.008. info
  • 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. doi:10.1007/978-3-642-18381-2_4. URL info
  • 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, 15 s. ISBN 978-3-642-19834-2. doi:10.1007/978-3-642-19835-9_32. URL info
  • 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, 7 s. ISBN 978-3-642-20397-8. doi:10.1007/978-3-642-20398-5. URL info
  • 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, 21 s. ISBN 978-3-642-23282-4. doi:10.1007/978-3-642-23283-1_9. info
  • 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, 15 s. ISBN 82-7368-371-0. URL info
  • 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, 15 s. ISBN 978-3-540-85777-8. info
  • 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. info
  • 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. info
  • 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. URL info
  • 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, 10 s. ISBN 978-3-540-74455-9. info
  • 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. info
  • 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. info
  • 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. info
  • 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, 10 s. info
  • 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, 18 s. info
  • 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, 12 s. info
  • HUTTEL, Hans a Jiří SRBA. Decidability Issues for Extended Ping-Pong Protocol. Journal of Automated Reasoning, USA: Kluwer, 2005, ?, ?, s. 1-26. info
  • MOLLER, Faron, Scot SMOLKA a Jiří SRBA. On the Computational Complexity of Bisimulation, Redux. Information and Computation, Netherlands: Elsevier Science, 2004, ?, ?, s. ? ISSN 0890-5401. URL info
  • 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, 12 s. URL info
  • 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. URL info
  • 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, 14 s. URL info
  • 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. info
  • 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, 12 s. URL info
  • SRBA, Jiří. Strong Bisimilarity of Simple Process Algebras: Complexity Lower Bounds. Acta Informatica, The Netherlands: Springer-Verlag, 2003, roč. 39, č. 1, s. 469-499. URL info
  • 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. URL info
  • 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. URL info
  • 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. info
  • 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. info
  • 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. info
  • 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. info
  • 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. info
  • SRBA, Jiří. Basic Process Algebra with Deadlocking States. Theoretical Computer Science, 2001, roč. 2001, 266(1-2), s. 605-1234. ISSN 0304-3975. info
  • 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. info
  • 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. info
  • 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. info
  • Č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. info
  • 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. ISSN FIMU-RS-99-02. URL info
  • SRBA, Jiří. Context-free process algebras extended with deadlocks. Brno, 1998. 42 s. info
  • 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. URL info
  • 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. URL info

2000/10/09

Používáte starou verzi internetového prohlížeče. Doporučujeme aktualizovat Váš prohlížeč na nejnovější verzi.

Další info