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
2003
-
Succintness in quantum information processing
Proceedings of DCFS Conference, year: 2003
-
The Complexity of Bisimilarity-Checking for One-Counter Processes
Theoretical Computer Science, year: 2003, volume: 304, edition: 1-3
-
To Store or Not To Store
Computer Aided Verification (CAV 2003), year: 2003
-
Undecidability of Domino Games and Hhp-Bisimilarity
Information and Computation, year: 2003, volume: 184, edition: 2
-
Undecidability of Weak Bisimilarity for PA-Processes
Proceedings of 6th International Conference on Developments in Language Theory (DLT'02),, year: 2003
-
Using Assumptions to Distribute Alternation Free mu-Calculus Model Checking
2st International Workshop on Parallel and Distributed Model Checking (PDMC 2003), year: 2003
-
Using Assumptions to Distribute Model Checking
Počítačové Architektury & Diagnostika, year: 2003
-
Verification of COMBO6 VHDL Design
Year: 2003, type: R&D Presentation
-
Visual Specification of Concurrent Systems
18th IEEE International Conference on Automated Software Engineering, year: 2003
-
Vyhledávání v IPv6 směrovači implementovaném v hradlovém poli
EurOpen, Sborník příspěvků XXIII. konference, year: 2003