From Trace Sets to Modal-Transition Systems by Stepwise Abstract Interpretation
نویسنده
چکیده
Following and expanding upon the philosophy set down by Cousot and Cousot, this tutorial paper uses stepwise abstract interpretation to transform a system’s naive trace-set semantics into a format that is readily analyzable by temporal logic. The abstraction interpretations first transform a concrete trace-set semantics, where the traces are characterized by a state-transition relation, into an abstracted trace-set semantics that uses abstracted states such that linear-time properties are soundly (and in some cases, completely) preserved. Conditions under which universally and existentially quantified linear-time properties are preserved are also stated, and these conditions motivate the universal and existential abstractions of the abstracted trace-set semantics into state-set semantics upon which quantified properties can be soundly and completely checked, producing simple branching-time logics. Finally, the combination of universal and existential quantification in a single logic motivates mixed and modal transition systems, where a concrete system is abstracted by two transition relations, one that abstracts universal behaviors and one that abstracts existential behaviors. The definitions, constructions, and technical results are illustrated by examples.
منابع مشابه
Labelled transition systems as a Stone space
A fully abstract and universal domain model for modal transition systems and refinement, developed in [27], is shown to be a maximal-points space model for the bisimulation quotient of labelled transition systems over a finite set of events. In this domain model we prove that this quotient is a Stone space whose compact, zero-dimensional, and ultra-metrizable Hausdorff topology measures the deg...
متن کاملGenerating Discrete Trace Transition System of a Polyhe-dral Invariant Hybrid Automaton
Supervisory control and fault diagnosis of hybrid systems need to have complete information about the discrete states transitions of the underling system. From this point of view, the hybrid system should be abstracted to a Discrete Trace Transition System (DTTS) and represented by a discrete mode transition graph. In this paper an effective method is proposed for generating discrete mode trans...
متن کاملStates vs. Traces in Model Checking by Abstract Interpretation
In POPL’00, Cousot and Cousot showed that the classical state-based model checking of a very general temporal language called x? μ -calculus is an incomplete abstract interpretation of its trace-based semantics. In ESOP’01, Ranzato showed that the least refinement of the state-based model checking semantics of the x? μ -calculus which is complete w.r.t. its trace-based semantics exists, and it ...
متن کاملIncompleteness of States w.r.t. Traces in Model Checking
Cousot and Cousot introduced and studied a general temporal specification language, called x μ -calculus, featuring a natural time-symmetric trace-based semantics. The classical state-based model checking of the x μ -calculus is an abstract interpretation of its trace-based semantics, which turns out to be incomplete (i.e., trace-incomplete), even for finite systems. This paper shows that any r...
متن کاملConstraint-Based Abstraction of a Model Checker for Infinite State Systems
Abstract interpretation-based model checking provides an approach to verifying properties of infinite-state systems. In practice, most previous work on abstract model checking is either restricted to verifying universal properties, or develops special techniques for temporal logics such as modal transition systems or other dual transition systems. By contrast we apply completely standard techni...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001