An Epistemic Predicate CTL* for Finite Control π-Processes

  • Authors:

  • Dimitar P. Guelev;Mads Dam

  • Affiliations:

  • Institute of Mathematics and Informatics, Bulgarian Academy of Sciences, Sofia, Bulgaria;School of Computer Science and Communication, Royal Institute of Technology, Stockholm, Sweden

  • Venue:
  • Electronic Notes in Theoretical Computer Science (ENTCS)
  • Year:
  • 2011

Quantified Score

Hi-index 0.01

Visualization

Abstract

We examine model checking of finite control @p-calculus processes against specifications in epistemic predicate CTL*. In contrast to branching time settings such as CTL or the modal @m-calculus, the general problem, even for LTL, is undecidable, essentially because a process can use the environment as unbounded storage. To circumvent this problem attention is restricted to closed processes for which internal communication along a given set of known channels is observable. This allows to model processes operating in a suitably memory-bounded environment. We propose an epistemic predicate full CTL* with perfect recall which is interpreted on the computation trees defined by such finite control @p-calculus processes. We demonstrate the decidability of model-checking by a reduction to the decidability of validity in quantified full propositional CTL*.