Filtrování

    1999

    1. Decidability and complexity of equivalences for simple process algebras
      STŘÍBRNÁ, Jitka. Decidability and complexity of equivalences for simple process algebras. Edinburgh: University of Edinburgh, 1999, 125 s. LFCS Report Series, ECS-LFCS-99-408.
      Podrobněji: https://is.muni.cz/publication/203015/cs

    1998

    1. Hardness results for weak bisimilarity of simple process algebras
      STŘÍBRNÁ, Jitka. Hardness results for weak bisimilarity of simple process algebras. In Proceedings of MFCS'98 Workshop on Concurrency. Netherlands: Elsevier, 1998, s. 175-183. ENTCS Volume 18.
      Podrobněji: https://is.muni.cz/publication/203023/cs

    1997

    1. Decidability of strong bisimulation of Basic Parallel Processes using Hilbert's basis theorem
      STŘÍBRNÁ, Jitka. Decidability of strong bisimulation of Basic Parallel Processes using Hilbert's basis theorem. In Proceedings of Infinity'97: 2nd International Workshop on Verification of Infinite State System. Upsala, Sweden: UPMAIL, 1997, s. 63, 9 s. Technical Report No. 148. ISSN 1100-0686.
      Podrobněji: https://is.muni.cz/publication/203031/cs
Zobrazit podrobně