Výpis publikací

KŘETÍNSKÝ, Mojmír; Vojtěch ŘEHÁK a Jan STREJČEK. Petri Nets Are Less Expressive Than State-Extended PA. Theoretical Computer Science. Amsterdam, North Holland: Elsevier Science Publishers, 2008, roč. 394, 1-2, s. 134-140. ISSN 0304-3975.

ROSICKÝ, J. Factorization systems and classification problems. In Applied and Computational Category Theory ACCAT 2006. Wien: Vienna University of Technology, 2006, s. 24-26.

KURZ, Alexander a J. ROSICKÝ. Weak factorizations, fractions and homotopies. Applied Categorical Structures. 2005, roč. 13, č. 2, s. 141-160. ISSN 0927-2852.

KUČERA, Antonín. Efficient Verification Algorithms for One-Counter Processes. U. Montanari, J.D.P. Rolim, E. Welzl (Eds.). In Proceedings of 27th International Colloquium on Automata, Languages and Programming (ICALP 2000). Berlin, Heidelberg, New York: Springer, 2000, s. 317-328. Lecture Notes in Computer Science, vol. 1853. ISBN 3-540-67715-1.

JANČAR, Petr; Antonín KUČERA a Faron MOLLER. Simulation and Bisimulation over One-Counter Processes. H. Reichel, S. Tison (Eds.). In Proceedings of 17th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2000). Berlin, Heidelberg, New York: Springer, 2000, s. 334-345. Lecture Notes in Computer Science, vol. 1770. ISBN 3-540-67141-2.

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.