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
1996
-
Regularity is Decidable for Normed PA Processes in Polynomial Time
Proceedings of the 16th Conference on Foundations of Software Technology and Theoretical Computer Science (FST&TCS´96), year: 1996
-
Regularity is Decidable for Normed PA Processes in Polynomial Time
FI MU Report Series, year: 1996, volume: 1996, edition: RS-96-01
1995
-
A process algebra for Synchronous Concurrent Constraint Programming
Technical Report of Namur University, year: 1995, volume: 1995, edition: 8
-
Deciding Regularity in Process Algebras
BRICS Report Series, year: 1995, volume: 1995, edition: RS-95-52
-
New versions of Ask and Tell for synchronous communication in CCP
TR City University, U.K., year: 1995, volume: 1995, edition: 10
-
State complexity of SBTA languages.
Proceddings of LATIN´95, year: 1995, number of pages: 12 s.
-
Synchronisation in Scc
ILPS´95, year: 1995, number of pages: 2 s.
1994
-
Fix-point semantics of synchronized systems and correctness of their basic transformationsa.
Procedings of IFIP Congress´94,INFORMATION PROCESSING´94, year: 1994, number of pages: 22 s.
-
Linear logic semantics for Concurrent Prolog
Extensions of Logic Programming, edition: Vyd. 1., year: 1994, number of pages: 12 s.
-
Modal mu-Calculus with Distances
Scripta Fac.Brun., year: 1994, volume: 1994, edition: 23