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
2002
-
Using Assumptions to Distribute CTL Model Checking
1st International Workshop on Parallel and Distributed Model Checking (PDMC 2002), year: 2002
-
Using Assumptions to Distribute CTL Model Checking
Year: 2002
-
Using verified property to partition the state space in LTL model-checking
F. Cassez, C. Jard, F. Laroussinie, and M.D. Ryan (Eds.): Modelling and Verification of Parallel processes, year: 2002
-
Weak Bisimilarity between Finite-State Systems and BPA or normed BPP is Decidable in Polynomial Time
Theoretical Computer Science, year: 2002, volume: 270, edition: 1-2
-
Why is Simulation Harder Than Bisimulation?
Proceedings of 13th International Conference on Concurrency Theory (CONCUR 2002), year: 2002
-
YAHODA: verification tools database
Proceedings of Tools Day, year: 2002
2001
-
`The no-signaling condition and quantum dynamics
Physical Review Letters, year: 2001, volume: 87, edition: 17
-
A Comparison of Algorithms for Normed BPA Processes - An Experimental Performance Evaluation
Year: 2001, number of pages: 13 s.
-
Basic Process Algebra with Deadlocking States
Theoretical Computer Science, year: 2001, volume: 2001, edition: 266(1-2)
-
Deciding Bisimulation-Like Equivalences with Finite-State Processes
Theoretical Computer Science, year: 2001, volume: 258, edition: 1-2