Project information
Algorithmic Verification Boundaries for Infinite-State Systems
- Project Identification
- GA201/97/0456
- Project Period
- 1/1997 - 12/1999
- Investor / Pogramme / Project type
-
Czech Science Foundation
- Standard Projects
- MU Faculty or unit
- Faculty of Informatics
- Project Website
- http://www.fi.muni.cz/usr/kretinsky/projects/GACR201970456.html
- Cooperating Organization
-
Technical University Ostrava
- Responsible person prof. RNDr. Petr Jančar, CSc.
The project is motivated by a live current research area concerning analysis and verification of complex (infinite state) concurrent systems It is the area of boundaries for algorithmic verification, where verification means checking equivalencies of sys tems, their temporal logic properties etc. Recently, several interesting results have been obtained in the given area, e.g. for calculi BPA, BPP, and Petri nets, to which also the grant of the Czech Grant Agency, No. 201/93/2123, has contributed. The ma
Publications
Total number of publications: 28
2001
-
Deciding Bisimulation-Like Equivalences with Finite-State Processes
Theoretical Computer Science, year: 2001, volume: 258, edition: 1-2
-
Puzzles, mysteries and power of quantum entanglement
Year: 2001, number of pages: 44 s.
2000
-
Effective Decomposability of Sequential Behaviours.
Theoretical Computer Science, year: 2000, volume: 242, edition: 1-2
-
Quantum computing challenges
Maathematics unlimited, 2001 and beyond, edition: Vyd. 1, year: 2000, number of pages: 35 s.
-
Simulation and Bisimulation over One-Counter Processes
Proceedings of 17th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2000), year: 2000
1999
-
A Fully Abstract Semantics for a Version of Synchronous Concurrent Constraint Programming
FI MU Report Series, year: 1999, volume: 1999, edition: 08
-
A Logical Viewpoint on Process-Algebraic Quotients
Computer Science Logic; Proceedings of 8th Annual Conference of the EACSL (CSL´99), year: 1999
-
Comparing Expressibility of Normed BPA and Normed BPP Processes.
Acta informatica, year: 1999, volume: 36, edition: 3
-
Complexity Issues of the Pattern Equations in Idempotent Semigroups
Technical Report, Faculty of Informatics, Masaryk University, year: 1999, volume: 1999, edition: 02
-
On the Pattern Equations
Technical Report, Faculty of Informatics, Masaryk University, year: 1999, volume: 1999, edition: 01