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
2001
-
Universal state inversion and concurrence in arbitrary dimensions
Physical Review A, year: 2001, volume: 64, edition: 4
-
Wigner-function description of quantum teleportation in arbitrary dimensions and continuous limit
Physical Review A, year: 2001, volume: 64, edition: 3
2000
-
Complexity of Weak Bisimilarity and Regularity for BPA and BPP
Expressiveness in Concurrency, EXPRESS'00, year: 2000
-
Constrained Rewrite Transition Systems
Year: 2000, type: R&D Presentation
-
Descriptional issues in quantum computing
Journal of automata and formal languages, year: 2000, volume: 2000, edition: 4
-
Distributed LTL Model-Checking in SPIN
Year: 2000, number of pages: 16 s.
-
Effective Decomposability of Sequential Behaviours.
Theoretical Computer Science, year: 2000, volume: 242, edition: 1-2
-
Efficient Verification Algorithms for One-Counter Processes
Proceedings of 27th International Colloquium on Automata, Languages and Programming (ICALP 2000), year: 2000
-
Entangled webs: Tight bound for symmetric sharing of entanglement
Physical Review A, year: 2000, volume: 62, edition: 05
-
Entangling atoms in photonic crystals
European J. Phys. D, year: 2000, volume: 10, edition: 2