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
1999
-
A Logical Viewpoint on Process-Algebraic Quotients
Computer Science Logic; Proceedings of 8th Annual Conference of the EACSL (CSL´99), year: 1999
-
Approximating Weak Bisimulation on Basic Process Algebras
Mathematical Foundations of Computer Science 1999, Proceedings, year: 1999
-
Approximating Weak Bisimulation on Basic Process Algebras
Year: 1999, number of pages: 18 s.
-
Comparing Expressibility of Normed BPA and Normed BPP Processes.
Acta informatica, year: 1999, volume: 36, edition: 3
-
Complexity Issues of the Pattern Equations in Idempotent Semigroups
Technical Report, Faculty of Informatics, Masaryk University, year: 1999, volume: 1999, edition: 02
-
Numerical simulations of fundamental processes in cavity QED: Atomic decay
Physical Review A, year: 1999, volume: 60, edition: 1
-
On Finite Representations of Infinite-State Behaviours.
Information Processing Letters, year: 1999, volume: 70, edition: 1
-
On the Pattern Equations
Technical Report, Faculty of Informatics, Masaryk University, year: 1999, volume: 1999, edition: 01
-
Optimal encoding of phase information into trapped ions
Acta physica slovaca, year: 1999, volume: 49, edition: 2
-
Optimal manipulations wih qubits: Universal NOT gate
Physical Review A, year: 1999, volume: 60, edition: 4