-
How to Order Vertices for Distributed LTL Model-Checking Based on Accepting Predecessors J - Článek v odborném periodikuBRIM, Luboš; Ivana ČERNÁ; Pavel MORAVEC a Jiří ŠIMŠA. How to Order Vertices for Distributed LTL Model-Checking Based on Accepting Predecessors. Electronic Notes in Theoretical Computer Science. Nizozemsko: Elsevier, 2006, roč. 135, č. 2, s. 3-18, 15 s. ISSN 1571-0661.Podrobněji: https://is.muni.cz/publication/702503/cs
-
How to Order Vertices for Distributed LTL Model-Checking Based on Accepting Predecessors D - Stať ve sborníkuBRIM, Luboš; Ivana ČERNÁ; Pavel MORAVEC a Jiří ŠIMŠA. How to Order Vertices for Distributed LTL Model-Checking Based on Accepting Predecessors. In Proceedings of the 4th International Workshop on Parallel and Distributed Methods in verifiCation (PDMC 2005). Lisboa, Portugal: TU Munchen, 2005, s. 1-12.Podrobněji: https://is.muni.cz/publication/571233/cs
-
Accepting Predecessors are Better than Back Edges in Distributed LTL Model-Checking. B - Odborná knihaBRIM, Luboš; Ivana ČERNÁ; Pavel MORAVEC a Jiří ŠIMŠA. Accepting Predecessors are Better than Back Edges in Distributed LTL Model-Checking. Brno: Faculty of Informatics, 2004, 22 s. Technical Reports, FIMU-RS-2004-09.Podrobněji: https://is.muni.cz/publication/563169/cs