Departmental Papers (CIS)

Document Type

Conference Paper

Subject Area

CPS Theory

Date of this Version

3-2007

Publication Title

Lecture Notes in Computer Science: Tools and Algorithms for the Construction and Analysis of Systems

Volume

4424

First Page

664

Last Page

678

DOI

10.1007/978-3-540-71209-1_51

Comments

From the 13th International Conference, TACAS 2007, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2007 Braga, Portugal, March 24 - April 1, 2007.

Abstract

For specifying and verifying branching-time requirements, a reactive system is traditionally modeled as a labeled tree, where a path in the tree encodes a possible execution of the system. We propose to enrich such tree models with “jump-edges” that capture observational indistinguishability: for an agent a, an a-labeled edge is added between two nodes if the observable behaviors of the agent a along the paths to these nodes are identical. We show that it is possible to specify information flow properties and partial information games in temporal logics interpreted on this enriched structure. We study complexity and decidability of the model checking problem for these logics. We show that it is PSPACE-complete and EXPTIME-complete respectively for fragments of CTL and μ-calculus-like logics. These fragments are expressive enough to allow specifications of information flow properties such as “agent A does not reveal x (a secret) until agent B reveals y (a password)” and of partial information games.

Permission Statement

The original publication is available at www.springerlink.com

Share

COinS
 

Date Posted: 09 July 2012