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
1999
-
Pattern Equations and Equations with Stuttering
SOFSEM'99: Theory and Practise of Informatics, year: 1999
-
Regularity of normed PA processes
Information Processing Letters, year: 1999, volume: 72, edition: 1-2
1998
-
A fully abstract semantics for synchronous and asynchronous ccp
Technical Report of Namur University, year: 1998, volume: 1998, edition: 1
-
Bisimilarity of Processes with Finite-State Systems
Proceedings of 25th International Colloquium on Automata, Languages and Programming (ICALP'98), year: 1998
-
Comparing the Classes BPA and BPA with Deadlocks
Technical report, Faculty of Informatics, Masaryk University, Brno, year: 1998, volume: 1998, edition: 05
-
Deadlocking States in Context-Free Process Algebra
Proceedings of the The 23rd International Symposium on Mathematical Foundations of Computer Science (MFCS'98), year: 1998
-
Deciding Bisimulation-Like Equivalences with Finite-State Processes
Technical Report TUM, year: 1998, volume: 1998, edition: TUM-I9805
-
Mathematical Foundations of Computer Science 1998
Year: 1998, number of pages: 846 s.
-
MFCS´98 Workshop on Concurrency, August_27-29,_1998, Brno, Czech Republic : pre-proceedings
FI MU Report Series, year: 1998, volume: 1998, edition: 06
-
Proceedings of the MFCS'98 Workshop on Concurrency
Electronic Notes in Theoretical Computer Science, year: 1998, volume: 1998, edition: Vol.18