Project information
Non-sequential Models of Computing -- Quantum and Concurrent Distributed Models of Computing
- Project Identification
- MSM 143300001
- Project Period
- 1/1999 - 12/2004
- Investor / Pogramme / Project type
-
Ministry of Education, Youth and Sports of the CR
- Research Intents
- MU Faculty or unit
- Faculty of Informatics
- Keywords
- concurrency;process algebras; infinite state systems; real-time; modal and temporal logics;concurrent constraint systems;specification;verification;quantum algorithms and protocols;entanglement;quantum finite and cellular automata;design methodologies
Aim: Importance of non-sequential models of computing grows both from theoretical and practical point of view. The aim of this proposal for a long-term research is on one side the continuation of the already well established and successful research in the area of concurrent, distributed and parallel systems and on the other side the extension of the scope of the research into the area of quantum computing. Scope: Analysis of models of concurrency and of their mutual relations with the emphasis on decision, algorithmic and complexity problems. Analysis of models and the development of specification and transformation tools for real-time concurrent systems with emphasis on safety-critical systems. Logics, especially temporal and modal, for specification and analysis of concurrent and distributed systems. Design and analysis of quantum algorithms and development of methods for design of quantum algorithms and protocols, as well as for quantum finite automata and quantum cellular automata.
Results
The aim of this proposal for a long-term research is on one side the continuation of the already well established and successful research in the area of concurrent, distributed and parallel systems and on the other side the extension of the scope of the research into the area of quantum computing.
Publications
Total number of publications: 265
1998
-
Bisimilarity of Processes with Finite-State Systems
Proceedings of 25th International Colloquium on Automata, Languages and Programming (ICALP'98), year: 1998
-
Comparing the Classes BPA and BPA with Deadlocks
Technical report, Faculty of Informatics, Masaryk University, Brno, year: 1998, volume: 1998, edition: 05
-
Deadlocking States in Context-Free Process Algebra
Proceedings of the The 23rd International Symposium on Mathematical Foundations of Computer Science (MFCS'98), year: 1998
-
Deciding Bisimulation-Like Equivalences with Finite-State Processes
Technical Report TUM, year: 1998, volume: 1998, edition: TUM-I9805
-
Mathematical Foundations of Computer Science 1998
Year: 1998, number of pages: 846 s.
-
MFCS´98 Workshop on Concurrency, August_27-29,_1998, Brno, Czech Republic : pre-proceedings
FI MU Report Series, year: 1998, volume: 1998, edition: 06
-
Proceedings of the MFCS'98 Workshop on Concurrency
Electronic Notes in Theoretical Computer Science, year: 1998, volume: 1998, edition: Vol.18
-
Weak Bisimilarity with Infinite-State Systems can be Decided in Polynomial Time
Technical Report TUM, year: 1998, volume: 1998, edition: TUM-I9830
1997
-
Adding Time via Timed Transitions to Concurrent Constraint Programming
ERCIM/COMPULOG Workshop, year: 1997, number of pages: 12 s.
-
Adjusting informatics education to Information era.
Foundations of Computer Science, year: 1997, number of pages: 20 s.