Model checking EGF on basic parallel processes

Authors:
Hongfei Fu
Affiliations:
RWTH Aachen University, Aachen, Germany
Venue:
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
Year:
2011

Citing 5
Cited 0

Petri nets, commutative context-free grammars, and basic parallel processes

Fundamenta Informaticae
Interval diagram techniques for symbolic model checking of Petri nets

DATE '99 Proceedings of the conference on Design, automation and test in Europe
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
Weak Bisimulation and Model Checking for Basic Parallel Processes

Proceedings of the 16th Conference on Foundations of Software Technology and Theoretical Computer Science
Recurrent Reachability Analysis in Regular Model Checking

LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we study the problem of model checking the logic EGF over Basic Parallel Processes (BPP). The logic EGF is obtained by extending the logic EF with the CTL* notation EGF, which means that there exists an infinite path on which there are infinitely many entries satisfying certain property. We prove that this problem is PSPACE-complete, and Σdp-complete for certain classes of fixed formula with the nesting depth d of modal operators.