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
2004
-
How to Formalize FPGA Hardware Design
Year: 2004, type: R&D Presentation
-
Improving performance of probabilistic programmable quantum processors
Physical Review A, year: 2004, volume: 69, edition: 042311
-
International Journal of Quantum Information: Special issue on Erato conference EQUIS'03 vol. 2
Year: 2004, number of pages: 147 s.
-
Lower and Upper Bounds in Zone Based Abstractions of Timed Automata
Tools and Algorithms for Construction and Analysis of Systems (TACAS 2004), year: 2004
-
Model Checking Probabilistic Pushdown Automata
Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science (LICS 2004), year: 2004
-
On Extensions of Process Rewrite Systems: Rewrite Systems with Weak Finite-State Unit
INFINITY'2003: 5th International Workshop on Verification of Infinite-State Systems, year: 2004
-
On the Computational Complexity of Bisimulation, Redux
Information and Computation, year: 2004, volume: ?, edition: ?
-
On the Expressive Power of Extended Process Rewrite Systems
BRICS Report Series, year: 2004, volume: 2004, edition: RS-04-7
-
Optimal time and communication solutions of FSSP on square arrays, toruses and rings
Lecture Notes in Computer Science, year: 2004, volume: 2006, edition: 3340
-
Parallel Model-Checking
ERCIM News, year: 2004, volume: 58, edition: June