Masaryk University

Publication Records

česky | in English

Filter publications

    2009

    1. On Decidability of LTL Model Checking for Process Rewrite Systems
      BOZZELLI, Laura, Mojmír KŘETÍNSKÝ, Vojtěch ŘEHÁK and Jan STREJČEK. On Decidability of LTL Model Checking for Process Rewrite Systems. Acta informatica. Berlin: Springer-Verlag, 2009, vol. 46, No 1, p. 1-28. ISSN 0001-5903.
      URL
      Name in Czech: O rozhodnutelnosti problému ověřování modelu pro LTL a procesové přepisovací systémy
      RIV/00216224:14330/09:00029078 Article in a journal. Informatics. English. Germany.
      Bozzelli, Laura (380 Italy) -- Křetínský, Mojmír (203 Czech Republic, guarantor) -- Řehák, Vojtěch (203 Czech Republic) -- Strejček, Jan (203 Czech Republic)
      Keywords in English: infinite-state systems; linear time logic; decidability; model checking
      International impact: yes
      Reviewed: yes
      Changed by: doc. RNDr. Vojtěch Řehák, Ph.D., učo 3721. Changed: 22/5/2009 16:43.
      More: https://is.muni.cz/publication/769242/en

    2008

    1. Deciding probabilistic bisimilarity over infinite-state probabilistic systems
      BRÁZDIL, Tomáš, Antonín KUČERA and Oldřich STRAŽOVSKÝ. Deciding probabilistic bisimilarity over infinite-state probabilistic systems. Acta informatica. Berlin: Springer-Verlag, 2008, vol. 45, No 2, p. 131-154. ISSN 0001-5903.
      Name in Czech: Rozhodnutelnost pravděpodobnostní bisimulační ekvivalence pro systémy s nekonečně mnoha stavy
      RIV/00216224:14330/08:00025864 Article in a journal. Informatics. English. Germany.
      Brázdil, Tomáš (203 Czech Republic) -- Kučera, Antonín (203 Czech Republic, guarantor) -- Stražovský, Oldřich (203 Czech Republic)
      Keywords in English: probabilistic bisimilarity; infinite-state systems
      International impact: yes
      Reviewed: yes
      Changed by: prof. RNDr. Antonín Kučera, Ph.D., učo 2508. Changed: 22/5/2009 15:10.
      More: https://is.muni.cz/publication/763242/en
    2. Formal verification of systems with an unlimited number of components
      VAŘEKOVÁ, Pavlína, Barbora ZIMMEROVÁ, Pavel MORAVEC and Ivana ČERNÁ. Formal verification of systems with an unlimited number of components. IET Software journal. Inst. of Engeneering and Technology, 2008, Volume 2, Isuue 6, p. p. 532-546, 15 pp. ISSN 1751-8806.
      URL
      Name in Czech: Automatická verifikace systémů s neomezeným počtem komponent
      RIV/00216224:14330/08:00024358 Article in a journal. Informatics. English. United States of America.
      Vařeková, Pavlína (203 Czech Republic, belonging to the institution) -- Zimmerová, Barbora (203 Czech Republic, belonging to the institution) -- Moravec, Pavel (203 Czech Republic) -- Černá, Ivana (203 Czech Republic, guarantor, belonging to the institution)
      Keywords in English: Component-based systems; dynamic number of components; infinite-state systems; formal verification
      International impact: yes
      Reviewed: yes
      Changed by: doc. Ing. RNDr. Barbora Bühnová, Ph.D., učo 39394. Changed: 4/11/2012 15:52.
      More: https://is.muni.cz/publication/800041/en

    2007

    1. On Symbolic Verification of Weakly Extended PAD
      BOUAJJANI, Ahmed, Jan STREJČEK and Tayssir TOUILI. On Symbolic Verification of Weakly Extended PAD. In Proceedings of the 13th International Workshop on Expressiveness in Concurrency (EXPRESS 2006). Neuveden: Elsevier, 2007, p. 47-64. ISSN 1571-0661.
      URL
      Name in Czech: Symbolicka verifikace slabe rozsirenych PAD
      RIV/00216224:14330/07:00021744 Proceedings paper. Informatics. English. Germany.
      Bouajjani, Ahmed (504 Morocco) -- Strejček, Jan (203 Czech Republic, guarantor) -- Touili, Tayssir (788 Tunisia)
      Keywords in English: rewrite systems; infinite-state systems; symbolic reachability analysis; model checking
      Type of proceedings: post-proceedings
      International impact: yes
      Reviewed: yes
      Changed by: prof. RNDr. Jan Strejček, Ph.D., učo 3366. Changed: 23/6/2009 17:48.
      More: https://is.muni.cz/publication/702264/en

    2006

    1. A General Approach to Comparing Infinite-State Systems with Their Finite-State Specifications
      KUČERA, Antonín and Philippe SCHNOEBELEN. A General Approach to Comparing Infinite-State Systems with Their Finite-State Specifications. Theoretical Computer Science. Amsterdam, Nizozemí: Elsevier, 2006, vol. 358, 2-3, p. 315-333. ISSN 0304-3975.
      Name in Czech: Sémantické porovnávání systémů s jejich konečnými specifikacemi
      RIV/00216224:14330/06:00017031 Article in a journal. Informatics. English. Netherlands.
      Kučera, Antonín (203 Czech Republic, guarantor) -- Schnoebelen, Philippe (250 France)
      Keywords in English: concurrency; semantic equivalences; infinite-state systems
      International impact: yes
      Reviewed: yes
      Changed by: prof. RNDr. Antonín Kučera, Ph.D., učo 2508. Changed: 30/11/2006 23:48.
      More: https://is.muni.cz/publication/639666/en
    2. Equivalence-Checking on Infinite-State Systems: Techniques and Results
      KUČERA, Antonín and Petr JANČAR. Equivalence-Checking on Infinite-State Systems: Techniques and Results. Theory and practice of logic programming. Cambridge: Cambridge University Press, 2006, vol. 6, No 3, p. 227-264. ISSN 1471-0684.
      Name in Czech: Automatické ověřování sémantických ekvivalencí na systémech s nekonečně mnoha stavy: techniky a výsledky
      RIV/00216224:14330/06:00016828 Article in a journal. Informatics. English. United Kingdom of Great Britain and Northern Ireland.
      Kučera, Antonín (203 Czech Republic, guarantor) -- Jančar, Petr (203 Czech Republic)
      Keywords in English: formal verification; infinite-state systems; equivalence-checking
      International impact: yes
      Reviewed: yes
      Changed by: prof. RNDr. Antonín Kučera, Ph.D., učo 2508. Changed: 30/11/2006 23:49.
      More: https://is.muni.cz/publication/634964/en
    3. On Decidability of LTL Model Checking for Process Rewrite Systems
      BOZZELLI, Laura, Mojmír KŘETÍNSKÝ, Vojtěch ŘEHÁK and Jan STREJČEK. On Decidability of LTL Model Checking for Process Rewrite Systems. In FSTTCS 2006: 26th International Conference on Foundations of Software Technology and Theoretical Computer Science, 26th International Conference, Kolkata, India, December 13-15, 2006, Proceedings. Berlin: Springer-Verlag, 2006, p. 248-259. ISBN 978-3-540-49994-7.
      Name in Czech: O rozhodnutelnosti problému ověřování modelu pro LTL a procesové přepisovací systémy
      RIV/00216224:14330/06:00015417 Proceedings paper. Informatics. English. India.
      Bozzelli, Laura (380 Italy) -- Křetínský, Mojmír (203 Czech Republic, guarantor) -- Řehák, Vojtěch (203 Czech Republic) -- Strejček, Jan (203 Czech Republic)
      Keywords in English: infinite-state systems; linear time logic; decidability; model checking
      Type of proceedings: pre-proceedings
      International impact: yes
      Reviewed: yes
      Changed by: prof. RNDr. Jan Strejček, Ph.D., učo 3366. Changed: 20/12/2011 18:12.
      More: https://is.muni.cz/publication/698768/en
    4. On Decidability of LTL Model Checking for Weakly Extended Process Rewrite Systems
      BOZZELLI, Laura, Mojmír KŘETÍNSKÝ, Vojtěch ŘEHÁK and Jan STREJČEK. On Decidability of LTL Model Checking for Weakly Extended Process Rewrite Systems. Brno: FI MU, 2006. FIMU-RS-2006-05.
      URL
      Name in Czech: O rozhodnutelnosti problému ověřování modelu pro LTL a slabě royšířené procesové přepisovací systémy
      RIV/00216224:14330/06:00015439 Audiovisual works. Informatics. English. Czech Republic.
      Bozzelli, Laura (380 Italy) -- Křetínský, Mojmír (203 Czech Republic, guarantor) -- Řehák, Vojtěch (203 Czech Republic) -- Strejček, Jan (203 Czech Republic)
      Keywords in English: infinite-state systems; linear time logic; decidability; model checking
      International impact: yes
      Changed by: doc. RNDr. Vojtěch Řehák, Ph.D., učo 3721. Changed: 31/3/2010 15:19.
      More: https://is.muni.cz/publication/701734/en
    5. On Symbolic Verification of Weakly Extended PAD
      BOUAJJANI, Ahmed, Jan STREJČEK and Tayssir TOUILI. On Symbolic Verification of Weakly Extended PAD. In Preliminary Proceedings - 13th International Workshow on Expressiveness in Concurrency - EXPRESS'06. London: Imperial College London, 2006, p. 29-41.
      Name in Czech: Symbolicka verifikace slabe rozsirenych PAD
      RIV/00216224:14330/06:00018747 Proceedings paper. Informatics. English. Germany.
      Bouajjani, Ahmed (504 Morocco) -- Strejček, Jan (203 Czech Republic, guarantor) -- Touili, Tayssir (788 Tunisia)
      Keywords in English: rewrite systems; infinite-state systems; symbolic reachability analysis; model checking
      Type of proceedings: pre-proceedings
      International impact: yes
      Reviewed: yes
      Changed by: prof. RNDr. Jan Strejček, Ph.D., učo 3366. Changed: 18/6/2007 14:11.
      More: https://is.muni.cz/publication/719602/en

    2004

    1. A General Approach to Comparing Infinite-State Systems with Their Finite-State Specifications
      KUČERA, Antonín and Philippe SCHNOEBELEN. A General Approach to Comparing Infinite-State Systems with Their Finite-State Specifications. P. Gardner, N. Yoshida (Eds.). In Proceedings of 15th International Conference on Concurrency Theory (CONCUR 2004). Berlin: Springer, 2004, p. 371-386. ISBN 3-540-22940-X.
      Name in Czech: Obecný přístup k sémantickému porovnávání nekonečně-stavových systémů s jejich konečně-stavovými specifikacemi
      RIV/00216224:14330/04:00010252 Proceedings paper. Informatics. English. Germany.
      Kučera, Antonín (203 Czech Republic, guarantor) -- Schnoebelen, Philippe (250 France)
      Keywords in English: verification; semantic equivalences; 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.
      More: https://is.muni.cz/publication/557411/en
    2. 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, 2004, vol. 2, No 1, p. 337-350.
      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, 2003, p. 159-174. ISBN 3-540-40753-7.
      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, 2003, vol. 39, No 1, p. 469-499.
      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

    2002

    1. Equivalence-Checking with Infinite-State Systems: Techniques and Results.
      KUČERA, Antonín and Petr JANČAR. Equivalence-Checking with Infinite-State Systems: Techniques and Results. W.I. Grosky, F. Plášil (Eds.). In Proceedings of 29th Conference on Current Trends in Theory and Practice of Informatics (SOFSEM 2002). Berlin: Springer, 2002, p. 41-73. ISBN 3-540-00145-X.
      Name (in English): Equivalence-Checking with Infinite-State Systems: Techniques and Results.
      RIV/00216224:14330/02:00006714 Proceedings paper. Computer hardware and software. English. Germany.
      Kučera, Antonín (203 Czech Republic, guarantor) -- Jančar, Petr (203 Czech Republic)
      Keywords in English: infinite-state systems; equivalence-checking
      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/406616/en
    2. 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, 2002, p. 172-186. ISBN 3-540-43366-X.
      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
    3. Infinity 2002. 4th International Workshop on Verification of Infinite-State Systems
      KUČERA, Antonín and Richard MAYR. Infinity 2002. 4th International Workshop on Verification of Infinite-State Systems. Amsterdam: Elsevier, 2002, 106 pp. ENTCS, volume 68(6). ISBN 0444513299.
      Name (in English): Infinity 2002. 4th International Workshop on Verification of Infinite-State Systems
      RIV/00216224:14330/02:00006934 Book on a specialized topic. Computer hardware and software. English. Netherlands.
      Kučera, Antonín (203 Czech Republic, guarantor) -- Mayr, Richard (276 Germany)
      Keywords in English: infinite-state systems
      International impact: yes
      Changed by: prof. RNDr. Antonín Kučera, Ph.D., učo 2508. Changed: 22/11/2006 17:26.
      More: https://is.muni.cz/publication/407345/en
    4. INFINITY 2002. 4th International Workshop on Verification of Infinite-State Systems
      KUČERA, Antonín and Richard MAYR. INFINITY 2002. 4th International Workshop on Verification of Infinite-State Systems. 2002.
      URL
      Name (in English): INFINITY 2002. 4th International Workshop on Verification of Infinite-State Systems
      RIV/00216224:14330/02:00007778 Organization of a workshop. Information theory. English. Czech Republic.
      Kučera, Antonín (203 Czech Republic, guarantor) -- Mayr, Richard (276 Germany)
      Keywords in English: Infinite-State Systems; Formal Verification; Equivalence-Checking; Model-Checking
      International impact: yes
      Changed by: prof. RNDr. Antonín Kučera, Ph.D., učo 2508. Changed: 22/11/2006 17:26.
      More: https://is.muni.cz/publication/486636/en
    5. On the Complexity of Semantic Equivalences for Pushdown Automata and BPA
      KUČERA, Antonín and Richard MAYR. On the Complexity of Semantic Equivalences for Pushdown Automata and BPA. K. Diks, W. Rytter (Eds.). In Proceedings of 27th International Symposium on Mathematical Foundations of Computer Science (MFCS 2002). Berlin: Springer, 2002, p. 433-445. ISBN 3-540-44040-2.
      Name (in English): On the Complexity of Semantic Equivalences for Pushdown Automata and BPA
      RIV/00216224:14330/02:00006374 Proceedings paper. Computer hardware and software. English. Germany.
      Kučera, Antonín (203 Czech Republic, guarantor) -- Mayr, Richard (276 Germany)
      Keywords in English: verification; concurrency; weak 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: 4200507990
      More: https://is.muni.cz/publication/405198/en
    6. The Stuttering Principle Revisited: On the Expressiveness of Nested X and U Operators in the Logic LTL
      KUČERA, Antonín and Jan STREJČEK. The Stuttering Principle Revisited: On the Expressiveness of Nested X and U Operators in the Logic LTL. J. Bradfield (Ed.). In Proceedings of the Annual Conference of the European Association for Computer Science Logic (CSL'02). Berlin: Springer, 2002, p. 276-291. ISBN 3-540-44240-5.
      RIV/00216224:14330/02:00006381 Proceedings paper. Computer hardware and software. English. Germany.
      Kučera, Antonín (203 Czech Republic, guarantor) -- Strejček, Jan (203 Czech Republic)
      Keywords in English: verification; concurrency; weak bisimilarity; infinite-state systems
      Type of proceedings: post-proceedings
      International impact: yes
      Reviewed: yes
      Changed by: prof. RNDr. Jan Strejček, Ph.D., učo 3366. Changed: 20/12/2011 18:12.
      Identification numbers: 4200508076
      More: https://is.muni.cz/publication/405208/en
    7. 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í, 2002, vol. 270, 1-2, p. 677-700. ISSN 0304-3975.
      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
    8. Why is Simulation Harder Than Bisimulation?
      KUČERA, Antonín and Richard MAYR. Why is Simulation Harder Than Bisimulation? L. Brim, P. Jancar, M. Kretinsky, A. Kucera (Eds.). In Proceedings of 13th International Conference on Concurrency Theory (CONCUR 2002). Berlin: Springer, 2002, p. 594-609. ISBN 3-540-44043-7.
      Name (in English): Why is Simulation Harder Than Bisimulation?
      RIV/00216224:14330/02:00006376 Proceedings paper. Computer hardware and software. English. Germany.
      Kučera, Antonín (203 Czech Republic, guarantor) -- Mayr, Richard (276 Germany)
      Keywords in English: verification; concurrency; weak 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: 4200507940, 4200507971
      More: https://is.muni.cz/publication/405201/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í, 2001, vol. 258, 1-2, p. 409-433. ISSN 0304-3975.
      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

    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, 1999, vol. 36, No 3, p. 233-256. ISSN 0001-5903.
      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. On Finite Representations of Infinite-State Behaviours.
      KUČERA, Antonín. On Finite Representations of Infinite-State Behaviours. Information Processing Letters. Elsevier, 1999, vol. 70, No 1, p. 23-30. ISSN 0020-0190.
      Name (in English): On Finite Representations of Infinite-State Behaviours.
      RIV/00216224:14330/99:00000735 Article in a journal. Computer hardware and software. English. Netherlands.
      Keywords in English: concurrency; infinite-state systems; behavioural equivalences; regularity
      Changed by: prof. RNDr. Antonín Kučera, Ph.D., učo 2508. Changed: 13/1/2000 10:40.
      More: https://is.muni.cz/publication/199132/en
    3. Simulation Preorder on Simple Process Algebras
      KUČERA, Antonín and Richard MAYR. Simulation Preorder on Simple Process Algebras. J. Wiedermann, P. van Emde Boas, M. Nielsen (Eds.). In Proceedings of 26th International Colloquium on Automata, Languages and Programming (ICALP'99). Berlin: Springer, 1999, p. 503-512. Lecture Notes in Computer Science, vol. 1644. ISBN 3-540-66224-3.
      Name (in English): Simulation Preorder on Simple Process Algebras
      RIV/00216224:14330/99:00001101 Proceedings paper. Computer hardware and software. English. Germany.
      Keywords in English: concurrency; simulation; infinite-state systems
      Changed by: prof. RNDr. Antonín Kučera, Ph.D., učo 2508. Changed: 13/1/2000 10:45.
      Identification numbers: 4200507237
      More: https://is.muni.cz/publication/206913/en
    4. Weak Bisimilarity with Infinite-State Systems Can Be Decided in Polynomial Time
      KUČERA, Antonín and Richard MAYR. Weak Bisimilarity with Infinite-State Systems Can Be Decided in Polynomial Time. J.C.M. Baeten, S. Mauw (Eds.). In Proceedings of 10th International Conference on Concurrency Theory (CONCUR´99). Berlin: Springer, 1999, p. 368-382. Lecture Notes in Computer Science, vol. 1664. ISBN 3-540-66425-4.
      Name (in English): Weak Bisimilarity with Infinite-State Systems Can Be Decided in Polynomial Time
      RIV/00216224:14330/99:00001106 Proceedings paper. Computer hardware and software. English. Germany.
      Keywords in English: verification; concurrency; weak bisimilarity; infinite-state systems
      Changed by: prof. RNDr. Antonín Kučera, Ph.D., učo 2508. Changed: 13/1/2000 10:47.
      More: https://is.muni.cz/publication/207311/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, 1998, p. 200-211. Lecture Notes in Computer Science, vol. 1443. ISBN 3-540-64781-3.
      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. MFCS´98 Workshop on Concurrency, August_27-29,_1998, Brno, Czech Republic : pre-proceedings
      JANČAR, Petr and Mojmír KŘETÍNSKÝ. MFCS´98 Workshop on Concurrency, August_27-29,_1998, Brno, Czech Republic : pre-proceedings. FI MU Report Series. Brno: FI MU, 1998, vol. 1998, No 06, p. 1-209.
      Name (in English): MFCS´98 Workshop on Concurrency, August_27-29,_1998, Brno, Czech Republic : pre-proceedings
      RIV/00216224:14330/98:00001618 Article in a journal. Computer hardware and software. English. Czech Republic.
      Keywords in English: Concurrency; infinite-state systems
      Changed by: prof. RNDr. Mojmír Křetínský, CSc., učo 631. Changed: 13/1/2000 12:18.
      More: https://is.muni.cz/publication/228875/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, 1997, vol. 1997, No 5, p. 1-24.
      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. F. Moller (Editor). In Proceedings of 2nd International Workshop on Verification of Infinite State Systems (INFINITY´97). Uppsala (Sweden): University of Uppsala, 1997, p. 72-85. UPMAIL TR No. 148. ISBN 1100-0686.
      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
    3. 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, 1997, vol. 1997, No 9, p. 1-14.
      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
    4. 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, 1997, p. 302-316. Lecture Notes in Computer Science, vol. 1243. ISBN 3-540-63141-0.
      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
    5. On Finite Representations of Infinite-State Behaviours.
      KUČERA, Antonín. On Finite Representations of Infinite-State Behaviours. F. Plášil, K.G. Jeffery (Eds.). In Proceedings of 24th Seminar on Current Trends in Theory and Practice of Informatics (SOFSEM'97). Berlin: Springer, 1997, p. 481-488. Lecture Notes in Computer Science, vol. 1338. ISBN 3-540-63774-5.
      Name (in English): On Finite Representations of Infinite-State Behaviours.
      RIV/00216224:14330/97:00000096 Proceedings paper. Computer hardware and software. English. Germany.
      Keywords in English: concurrency; infinite-state systems; behavioural equivalences
      Changed by: prof. RNDr. Antonín Kučera, Ph.D., učo 2508. Changed: 13/1/2000 11:09.
      More: https://is.muni.cz/publication/190158/en
Displayed: 14/5/2024 10:17