Masaryk University

Publication Records

česky | in English

Filter publications

    2009

    1. BRÁZDIL, Tomáš, Václav BROŽEK, Antonín KUČERA and Jan OBDRŽÁLEK. Qualitative Reachability in Stochastic BPA Games. In Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science. Freiburg, Germany: IBFI Schloss Dagstuhl, 2009, p. 207-218. ISBN 978-3-939897-09-5.
    2. KŘETÍNSKÝ, Mojmír, Vojtěch ŘEHÁK and Jan STREJČEK. Reachability is decidable for weakly extended process rewrite systems. Information and Computation. Elsevier, 2009, vol. 207, No 6, p. 671-680. ISSN 0890-5401.

    2008

    1. BRÁZDIL, Tomáš, Václav BROŽEK, Vojtěch FOREJT and Antonín KUČERA. Reachability in Recursive Markov Decision Processes. Information and Computation. Elsevier, 2008, vol. 206, No 5, p. 520-537. ISSN 0890-5401.
    2. BROŽEK, Václav. Regularity in PDA Games Revisited. In MEMICS 2008 proceedings. Brno: L. Matyska, D. Antoš, M. Češka, Z. Kotásek, T. Vojnar, M. Křetínský (Eds.), 2008, p. 21-28. ISBN 978-80-7355-082-0.

    2007

    1. 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.
    2. BROŽEK, Václav. Regularity in Model Checking PDA Games. In MEMICS proceedings. Brno: Luděk Matyska, David Antoš, Milan Češka, Mojmír Křetínský, and Petr Hliněný (Eds.), 2007, p. 27-34. ISBN 978-80-7355-077-6.

    2006

    1. BRÁZDIL, Tomáš, Václav BROŽEK, Vojtěch FOREJT and Antonín KUČERA. Reachability in Recursive Markov Decision Processes. C. Baier, H. Hermanns (Eds.). In 17th International Conference on Concurrency Theory. Berlin Heidelberg New York: Springer, 2006, p. 358-374. ISBN 3-540-37376-4.
    2. ŘEHÁK, Vojtěch. Weakly Extended Process Rewrite Systems. In MOVEP'06: 7th school on MOdeling and VErifying parallel Processes. 2006.

    2005

    1. KŘETÍNSKÝ, Mojmír, Vojtěch ŘEHÁK and Jan STREJČEK. Reachability of Hennessy - Milner properties for weakly extended PRS. In FSTTCS 2005: 25th International Conference on Foundations of Software Technology and Theoretical Computer Science, 25th International Conference. Berlin, Heidelberg: Springer-Verlag, 2005, p. 213-224. ISBN 3-540-30495-9.

    2004

    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.
    2. 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.
    3. KŘETÍNSKÝ, Mojmír, Vojtěch ŘEHÁK and Jan STREJČEK. On the Expressive Power of Extended Process Rewrite Systems. BRICS Report Series. Aarhus: Basic Research in Computer Science, 2004, vol. 2004, RS-04-7, p. 1-18. ISSN 0909-0878.
    4. Ř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.
Display details
Displayed: 1/5/2024 23:51