Masaryk University

Publication Records

česky | in English

Filter publications

    2008

    1. Undecidability of Bisimilarity by Defender's Forcing
      JANČAR, Petr and Jiří SRBA. Undecidability of Bisimilarity by Defender's Forcing. Journal of the ACM. New York: ACM, 55/2008, No 1, p. 1-26. ISSN 0004-5411. 2008.
      Name in Czech: Nerozhodnutelnost bisimulace pomoci tlaku obránce
      Name (in English): Undecidability of Bisimilarity by Defender's Forcing
      RIV/00216224:14330/08:00026472 Article in a journal. Informatics. English. United States of America.
      Jančar, Petr (203 Czech Republic) -- Srba, Jiří (203 Czech Republic, guarantor)
      Keywords in English: undecidability; bisimilarity; rewrite systems
      International impact: yes
      Reviewed: yes
      Changed by: Prof. Jiří Srba, Ph.D., učo 2841. Changed: 29/9/2008 22:32.
      More: https://is.muni.cz/publication/780198/en

    2006

    1. Undecidability Results for Bisimilarity on Prefix Rewrite Systems
      JANČAR, Petr and Jiří SRBA. Undecidability Results for Bisimilarity on Prefix Rewrite Systems. LNCS, Foundations of Software Science and Computation Structures (FOSSACS'06). Netherlands: Spinger-Verlag, vol. 2006, No 3921, p. 277-291, 2006.
      Name in Czech: Nerozhodnutelnost Bisimulace na Prefixovych Prepisovacich Systemech
      Name (in English): Undecidability Results for Bisimilarity on Prefix Rewrite Systems
      RIV/00216224:14330/06:00015979 Article in a journal. Informatics. English. Netherlands.
      Jančar, Petr (203 Czech Republic) -- Srba, Jiří (203 Czech Republic, guarantor)
      Keywords in English: bisimilarity; undecidability; prefix rewriting
      Type of proceedings: post-proceedings
      International impact: yes
      Reviewed: yes
      Changed by: RNDr. JUDr. Vladimír Šmíd, CSc., učo 1084. Changed: 6/7/2007 09:01.
      More: https://is.muni.cz/publication/702212/en
    2. Visibly Pushdown Automata: From Language Equivalence to Simulation and Bisimulation
      SRBA, Jiří. Visibly Pushdown Automata: From Language Equivalence to Simulation and Bisimulation. LNCS, Annual Conference on Computer Science Logic (CSL'06). Netherlands: Springer-Verlag, vol. 2006, No 4207, p. 89-103, 2006.
      Name in Czech: Viditelne Zasobnikove Automaty: Od Jazykove Ekvivalence k Simulaci a Bisimulaci
      Name (in English): Visibly Pushdown Automata: From Language Equivalence to Simulation and Bisimulation
      RIV/00216224:14330/06:00015980 Article in a journal. Informatics. English. Netherlands.
      Srba, Jiří (203 Czech Republic, guarantor)
      Keywords in English: visibly pushdown automata; bisimilarity; decidability
      Type of proceedings: post-proceedings
      International impact: yes
      Reviewed: yes
      Changed by: RNDr. JUDr. Vladimír Šmíd, CSc., učo 1084. Changed: 6/7/2007 09:02.
      More: https://is.muni.cz/publication/702214/en

    2004

    1. Completeness Results for Undecidable Bisimilarity Problems
      SRBA, Jiří. Completeness Results for Undecidable Bisimilarity Problems. In Proccedings of the 5th International Workshop on Verification of Infinite-State Systems (INFINITY'03). Marseille, France: Universire de Provence, Marseille. p. 9-22. 2004.
      URL
      Name in Czech: Uplnostni vysledky pro nerozhodnutelne bisimulacni problemy
      Name (in English): Completeness Results for Undecidable Bisimilarity Problems
      RIV/00216224:14330/04:00010086 Proceedings paper. Informatics. English. France.
      Srba, Jiří (203 Czech Republic, guarantor)
      Keywords in English: high undecidability; bisimilarity
      Changed by: Prof. Jiří Srba, Ph.D., učo 2841. Changed: 18/1/2005 17:32.
      More: https://is.muni.cz/publication/555232/en
    2. DP lower bounds for equivalence-checking and model-checking of one-counter automata
      JANČAR, Petr, Antonín KUČERA, Faron MOLLER and Zdeněk SAWA. DP lower bounds for equivalence-checking and model-checking of one-counter automata. Information and Computation. Academic Press, vol. 188, No 1, p. 1-19. ISSN 0890-5401. 2004.
      Name in Czech: DP dolní složitostní odhady pro problémy související s formální verifikací automatů s jedním čítačem
      RIV/00216224:14330/04:00009891 Article in a journal. Informatics. English. United States of America.
      Jančar, Petr (203 Czech Republic) -- Kučera, Antonín (203 Czech Republic, guarantor) -- Moller, Faron (826 United Kingdom of Great Britain and Northern Ireland) -- Sawa, Zdeněk (203 Czech Republic)
      Keywords in English: one-counter automata; equivalence-checking; bisimilarity
      International impact: yes
      Reviewed: yes
      Changed by: prof. RNDr. Antonín Kučera, Ph.D., učo 2508. Changed: 22/11/2006 18:22.
      More: https://is.muni.cz/publication/491238/en
    3. On the Computational Complexity of Bisimulation, Redux
      MOLLER, Faron, Scot SMOLKA and Jiří SRBA. On the Computational Complexity of Bisimulation, Redux. Information and Computation. Netherlands: Elsevier Science, ?, ?, p. ?, 20 pp. ISSN 0890-5401. 2004.
      URL
      Name in Czech: Vypocetni slozitost bisimulace
      Name (in English): On the Computational Complexity of Bisimulation, Redux
      RIV/00216224:14330/04:00010071 Article in a journal. Informatics. English. Netherlands.
      Moller, Faron (752 Sweden) -- Smolka, Scot (840 United States of America) -- Srba, Jiří (203 Czech Republic, guarantor)
      Keywords in English: bisimilarity; complexity
      Changed by: Prof. Jiří Srba, Ph.D., učo 2841. Changed: 18/1/2005 17:27.
      More: https://is.muni.cz/publication/555141/en
    4. Roadmap of Infinite Results
      SRBA, Jiří. Roadmap of Infinite Results. Current Trends in Theoretical Computer Science, The Challenge of the New Century. New York, USA: World Scientific Publishing, vol. 2, No 1, p. 337-350, 2004.
      Name in Czech: Rozcesti nekonecnych vysledku
      Name (in English): Roadmap of Infinite Results
      RIV/00216224:14330/04:00010683 Article in a journal. Informatics. English. United States of America.
      Srba, Jiří (203 Czech Republic, guarantor)
      Keywords in English: infinite-state systems; bisimilarity; complexity; decidability
      Changed by: Prof. Jiří Srba, Ph.D., učo 2841. Changed: 18/1/2005 17:32.
      More: https://is.muni.cz/publication/562692/en

    2003

    1. Deciding Bisimilarity between BPA and BPP Processes
      JANČAR, Petr, Antonín KUČERA and Faron MOLLER. Deciding Bisimilarity between BPA and BPP Processes. R. Amadio, D. Lugiez (Eds.). In Proceedings of 14th International Conference on Concurrency Theory (CONCUR 2003). Berlin: Springer. p. 159-174. ISBN 3-540-40753-7. 2003.
      RIV/00216224:14330/03:00008161 Proceedings paper. Informatics. English. Germany.
      Jančar, Petr (203 Czech Republic) -- Kučera, Antonín (203 Czech Republic, guarantor) -- Moller, Faron (124 Canada)
      Keywords in English: verification; bisimilarity; infinite-state systems
      Type of proceedings: post-proceedings
      International impact: yes
      Reviewed: yes
      Changed by: prof. RNDr. Antonín Kučera, Ph.D., učo 2508. Changed: 22/11/2006 17:28.
      Identification numbers: 4200509075
      More: https://is.muni.cz/publication/488377/en
    2. Strong Bisimilarity of Simple Process Algebras: Complexity Lower Bounds
      SRBA, Jiří. Strong Bisimilarity of Simple Process Algebras: Complexity Lower Bounds. Acta Informatica. The Netherlands: Springer-Verlag, vol. 39, No 1, p. 469-499, 2003.
      URL
      Name (in English): Strong Bisimilarity of Simple Process Algebras: Complexity Lower Bounds
      RIV/00216224:14330/03:00008470 Article in a journal. Informatics. English. Netherlands.
      Srba, Jiří (203 Czech Republic, guarantor)
      Keywords in English: infinite-state systems; bisimilarity; complexity
      Changed by: Prof. Jiří Srba, Ph.D., učo 2841. Changed: 26/5/2004 13:37.
      More: https://is.muni.cz/publication/492121/en
    3. The Complexity of Bisimilarity-Checking for One-Counter Processes
      KUČERA, Antonín. The Complexity of Bisimilarity-Checking for One-Counter Processes. Theoretical Computer Science. Amsterdam, Nizozemí: Elsevier, vol. 304, 1-3, p. 157-183. ISSN 0304-3975. 2003.
      Name (in English): The Complexity of Bisimilarity-Checking for One-Counter Processes
      RIV/00216224:14330/03:00008108 Article in a journal. Informatics. English. Netherlands.
      Kučera, Antonín (203 Czech Republic, guarantor)
      Keywords in English: concurrency; one-counter automata; bisimilarity
      International impact: yes
      Reviewed: yes
      Changed by: prof. RNDr. Antonín Kučera, Ph.D., učo 2508. Changed: 22/11/2006 18:15.
      More: https://is.muni.cz/publication/487652/en
    4. Undecidability of Domino Games and Hhp-Bisimilarity
      JURDZINSKI, Martin, Nielsen MOGENS and Jiří SRBA. Undecidability of Domino Games and Hhp-Bisimilarity. Information and Computation. Netherlands: Springer-Verlag, vol. 184, No 2, p. 343-368. ISSN 0890-5401. 2003.
      URL
      Name (in English): Undecidability of Domino Games and Hhp-Bisimilarity
      RIV/00216224:14330/03:00008471 Article in a journal. Informatics. English. Netherlands.
      Jurdzinski, Martin (616 Poland) -- Mogens, Nielsen (208 Denmark) -- Srba, Jiří (203 Czech Republic, guarantor)
      Keywords in English: partial order; bisimilarity; domino games
      Changed by: Prof. Jiří Srba, Ph.D., učo 2841. Changed: 26/5/2004 13:38.
      More: https://is.muni.cz/publication/492122/en

    2002

    1. Equivalence-Checking with One-Counter Automata: A Generic Method for Proving Lower Bounds
      JANČAR, Petr, Antonín KUČERA, Faron MOLLER and Zdeněk SAWA. Equivalence-Checking with One-Counter Automata: A Generic Method for Proving Lower Bounds. In Proceedings of 5th International Conference on Foundations of Software Science and Computation Structures (FOSSACS 2002). Berlin, Heidelberg, New York: Springer. p. 172-186. ISBN 3-540-43366-X. 2002.
      Name (in English): Equivalence-Checking with One-Counter Automata: A Generic Method for Proving Lower Bounds
      RIV/00216224:14330/02:00005571 Proceedings paper. Computer hardware and software. English. Netherlands.
      Jančar, Petr (203 Czech Republic) -- Kučera, Antonín (203 Czech Republic, guarantor) -- Moller, Faron (826 United Kingdom of Great Britain and Northern Ireland) -- Sawa, Zdeněk (203 Czech Republic)
      Keywords in English: concurrency; infinite-state systems; bisimilarity
      Type of proceedings: post-proceedings
      International impact: yes
      Reviewed: yes
      Changed by: prof. RNDr. Antonín Kučera, Ph.D., učo 2508. Changed: 22/11/2006 17:28.
      More: https://is.muni.cz/publication/400151/en
    2. Roadmap of Infinite Results
      SRBA, Jiří. Roadmap of Infinite Results. Bulletin of the European Association for Theoretical Computer Science. Bratislava: EATCS, vol. 2002, No 78, p. 163-175. ISSN 78. 2002.
      Name (in English): Roadmap of Infinite Results
      RIV/00216224:14330/02:00006589 Article in a journal. Information theory. English. Slovakia.
      Srba, Jiří (203 Czech Republic, guarantor)
      Keywords in English: infinite systems; bisimilarity; regularity; survey
      Changed by: Prof. Jiří Srba, Ph.D., učo 2841. Changed: 11/11/2002 10:50.
      More: https://is.muni.cz/publication/406219/en
    3. Weak Bisimilarity between Finite-State Systems and BPA or normed BPP is Decidable in Polynomial Time
      KUČERA, Antonín and Richard MAYR. Weak Bisimilarity between Finite-State Systems and BPA or normed BPP is Decidable in Polynomial Time. Theoretical Computer Science. Amsterdam, Nizozemí, vol. 270, 1-2, p. 677-700. ISSN 0304-3975. 2002.
      Name (in English): Weak Bisimilarity between Finite-State Systems and BPA or normed BPP is Decidable in Polynomial Time
      RIV/00216224:14330/02:00004665 Article in a journal. Computer hardware and software. English. Netherlands.
      Kučera, Antonín (203 Czech Republic, guarantor) -- Mayr, Richard (276 Germany)
      Keywords in English: concurrency; infinite-state systems; bisimilarity
      International impact: yes
      Reviewed: yes
      Changed by: prof. RNDr. Antonín Kučera, Ph.D., učo 2508. Changed: 22/11/2006 18:15.
      More: https://is.muni.cz/publication/376211/en

    2001

    1. Deciding Bisimulation-Like Equivalences with Finite-State Processes
      JANČAR, Petr, Antonín KUČERA and Richard MAYR. Deciding Bisimulation-Like Equivalences with Finite-State Processes. Theoretical Computer Science. Amsterdam, Nizozemí, vol. 258, 1-2, p. 409-433. ISSN 0304-3975. 2001.
      Name (in English): Deciding Bisimulation-Like Equivalences with Finite-State Processes
      RIV/00216224:14330/01:00003122 Article in a journal. Computer hardware and software. English. Netherlands.
      Keywords in English: concurrency; infinite-state systems; bisimilarity
      Changed by: prof. RNDr. Antonín Kučera, Ph.D., učo 2508. Changed: 8/11/2001 16:30.
      More: https://is.muni.cz/publication/358431/en

    2000

    1. Effective Decomposability of Sequential Behaviours.
      KUČERA, Antonín. Effective Decomposability of Sequential Behaviours. Theoretical Computer Science. Amsterdam, Nizozemí, vol. 242, 1-2, p. 71-89. ISSN 0304-3975. 2000.
      Name (in English): Effective Decomposability of Sequential Behaviours.
      RIV/00216224:14330/00:00000061 Article in a journal. Computer hardware and software. English. Netherlands.
      Keywords in English: concurrency; process algebra; bisimilarity; decomposability
      Changed by: prof. RNDr. Antonín Kučera, Ph.D., učo 2508. Changed: 26/5/2000 11:11.
      More: https://is.muni.cz/publication/315851/en

    1999

    1. Comparing Expressibility of Normed BPA and Normed BPP Processes.
      ČERNÁ, Ivana, Mojmír KŘETÍNSKÝ and Antonín KUČERA. Comparing Expressibility of Normed BPA and Normed BPP Processes. Acta informatica. Berlin: Springer-Verlag, vol. 36, No 3, p. 233-256. ISSN 0001-5903. 1999.
      Name (in English): Comparing Expressibility of Normed BPA and Normed BPP Processes.
      RIV/00216224:14330/99:00000703 Article in a journal. Computer hardware and software. English. Germany.
      Černá, Ivana (203 Czech Republic, guarantor) -- Křetínský, Mojmír (203 Czech Republic) -- Kučera, Antonín (203 Czech Republic)
      Keywords in English: concurrency; bisimilarity; infinite-state systems
      Changed by: prof. RNDr. Ivana Černá, CSc., učo 1419. Changed: 8/6/2009 16:18.
      More: https://is.muni.cz/publication/198692/en
    2. Regularity of normed PA processes
      KUČERA, Antonín. Regularity of normed PA processes. Information Processing Letters. Elsevier, vol. 72, 1-2, p. 9-17. ISSN 0020-0190. 1999.
      Name (in English): Regularity of normed PA processes
      RIV/00216224:14330/99:00001178 Article in a journal. Computer hardware and software. English. Netherlands.
      Keywords in English: concurrency; process algebra; bisimilarity; regularity
      Changed by: prof. RNDr. Antonín Kučera, Ph.D., učo 2508. Changed: 13/1/2000 10:44.
      More: https://is.muni.cz/publication/212191/en

    1998

    1. Bisimilarity of Processes with Finite-State Systems
      JANČAR, Petr, Antonín KUČERA and Richard MAYR. Bisimilarity of Processes with Finite-State Systems. K. Larsen, S. Skyum, G. Winskel (Eds.). In Proceedings of 25th International Colloquium on Automata, Languages and Programming (ICALP'98). Berlin: Springer. p. 200-211. Lecture Notes in Computer Science, vol. 1443. ISBN 3-540-64781-3. 1998.
      Name (in English): Bisimilarity of Processes with Finite-State Systems
      RIV/00216224:14330/98:00000695 Proceedings paper. Computer hardware and software. English. Germany.
      Keywords in English: concurrency; bisimilarity; infinite-state systems
      Changed by: prof. RNDr. Antonín Kučera, Ph.D., učo 2508. Changed: 13/1/2000 10:51.
      More: https://is.muni.cz/publication/198471/en
    2. Deciding Bisimulation-Like Equivalences with Finite-State Processes
      JANČAR, Petr, Antonín KUČERA and Mayr RICHARD. Deciding Bisimulation-Like Equivalences with Finite-State Processes. Technical Report TUM. Germany: Technical University Munich, vol. 1998, TUM-I9805, p. 1-24, 1998.
      Name (in English): Deciding Bisimulation-Like Equivalences with Finite-State Processes
      RIV/00216224:14330/98:00001759 Article in a journal. Computer hardware and software. English. Germany.
      Keywords in English: process algebras; bisimilarity; finite-state systems
      Changed by: prof. RNDr. Antonín Kučera, Ph.D., učo 2508. Changed: 13/1/2000 14:03.
      More: https://is.muni.cz/publication/233351/en
    3. Weak Bisimilarity with Infinite-State Systems can be Decided in Polynomial Time
      KUČERA, Antonín and Mayr RICHARD. Weak Bisimilarity with Infinite-State Systems can be Decided in Polynomial Time. Technical Report TUM. Germany: Technical University Munich, vol. 1998, TUM-I9830, p. 1-28, 1998.
      Name (in English): Weak Bisimilarity with Infinite-State Systems can be Decided in Polynomial Time
      RIV/00216224:14330/98:00001760 Article in a journal. Computer hardware and software. English. Germany.
      Keywords in English: process algebras; bisimilarity; finite-state systems
      Changed by: prof. RNDr. Antonín Kučera, Ph.D., učo 2508. Changed: 13/1/2000 14:09.
      More: https://is.muni.cz/publication/233371/en

    1997

    1. Bisimilarity is Decidable in the Union of Normed BPA and Normed BPP Processes
      ČERNÁ, Ivana, Mojmír KŘETÍNSKÝ and Antonín KUČERA. Bisimilarity is Decidable in the Union of Normed BPA and Normed BPP Processes. Electronic Notes in Theoretical Computer Science. Elsevier, vol. 1997, No 5, p. 1-24, 1997.
      ENTCS home page
      Name (in English): Bisimilarity is Decidable in the Union of Normed BPA and Normed BPP Processes
      RIV/00216224:14330/97:00000102 Article in a journal. Computer hardware and software. English. Netherlands.
      Keywords in English: concurrency; bisimilarity; infinite-state systems
      Changed by: prof. RNDr. Antonín Kučera, Ph.D., učo 2508. Changed: 13/1/2000 10:53.
      More: https://is.muni.cz/publication/190166/en
    2. Bisimilarity of Processes with Finite-state Systems
      JANČAR, Petr and Antonín KUČERA. Bisimilarity of Processes with Finite-state Systems. FI MU Report Series. Brno: FI MU, vol. 1997, RS-97-02, p. 1-19, 1997.
      Name (in English): Bisimilarity of Processes with Finite-state Systems
      RIV/00216224:14330/97:00001757 Article in a journal. Computer hardware and software. English. Czech Republic.
      Keywords in English: process algebras; bisimilarity; finite-state systems
      Changed by: prof. RNDr. Antonín Kučera, Ph.D., učo 2508. Changed: 13/1/2000 13:51.
      More: https://is.muni.cz/publication/233331/en
    3. Bisimilarity of Processes with Finite-State Systems
      JANČAR, Petr and Antonín KUČERA. Bisimilarity of Processes with Finite-State Systems. F. Moller (Editor). In Proceedings of 2nd International Workshop on Verification of Infinite State Systems (INFINITY´97). Uppsala (Sweden): University of Uppsala. p. 72-85. UPMAIL TR No. 148. ISBN 1100-0686. 1997.
      Name (in English): Bisimilarity of Processes with Finite-State Systems
      RIV/00216224:14330/97:00000101 Proceedings paper. Computer hardware and software. English. Sweden.
      Keywords in English: concurrency; bisimilarity; infinite-state systems
      Changed by: prof. RNDr. Antonín Kučera, Ph.D., učo 2508. Changed: 13/1/2000 10:57.
      More: https://is.muni.cz/publication/190165/en
    4. Bisimilarity of Processes with Finite-State Systems.
      JANČAR, Petr and Antonín KUČERA. Bisimilarity of Processes with Finite-State Systems. Electronic Notes in Theoretical Computer Science. Elsevier, vol. 1997, No 9, p. 1-14, 1997.
      ENTCS home page
      Name (in English): Bisimilarity of Processes with Finite-State Systems.
      RIV/00216224:14330/97:00000103 Article in a journal. Computer hardware and software. English. Netherlands.
      Keywords in English: concurrency; bisimilarity; infinite-state systems
      Changed by: prof. RNDr. Antonín Kučera, Ph.D., učo 2508. Changed: 13/1/2000 10:59.
      More: https://is.muni.cz/publication/190167/en
    5. How to Parallelize Sequential Processes
      KUČERA, Antonín. How to Parallelize Sequential Processes. A. Mazurkiewicz, J. Winkowski (Eds.). In Proceedings of 8th International Conference on Concurrency Theory (CONCUR´97). Berlin: Springer. p. 302-316. Lecture Notes in Computer Science, vol. 1243. ISBN 3-540-63141-0. 1997.
      Name (in English): How to Parallelize Sequential Processes
      RIV/00216224:14330/97:00000100 Proceedings paper. Computer hardware and software. English. Germany.
      Keywords in English: concurrency; bisimilarity; infinite-state systems; decomposability
      Changed by: prof. RNDr. Antonín Kučera, Ph.D., učo 2508. Changed: 13/1/2000 11:02.
      More: https://is.muni.cz/publication/190164/en

    1996

    1. Comparing Expressibility of Normed BPA and Normed BPP Processes
      ČERNÁ, Ivana, Mojmír KŘETÍNSKÝ and Antonín KUČERA. Comparing Expressibility of Normed BPA and Normed BPP Processes. FI MU Report Series. Brno: FI MU, vol. 1996, RS-96-02, p. 1-28, 1996.
      Name (in English): Comparing Expressibility of Normed BPA and Normed BPP Processes
      RIV/00216224:14330/96:00001754 Article in a journal. Computer hardware and software. English. Czech Republic.
      Keywords in English: process algebras; bisimilarity;
      Changed by: prof. RNDr. Antonín Kučera, Ph.D., učo 2508. Changed: 13/1/2000 13:50.
      More: https://is.muni.cz/publication/233292/en
    2. How to Parallelize Sequential Processes
      KUČERA, Antonín. How to Parallelize Sequential Processes. FI MU Report Series. Brno: FI MU, vol. 1996, RS-96-05, p. 1-24, 1996.
      Name (in English): How to Parallelize Sequential Processes
      RIV/00216224:14330/96:00001755 Article in a journal. Computer hardware and software. English. Czech Republic.
      Keywords in English: process algebras; bisimilarity; decomposition
      Changed by: prof. RNDr. Antonín Kučera, Ph.D., učo 2508. Changed: 13/1/2000 13:48.
      More: https://is.muni.cz/publication/233312/en
    3. Regularity is Decidable for Normed BPA and Normed BPP Processes in Polynomial Time.
      KUČERA, Antonín. Regularity is Decidable for Normed BPA and Normed BPP Processes in Polynomial Time. K.G. Jeffery, J. Král, M. Bartošek (Eds.). In Proceedings of 23rd Seminar on Current Trends in Theory and Practice of Informatics (SOFSEM´96). Berlin: Springer. p. 377-384. Lecture Notes in Computer Science, vol. 1175. ISBN 3-540-61994-1. 1996.
      Name (in English): Regularity is Decidable for Normed BPA and Normed BPP Processes in Polynomial Time.
      RIV/00216224:14330/96:00000073 Proceedings paper. Computer hardware and software. English. Germany.
      Keywords in English: concurrency; bisimilarity; regularity
      Changed by: prof. RNDr. Antonín Kučera, Ph.D., učo 2508. Changed: 13/1/2000 11:33.
      More: https://is.muni.cz/publication/190125/en
    4. Regularity is Decidable for Normed PA Processes in Polynomial Time
      KUČERA, Antonín. Regularity is Decidable for Normed PA Processes in Polynomial Time. FI MU Report Series. Brno: FI MU, vol. 1996, RS-96-01, p. 1-17, 1996.
      Name (in English): Regularity is Decidable for Normed PA Processes in Polynomial Time
      RIV/00216224:14330/96:00001753 Article in a journal. Computer hardware and software. English. Czech Republic.
      Keywords in English: process algebras; regularity; bisimilarity
      Changed by: prof. RNDr. Antonín Kučera, Ph.D., učo 2508. Changed: 13/1/2000 13:47.
      More: https://is.muni.cz/publication/233251/en
    5. Regularity is Decidable for Normed PA Processes in Polynomial Time
      KUČERA, Antonín. Regularity is Decidable for Normed PA Processes in Polynomial Time. V. Chandru, V. Vinay (Eds.). In Proceedings of the 16th Conference on Foundations of Software Technology and Theoretical Computer Science (FST&TCS´96). Berlin: Springer. p. 111-122. Lecture Notes in Computer Science, vol. 1180. ISBN 3-540-62034-6. 1996.
      Name (in English): Regularity is Decidable for Normed PA Processes in Polynomial Time
      RIV/00216224:14330/96:00000074 Proceedings paper. Computer hardware and software. English. Germany.
      Keywords in English: concurrency; process algebras; bisimilarity; regularity
      Changed by: prof. RNDr. Antonín Kučera, Ph.D., učo 2508. Changed: 13/1/2000 11:32.
      More: https://is.muni.cz/publication/190126/en
Displayed: 19/4/2024 18:31