Publication Records

CHMELÍK, Martin and Vojtěch ŘEHÁK. Controllable-choice Message Sequence Graphs. In Proceedings of Mathematical and Engineering Methods in Computer Science, 8th Doctoral Workshop (MEMICS 2012), Selected Papers. Berlin Heidelberg: Springer, 2013, p. 118-130. ISBN 978-3-642-36044-2. Available from: https://dx.doi.org/10.1007/978-3-642-36046-6_12.

BOZZELLI, Laura, Mojmír KŘETÍNSKÝ, Vojtěch ŘEHÁK and Jan STREJČEK. On Decidability of LTL Model Checking for Process Rewrite Systems. Acta informatica. Berlin: Springer-Verlag, 2009, vol. 46, No 1, p. 1-28. ISSN 0001-5903.

KŘETÍNSKÝ, Mojmír, Vojtěch ŘEHÁK and Jan STREJČEK. On Decidability of LTL+Past Model Checking for Process Rewrite Systems. In Joint Proceedings of the 8th, 9th, and 10th International Workshops on Verification of Infinite-State Systems (INFINITY 2006, 2007, 2008). 2009th ed. Amsterdam, The Netherlands: Elsevier Science Publishers, 2009, p. 105-117. ISSN 1571-0661.

BOUYER, Patricia, Uli FAHRENBERG, Kim G. LARSEN, Nicolas MARKEY and 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, p. 33-47. ISBN 978-3-540-85777-8.

BRIM, Luboš and Mojmír KŘETÍNSKÝ. Model Checking Large Finite-State Systems and Beyond. In 33rd Conference on Current Trends in Theory and Practice of Computer Science. Berlin: Springer-Verlag, 2007, p. 9-28. ISBN 978-3-540-69506-6.

KŘETÍNSKÝ, Mojmír, Vojtěch ŘEHÁK and Jan STREJČEK. On Decidability of LTL+Past Model Checking for Process Rewrite Systems. In Proc. of 9th Internat. Workshop on Verification of Infinite-State Systems. 2007.

BOZZELLI, Laura, Mojmír KŘETÍNSKÝ, Vojtěch ŘEHÁK and Jan STREJČEK. On Decidability of LTL Model Checking for Process Rewrite Systems. In FSTTCS 2006: 26th International Conference on Foundations of Software Technology and Theoretical Computer Science, 26th International Conference, Kolkata, India, December 13-15, 2006, Proceedings. Berlin: Springer-Verlag, 2006, p. 248-259. ISBN 978-3-540-49994-7.

BOZZELLI, Laura, Mojmír KŘETÍNSKÝ, Vojtěch ŘEHÁK and Jan STREJČEK. On Decidability of LTL Model Checking for Weakly Extended Process Rewrite Systems. Brno: FI MU, 2006. FIMU-RS-2006-05.

KŘETÍNSKÝ, Mojmír, Vojtěch ŘEHÁK and Jan STREJČEK. Refining Undecidability Border of Weak Bisimilarity. (Refining Undecidability Border of Weak Bisimilarity). In Proceedings of the 7th International Workshop on Verification of Infinite-State Systems (INFINITY'05). 2006th ed. Amsterdam, The Netherlands: Elsevier Science, 2006, p. 17-36. ISSN 1571-0661.

HLINĚNÝ, Petr and Detlef SEESE. Trees, grids, and MSO decidability: From graphs to matroids. Theoretical Computer Science. Amsterdam: Elsevier, 2006, vol. 351, No 3, p. 372-393. ISSN 0304-3975.

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, vol. 2006, No 4207, p. 89-103.

ŘEHÁK, Vojtěch. Weakly Extended Process Rewrite Systems. In MOVEP'06: 7th school on MOdeling and VErifying parallel Processes. 2006.

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

PELÁNEK, Radek and Pavel KRČÁL. On Sampled Semantics of Timed Systems. In Foundations of Software Technology and Theoretical Computer Science. India: Springer, 2005, p. 310-321. ISBN 978-3-540-30495-1.

KŘETÍNSKÝ, Mojmír, Vojtěch ŘEHÁK and Jan STREJČEK. Extended Process Rewrite Systems: Expressiveness and Reachability. In CONCUR 2004 - Concurrency Theory. LNCS 3170. Berlin, Heidelberg, New York: Springer, 2004, p. 355-370. ISBN 3-540-22940-X.

KŘETÍNSKÝ, Mojmír, Vojtěch ŘEHÁK and Jan STREJČEK. On Extensions of Process Rewrite Systems: Rewrite Systems with Weak Finite-State Unit. In INFINITY'2003: 5th International Workshop on Verification of Infinite-State Systems. 2004th ed. Amsterdam, The Netherlands: Elsevier Science, 2004, p. 75-88. ISSN 1571-0661.

ŘEHÁK, Vojtěch. Reachability for Extended Process Rewrite Systems. In MOVEP'04: 6th school on MOdeling and VErifying parallel Processes. Bruxelles, Belgium: Universite Libre de Bruxelles, 2004, p. 77-82.

HUTTEL, Hans and 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, p. 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, vol. 2, No 1, p. 337-350.

ČERNÁ, Ivana and Jitka STŘÍBRNÁ. Modifications of Expansion Trees for Weak Bisimulation in BPA. In Verification of Infinite-State Systems Infinity'2002. The Netherlands: Elsevier Science Publishers, 2002, p. 1-21. ISBN 0444512918.

STŘÍBRNÁ, Jitka. Decidability and complexity of equivalences for simple process algebras. Edinburgh: University of Edinburgh, 1999, 125 pp. LFCS Report Series, ECS-LFCS-99-408.

STŘÍBRNÁ, Jitka. Hardness results for weak bisimilarity of simple process algebras. In Proceedings of MFCS'98 Workshop on Concurrency. Netherlands: Elsevier, 1998, p. 175-183. ENTCS Volume 18.