Veriication and Reenement of Action Contracts
نویسندگان
چکیده
Action contracts are a formalism for describing an interactive system as a game between two coalitions of agents. A basic contract statement, involving choice points for the diierent agents, is repeatedly executed as an atomic operation (modeled as a monotonic predicate transformer). The possible executions can be described as an alternating tree which in turn can be analysed using a generalisation of traditional predicate transformer reasoning. We describe the details of this game tree semantics for action contracts and show how it supports reasoning about temporal properties of systems, as well as reenement.
منابع مشابه
Modular veri cation of Argos Programs
Synchronous languages have been proposed to specify reac-tive Real-Time systems. Since such systems are used in safety critical areas , their formal veriication is crucial. For machine and human eeciency, modular veriication is advisable. For the synchronous language Argos, a Statechart variant, modular veriication means having a method compatible with parallel composition and reenement. We pre...
متن کاملOn Veriication of Reenements of Asynchronous Timed Distributed Algorithms
This work is an attempt to apply Gurevich Abstract State Machines methodology to the veriication of reenements of real-time distributed asynchronous algorithms. If to deene the reenement following the semantical framework of observability, that seems to be reasonable, the reenement of timed programs is not a simple replacement of a part of a program by its detalization. As an example to illustr...
متن کاملIncremental Veriication Techniques with Error Trace Traversal Reenement for Abstraction-based 8ctl Model Checking
A paradigm for abstraction/reenement in 8CTL model checking is presented. The abstraction considered is to model the system with a proper subset of the next state functions, yielding an upper bound on the system transition relation. Since negative conclusions can thus be false, the included subset must be enlarged to \resolve" the false negative. We solve the problem of nding the bounded number...
متن کاملThe Kiv - Approach to Software Veri cation ? Wolfgang
This paper presents a particular approach to the design and veriication of large sequential systems. It is based on structured algebraic speciications and stepwise reenement by program modules. The approach is implemented in Kiv (Karlsruhe Interactive Veriier), and supports the entire design process starting from formal speciications and ending with veriied code. Its main characteristics are a ...
متن کاملAction Re nement - An Application of Process Theory onObject - Oriented Speci
In hierarchical system design, reenement allows to incrementally increase the level of detail in the system description. Several notions of reenement have been investigated in process theory and in object-oriented frameworks. From a process algebraic viewpoint, an object as the basic unit of structure and control can be understood as a process. Then action reiication-the replacement of actions ...
متن کامل