Výpis publikací

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.

ČERNÁ, Ivana a 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, s. 1-21. ISBN 0444512918.

KUČERA, Antonín. Effective Decomposability of Sequential Behaviours. Theoretical Computer Science. Amsterdam, Nizozemí, 2000, roč. 242, 1-2, s. 71-89. ISSN 0304-3975.

KUČERA, Antonín. Regularity of normed PA processes. Information Processing Letters. Elsevier, 1999, roč. 72, 1-2, s. 9-17. ISSN 0020-0190.

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.

BRIM, Luboš. Modal logics for timed process algebras. In First North American First North American Process Algebra Workshop. Workshops in Computing, Springer-Verlag, 1992, s. 13-28. ISBN 3-540-19822-9.