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
2007
-
Height-Deterministic Pushdown Automata
32nd International Symposium on Mathematical Foundations of Computer Science (MFCS'07), year: 2007
2006
-
Monotonic Set-Extended Prefix Rewriting and Verification of Recursive Ping-Pong Protocols
Automated Technology for Verification and Analysis (ATVA'06), year: 2006
-
Undecidability Results for Bisimilarity on Prefix Rewrite Systems
LNCS, Foundations of Software Science and Computation Structures (FOSSACS'06), year: 2006, volume: 2006, edition: 3921
-
Visibly Pushdown Automata: From Language Equivalence to Simulation and Bisimulation
LNCS, Annual Conference on Computer Science Logic (CSL'06), year: 2006, volume: 2006, edition: 4207
2005
-
On Counting the Number of Consistent Genotype Assignments for Pedigrees
Proceedings of 25th International Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'05), year: 2005
2004
-
A General Approach to Comparing Infinite-State Systems with Their Finite-State Specifications
Proceedings of 15th International Conference on Concurrency Theory (CONCUR 2004), year: 2004
-
A Generic Framework for Checking Semantic Equivalences between Pushdown Automata and Finite-State Automata
Exploring New Frontiers of Theoretical Informatics : IFIP 18th World Computer Congress, TC1 3rd International Conference on Theoretical Computer Science (TCS2004), year: 2004
-
Accepting Predecessors are Better than Back Edges in Distributed LTL Model-Checking.
Formal Methods in Computer-Aided Design (FMCAD), year: 2004
-
Accepting Predecessors are Better than Back Edges in Distributed LTL Model-Checking.
Year: 2004, number of pages: 22 s.
-
Completeness Results for Undecidable Bisimilarity Problems
Proccedings of the 5th International Workshop on Verification of Infinite-State Systems (INFINITY'03), year: 2004