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
2002
-
Entangled graphs
Quantum Information and Computing, year: 2002, volume: 2, edition: Special
-
Equivalence-Checking with Infinite-State Systems: Techniques and Results.
Proceedings of 29th Conference on Current Trends in Theory and Practice of Informatics (SOFSEM 2002), year: 2002
-
Equivalence-Checking with One-Counter Automata: A Generic Method for Proving Lower Bounds
Proceedings of 5th International Conference on Foundations of Software Science and Computation Structures (FOSSACS 2002), year: 2002
-
Experimental realization of the quantum universal NOT gate
Nature, year: 2002, volume: 419, edition: 24 Oct
-
How to distribute LTL model-checking using decomposition of negative claim automaton
SOFSEM 2002 Student Research Forum Proceedings, year: 2002
-
Implementation of quantum maps by programmable quantum processors
Physical Review A, year: 2002, volume: 66, edition: 04
-
Infinity 2002. 4th International Workshop on Verification of Infinite-State Systems
Year: 2002, number of pages: 106 s.
-
INFINITY 2002. 4th International Workshop on Verification of Infinite-State Systems
Year: 2002, type: Workshop
-
Local Distributed Model Checking of RegCTL
PDMC 2002 Parallel and Distributed Model Checking, year: 2002
-
Modifications of Expansion Trees for Weak Bisimulation in BPA
Verification of Infinite-State Systems Infinity'2002, year: 2002