We present a high level speciication and reenement framework for concurrent real-time processes with strict message passing based on predicate transformer semantics. Four diierent parallel operators are deened and we investigate conditions under which they are monotone and associative. Re-nement rules for single process components are derived. We also give rules and strategies for the developme...

We consider the notion of a contract that governs the behavior of a collection of agents. In particular, we study the question of whether a group among these agents can achieve a given goal by following the contract. We show that this can be reduced to studying the existence of winning strategies in a two-person game. We deene a weakest precondition semantics for contract statements that permit...

The invariant based programming is a technique of constructing correct programs by first identifying the basic situations (preand post-conditions and invariants) that can occur during the execution of the program, and then defining the transitions and proving that they preserve the invariants. Data refinement is a technique of building correct programs working on concrete datatypes as refinemen...

Two variants of monadic fuzzy predicate logic are analyzed and compared with the full fuzzy predicate logic with respect to nite model property (properties) and arithmetical complexity of sets of tautologies, satis-able formulas and of analogous notion restricted to nite models.

Our work is a contribution to the model-theoretic study of equality-free fuzzy predicate logics. We give a characterization of elementary equivalence in fuzzy predicate logics using elementary extensions and introduce an strengthening of this notion, the so-called strong elementary equivalence. Using the method of diagrams developed in [5] and elementary extensions we present a counterexample t...

A lattice theoretic framework for the calculus of program reenement is presented. Speciications and program statements are combined into a single (innnitary) language of commands which permits miraculous, angelic and demonic statements to be used in the description of program behavior. The weakest precondition calculus is extended to cover this larger class of statements and a game-theoretic in...

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...

Dagger compact closed categories were recently introduced by Abramsky and Coecke, under the name “strongly compact closed categories”, as an axiomatic framework for quantum mechanics. We present a graphical language for dagger compact closed categories, and sketch a proof of its completeness for equational reasoning. We give a general construction, the CPM construction, which associates to each...

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 ...

A systematic study of the optional maintenance strategies of the Transformer is conducted and a set of general factors which should be considered in the maintenance strategies is established. A Fuzzy Analytic Hierarchy Process (FAHP) based on the goal programming is proposed in view of the defects of the traditional Fuzzy Analytic Hierarchy Process (FAHP), and the specific application process o...