Most discrete event system models are based on de ning the alphabet set or the set of events as a fundamental concept. In this paper, we take an alternative view of treating the state space as the fundamental concept. We approach the problem of controlling discrete event systems by using predicates and predicate transformers. Predicates have the advantage that they can concisely characterize an...

This paper describes a constraint-based invariant generation technique for proving the validity of safety assertions over the domain of predicate abstraction in an interprocedural setting. The key idea of the technique is to represent each invariant in bounded DNF form by means of boolean indicator variables, one for each predicate p and each disjunct d denoting whether p is present in d or not...

This paper presents the general knowledge, theory and methodology of life management that used in electric power transformer. The paper also discusses the basic failure theory and method to establish failure model of power transformer. Insulation ageing is a problem due to dielectric, chemical, thermal and electro-mechanic stresses, which is highly depending on operational conditions. Life mana...

We develop a notion of predicate transformer and, in particular, the weakest precondition, appropriate for quantum computation. We show that there is a Stone-type duality between the usual state-transformer semantics and the weakest precondition semantics. Rather than trying to reduce quantum computation to probabilistic programming we develop a notion that is directly taken from concepts used ...

The aim of algebraic logic is to compact series of small steps of general logical inference into larger (in)equational steps. Algebraic structures that have proved very useful in this context are modal semirings and modal Kleene algebras. We show that they can also model knowledge and belief logics as well as games without additional effort; many of the standard logical properties are theorems ...

We define a predicate-transformer semantics for an objectoriented language that includes specification constructs from refinement calculi. The language includes recursive classes, visibility control, dynamic binding, and recursive methods. Using the semantics, we formulate notions of refinement. Such results are a first step towards a refinement calculus.

We prove a number of general rules for data reenement of initialised loops. In addition to ordinary (forwards) data reenement we give rules for backwards data reenement, which can be used in certain situations when the ordinary rules are not applicable. We also extend the rules to permit stuttering. This makes the rules applicable in situations where the reened loop performs computation steps w...

An action system framework is a predicate transformer based method for modelling and analysing distributed and reactive systems. The actions are statements in Dijkstra's guarded command language, and their semantics is given by predicate transformers. We extend conventional action systems with a di erential action consisting of a di erential equation and an evolution guard. The semantics is giv...

ion Allows a Clean Proof Markus Müller-Olm and Andreas Wolf 2 ⋆ 1 Universität Dortmund, Fachbereich Informatik, LS V, 44221 Dortmund, Germany [email protected] 2 Christian-Albrechts-Universität, Institut für Informatik und Praktische Mathematik, Olshausenstraße 40, 24098 Kiel, Germany [email protected] Abstract. We prove the correctness of the translation of a prototypic While...

Refinement calculi for imperative programs provide an integrated framework for programs and specifications and allow one to develop programs from specifications in a systematic fashion. The semantics of these calculi has traditionally been defined in terms of predicate transformers and poses several challenges in defining a state transformer semantics in the denotational style. We define a nove...