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
1997
-
Temporal Synchronous Concurrent Constraint Programming
COTIC 97, 1st Int.Workshop on Contr.programming for time critical systems, year: 1997, number of pages: 16 s.
-
Vzdělání pro informační společnost
RUFIS'97, year: 1997
1996
-
A process Algebra for Synchronous Concurrent Constraint Programming
TR City University, U.K., year: 1996, volume: 1996, edition: 6
-
A process algebra for Synchronous Concurrent Constraint Programming
ALP96: Fifth Int. Conference on Algebraic and Logic Programm, year: 1996, number of pages: 14 s.
-
Bisimilarity is Decidable in the Union of Normed BPA and Normed BPP Processes
Proceedings of 1st International Workshop on Verification of Infinite State Systems (INFINITY'96), year: 1996
-
Comparing Expressibility of Normed BPA and Normed BPP Processes
FI MU Report Series, year: 1996, volume: 1996, edition: RS-96-02
-
How to Parallelize Sequential Processes
FI MU Report Series, year: 1996, volume: 1996, edition: RS-96-05
-
New versions of asks for synchronous communication in concurrent constraint programming
TR City University, U.K., year: 1996, volume: 1996, edition: 3
-
On the Relationship between Sequential and Parallel Compositions in Process Algebras
CSL96 - The 1996 Annual Conference of the European Assoc.., year: 1996, number of pages: 3 s.
-
Regularity is Decidable for Normed BPA and Normed BPP Processes in Polynomial Time.
Proceedings of 23rd Seminar on Current Trends in Theory and Practice of Informatics (SOFSEM´96), year: 1996