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: 263
2004
-
Controlling bipartite entanglement in multi-qubit systems
Journal of Physics A, year: 2004, volume: 37, edition: -
-
Deciding Probabilistic Bisimilarity Over Infinite-State Probabilistic Systems
Proceedings of 15th International Conference on Concurrency Theory (CONCUR 2004), year: 2004
-
Distributed Memory LTL Model Checking Based on Breadth First Search
Year: 2004, number of pages: 57 s.
-
Distributed Negative Cycle Detection Algorithms
Parallel Computing: Software Technology, Algorithms, Architectures & Applications, year: 2004
-
Distributed Partial Order Reduction of State Spaces
Proceedings of the 3rd International Workshop on Parallel and Distributed Verifationic (PDMC 2004), year: 2004
-
DP lower bounds for equivalence-checking and model-checking of one-counter automata
Information and Computation, year: 2004, volume: 188, edition: 1
-
Extended Process Rewrite Systems: Expressiveness and Reachability
CONCUR 2004 - Concurrency Theory, year: 2004
-
From Distributed Memory Cycle Detection to Parallel LTL Model Checking
Proceedings of the Ninth International Workshop on Formal Methods for Industrial Critical Systems (FMICS 2004), year: 2004
-
Hardware Router's Lookup Machine and its Formal Verification
ICN'2004 Conference Proceedings, year: 2004
-
Highly Undecidable Questions for Process Algebras
Proceedings of 3rd IFIP International Conference on Theoretical Computer Science (TCS'04), year: 2004