Výpis publikací

KŘETÍNSKÝ, Mojmír, Vojtěch ŘEHÁK a 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). 2009. vyd. Amsterdam, The Netherlands: Elsevier Science Publishers, 2009, s. 105-117. ISSN 1571-0661.

KŘETÍNSKÝ, Mojmír, Vojtěch ŘEHÁK a Jan STREJČEK. Reachability is decidable for weakly extended process rewrite systems. Information and Computation. Elsevier, 2009, roč. 207, č. 6, s. 671-680. ISSN 0890-5401.

KŘETÍNSKÝ, Mojmír, Vojtěch ŘEHÁK a 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.

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

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

KŘETÍNSKÝ, Mojmír, Vojtěch ŘEHÁK a 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, s. 213-224. ISBN 3-540-30495-9.

KŘETÍNSKÝ, Mojmír, Vojtěch ŘEHÁK a Jan STREJČEK. Refining Undecidability Border of Weak Bisimilarity. BRICS Notes Series. San Francisco, USA, 2005, roč. 2005, NS-05-4, s. 3-14. ISSN 0909-3206.

KŘETÍNSKÝ, Mojmír, Vojtěch ŘEHÁK a Jan STREJČEK. Refining Undecidability Border of Weak Bisimilarity. (full version of INFINITY 2005 paper). Brno: FI MU, 2005. FIMU-RS-2005-06.

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

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.

KŘETÍNSKÝ, Mojmír, Vojtěch ŘEHÁK a 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. 2004. vyd. Amsterdam, The Netherlands: Elsevier Science, 2004, s. 75-88. ISSN 1571-0661.

KŘETÍNSKÝ, Mojmír, Vojtěch ŘEHÁK a Jan STREJČEK. On the Expressive Power of Extended Process Rewrite Systems. BRICS Report Series. Aarhus: Basic Research in Computer Science, 2004, roč. 2004, RS-04-7, s. 1-18. ISSN 0909-0878.

Ř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, s. 77-82.

KŘETÍNSKÝ, Mojmír, Vojtěch ŘEHÁK a Jan STREJČEK. On Extensions of Process Rewrite Systems: Rewrite Systems with Weak Finite-State Unit. In Prelim.Proc.of the 5th Internat.Workshop on Verification of Infinite-State Systems (INFINITY'2003). Marseille, France: Universite de Provence, Marseille, 2003, s. 73-86.

KŘETÍNSKÝ, Mojmír, Vojtěch ŘEHÁK a Jan STREJČEK. Process Rewrite Systems with Weak Finite-State Unit (full version of INFINITY'2003 paper). Brno: FI MU, 2003, 23 s. FIMU-RS-2003-05.