Project information
Formal verification: algorithms, properties of modelling formalisms amd temporal logics
- Project Identification
- GP201/08/P375
- Project Period
- 1/2008 - 12/2010
- Investor / Pogramme / Project type
-
Czech Science Foundation
- Postdoctoral projects
- MU Faculty or unit
- Faculty of Informatics
- Keywords
- formal verification, model checking, infinite systems, temporal logics
Quality assurance processes based mainly on humans are not
Results
Publications
Total number of publications: 7
2012
-
Almost linear Büchi automata
Mathematical Structures in Computer Science, year: 2012, volume: 22, edition: 2, DOI
2010
-
Decidable Race Condition and Open Coregions in HMSC
Proceedings of the Ninth International Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT 2010), year: 2010
2009
-
Almost Linear Büchi Automata
Proceedings 16th International Workshop on Expressiveness in Concurrency 2009 (EXPRESS'09), year: 2009
-
On Decidability of LTL Model Checking for Process Rewrite Systems
Acta informatica, year: 2009, volume: 46, edition: 1
-
On Decidability of LTL+Past Model Checking for Process Rewrite Systems
Joint Proceedings of the 8th, 9th, and 10th International Workshops on Verification of Infinite-State Systems (INFINITY 2006, 2007, 2008), year: 2009
-
Reachability is decidable for weakly extended process rewrite systems
Information and Computation, year: 2009, volume: 207, edition: 6
2008
-
Petri Nets Are Less Expressive Than State-Extended PA
Theoretical Computer Science, year: 2008, volume: 394, edition: 1-2