Abstract. We study property preserving transformations for reactive systems. The main idea is the use of simulationsparameterized by Galois connections( ), relating the lattices of properties of two systems. We propose and study a notion of preservation of properties expressed by formulas of a logic, by a function mapping sets of states of a system S into sets of states of a system S'. We g i v e results on the preservation of properties expressed in sublanguages of the branching time -calculus when two systems S and S' are related via h i-simulations. They can be used to verify a property for a system by v erifying the same property on a simpler system which i s a n abstraction of it. We s h o w also under which conditions abstraction of concurrent systems can be computed from the abstraction of their components. This allows a compositional application of the proposed veri cation method. This is a revised version of the papers 2] and 16] the results are fully developed in 27].
We study property preserving transformations for reactive systems. A key idea is the use of ~ ~o, ~ ~-simulations which are simulations parameterized by a Galois connection (~, ~b), relating the lattices of properties of two systems. We propose and study a notion of preservation of properties expressed by formulas of a logic, by a function ~0 mapping sets of states of a system S into sets of states of a system S'. Roughly speaking, ~a preserves f if the satisfaction of f at some state of S implies that f is satisfied by any state in the image of this state by ~. The main results concern the preservation of properties expressed in sublauguages of the branching time p-calculus when two systems • and S' are related via < ~0, ~b >-simulations. They can be used in particular to verify a property for a system by proving this property on a simpler system which is an abstraction of it.
~,Ve give the description of a verification tool taking boolean programs of guarded commands as input; internal representation of programs are sets of Binary Decision Diagrams (BDD) (one for each guarded command). It allows to construct an abstract program of the same form obtained using an abstraction relation given by a boolean expression on "concrete" and "abstract" ~riables. The tool allows the verification of CTL formulas on programs. Vv'e illustrate its possibilities on an example.
We study property preserving transformations for reactive systems. A key idea is the use of e-slmulations which are simulations parametrized by a relation 6, relating the domains of two systems. We particularly address the problem of property preserving abstractions of composed programs. For a very general notion of parallel composition, we give the conditions under which simulation is a precongruence for parallel composition and we study which kind of global properties are preserved by these abstractions.
ASTRA is a security analysis method based on the systematic collection and analysis of security relevant information to detect inconsistencies and assess residual risks. ASTRA can accommodate organizational as well as technical aspects of security and it can be applied to innovative products for which no security data (e.g. vulnerability or attack database) is available. In addition, ASTRA explicitly deals with the notion of responsibility and naturally leads to an iterative refinement approach. This paper provides an introduction to the method and comparison with related work.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.