A Logical View of Composition

Abstract We define two logics of safety specifications for reactive systems. The logics provide a setting for the study of composition rules. The two logics arise naturally from extant specification approaches; one of the logics is intuitionistic, while the other one is linear.

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

[2]  M. Nivat Fiftieth volume of theoretical computer science , 1988 .

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

[4]  Patrick Lincoln,et al.  Linear logic , 1992, SIGA.

[5]  Martín Abadi,et al.  A logical view of composition and refinement , 1991, POPL '91.

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

[7]  José Meseguer,et al.  From Petri Nets to Linear Logic , 1989, Category Theory and Computer Science.

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

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

[10]  A. Joyal,et al.  An extension of the Galois theory of Grothendieck , 1984 .

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

[12]  Rocco De Nicola,et al.  Testing Equivalences for Processes , 1984, Theor. Comput. Sci..

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

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

[15]  K. I. Rosenthal Quantales and their applications , 1990 .

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

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

[18]  Matthew Hennessy,et al.  Full Abstraction for a Simple Parallel Programming Language , 1979, MFCS.

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

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

[21]  Grzegorz Rozenberg,et al.  Stepwise Refinement of Distributed Systems Models, Formalisms, Correctness , 1989, Lecture Notes in Computer Science.

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

[23]  Matthew Hennessy,et al.  Algebraic theory of processes , 1988, MIT Press series in the foundations of computing.

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

[25]  Brian A. Davey,et al.  An Introduction to Lattices and Order , 1989 .

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

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

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