A Unified Approach for Studying the Properties of Transition Systems

Abstract In this paper a systematic method for generating, comparing and proving the properties of transition systems is presented. It is assumed that any property of a system can be defined by giving a set of ‘target’ states and a type of reachability. Ten different types of reachability are proposed; by appropriately choosing the set of target states, a family of ten potentially different properties is generated. The main conclusion is that the reachability types and therefore the system properties, can be characterized by simple relations involving the set of the possible initial states and fixed points of certain continuous predicate trasformers depending on the set of target states. As a consequence, in order to prove a given property it is sufficient to compute iteratively greatest or least fixed points of continuous predicate transformers. Some examples are presented which show how the results can be applied to prove the properties of concurrent systems represented by non-deterministic models.

[1]  Zohar Manna,et al.  The Modal Logic of Programs , 1979, ICALP.

[2]  A. Pnueli.  The Temporal Semantics of Concurrent Programs , 1979, Theor. Comput. Sci..

[3]  Edsger W. Dijkstra,et al.  Self-stabilizing systems in spite of distributed control , 1974, CACM.

[4]  A. Tarski.  A LATTICE-THEORETICAL FIXPOINT THEOREM AND ITS APPLICATIONS , 1955 .

[5]  C. A. R. Hoare,et al.  Some Properties of Predicate Transformers , 1978, JACM.

[6]  Patrick Cousot,et al.  Systematic design of program analysis frameworks , 1979, POPL.

[7]  Edsger W. Dijkstra,et al.  A Discipline of Programming , 1976 .

[8]  Joseph Sifakis,et al.  Le contrôle des systèmes asynchrones : concepts, propriétés, analyse statique , 1979 .

[9]  Leslie Lamport,et al.  "Sometime" is sometimes "not never": on the temporal logic of programs , 1980, POPL '80.

[10]  W. P. Roever.  Dijkstra's Predicate Transformer, Non-Determinism, Recursion and Termination , 1976, MFCS.

[11]  Robert M. Keller,et al.  Formal verification of parallel programs , 1976, CACM.

[12]  Yat-Sang Kwong.  On the Absence of Livelocks in Parallel Programs , 1979, Semantics of Concurrent Computation.

[13]  Joseph Sifakis,et al.  Deadlocks and Livelocks in Transition Systems , 1980, MFCS.

[14]  Alfred Tarski,et al.  Relational selves as self-affirmational resources , 2008 .

[15]  Edmund M. Clarke.  Synthesis of Resource Invariants for Concurrent Programs , 1980, TOPL.

[16]  Pedro Guerreiro,et al.  Relational Semantics of Strongly Communicating Sequential Processes , 1981, ICFPC.

[17]  Nicolas Halbwachs,et al.  Automatic discovery of linear restraints among variables of a program , 1978, POPL.

[18]  Barry K. Rosen,et al.  Correctness of Parallel Programs: The Church-Rosser Approach , 1976, Theor. Comput. Sci..

[19]  James L. Peterson,et al.  Petri Nets , 1977, CSUR.

[20]  Pedro Guerreiro,et al.  A Relational Model for Non-Deterministic Programs and Predicate Transformers , 1980, Symposium on Programming.

[21]  Edsger W. Dijkstra,et al.  Guarded commands, nondeterminacy and formal derivation of programs , 1975, Commun. ACM.

[22]  Joseph Sifakis,et al.  Iterative Methods for the Analysis of Petri Nets , 1980, Selected Papers from the First and the Second European Workshop on Application and Theory of Petri Nets.

[23]  David Harel,et al.  On folk theorems , 1980, CACM.

[24]  Edsger W. Dijkstra,et al.  Solution of a problem in concurrent programming control , 1965, CACM.

[25]  Y. S. Kwong,et al.  On Reduction of Asynchronous Systems , 1977, Theor. Comput. Sci..

[26]  Michel Hack,et al.  ANALYSIS OF PRODUCTION SCHEMATA BY PETRI NETS , 1972 .