A logical view of composition and refinement

We define two logics of safety specifications for reactive systems. The Iogics provide a setting for the stud y of composition and refinement rules, and a framework for the use of the modular specification methods that these rules underpin. The two logics arise naturally from extant specification approaches; one of the logics is intuitionistic, while the other one is linear.

[1]  Amir Pnueli,et al.  In Transition From Global to Modular Temporal Reasoning about Programs , 1989, Logics and Models of Concurrent Systems.

[2]  David N. Yetter,et al.  Quantales and (noncommutative) linear logic , 1990, Journal of Symbolic Logic.

[3]  M. Hennessy,et al.  Finite conjunctive nondeterminism , 1987 .

[4]  Eugene W. Stark,et al.  A Proof Technique for Rely/Guarantee Properties , 1985, FSTTCS.

[5]  Amir Pnueli,et al.  Now you may compose temporal logic specifications , 1984, STOC '84.

[6]  Mads Dam,et al.  Relevance logic and concurrent composition , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.

[7]  Martín Abadi,et al.  The existence of refinement mappings , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.

[8]  Narciso Martí-Oliet,et al.  From Petri nets to linear logic , 1989, Mathematical Structures in Computer Science.

[9]  Martín Abadi,et al.  Composing Specifications , 1989, REX Workshop.

[10]  Samson Abramsky,et al.  Domain Theory in Logical Form , 1991, LICS.

[11]  Jean-Yves Girard,et al.  Linear Logic , 1987, Theor. Comput. Sci..

[12]  J. Michael Dunn,et al.  Relevance Logic and Entailment , 1986 .

[13]  Karl R. Abrahamson.  Modal Logic of Concurrent Nondeterministic Programs , 1979, Semantics of Concurrent Computation.

[14]  Nancy A. Lynch,et al.  Hierarchical correctness proofs for distributed algorithms , 1987, PODC '87.

[15]  Leslie Lamport,et al.  Specifying Concurrent Program Modules , 1983, TOPL.

[16]  Amir Pnueli,et al.  On the Development of Reactive Systems , 1989, Logics and Models of Concurrent Systems.

[17]  Leslie Lamport,et al.  What Good is Temporal Logic? , 1983, IFIP Congress.

[18]  K. Mani Chandy,et al.  Proofs of Networks of Processes , 1981, IEEE Transactions on Software Engineering.

[19]  Michael Merritt,et al.  Completeness Theorems for Automata , 1990, REX Workshop.

[20]  Leslie Lamport,et al.  Artificial Intelligence and Language Processing ]acques Cohen Editor a Simple Approach to Specifying Concurrent Systems , 2022 .

[21]  Steven J. Vickers,et al.  Quantales, observational logic and process semantics , 1993, Mathematical Structures in Computer Science.