Abstract
A logic is introduced, tailored for causality based partial order semantics of non-sequential systems. Properties which are essential for such systems can be formulated in the logic. Technically, the system model we consider is the most fundamental version of Petri Nets. We study a logic for detached runs, which resembles the purposes of Linear Time Temporal Logic for Interleavings.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
R. Carnap: Introduction to Semantics. Harvard University Press, Cambridge, Mass. (1942)
R. Carnap: Meaning and Necessity: A study in Semantics and Modal Logic. The University of Chicago Press, Chicago (1947)
E. Allen Emerson, Edmund M. Clarke: Using Branching Time Temporal Logic to Synthesize Synchronization Skeletons. Science of Computer Programming 2, pp. 241–266 (1982)
E. Allen Emerson, Joseph Y. Halpern: “Sometimes” and “Not Never” Revisited: On Branching Versus Linear Time. ACM Symposium on Principles of Programming Languages 1983, pp. 127–140
P. Enjalbert, M. Michel: Many Sortet Temporal Logic For Multi-Processes Systems.
Hartmann J. Genrich: Net Models of Dynamically Evolving Data Structures. in: Concurrency and Nets, K. Voss, H. Genrich, G. Rozenberg (Eds.), Springer-Verlag, pp. 201–216 (1987)
Susanne Graf: On Lamport's Comparison between Linear and Branching Time Temporal Logic. R.A.I.R.O Informatique théoriique, vol. 18, n.4 (1984)
Shmuel Katz, Doron Peled: Interleaving Set Temporal Logic Proceedings of the ACM Symposium on Principles of Distributed Computation, Vancouver, B.C., August 1987
Fred Kröger: Temporal Logic of Programs. EATCS Monographs on Theoretical Computer Science Vol. 8, Springer-Verlag (1987)
Leslie Lamport: ”Sometime” is sometimes ”Not Never”. On the Temporal Logic of Programs. 7th Annual ACM Symp. on Principles of Programming Languages, pp. 174–185 (1980)
Leslie Lamport: What Good is Temporal Logic? Information Processing 83, R.E.A. Mason (ed.) North-Holland, IFIP, pp. 657–667 (1983)
K. Lodaya, P. S. Thiagarajan: A Modal Logic for a Subclass of Event Structures. 14th ICALP, Lecture Notes in Computer Science 267, Springer-Verlag pp. 290–303 (1987)
Zohar Manna, Amir Pnueli: Verification of Concurrent Programs: Temporal Proof Principles. Proceedings of the Workshop on Logic of Programs. D. Kozen (ed.), N.Y. Springer-Verlag, Lecture Notes in Computer Science 131, pp. 200–252 (1981)
Zohar Manna, Pierre Wolper: Synthesis of Communicating Processes from Temporal Logic Specifications. ACM Transactions on Programming Languages and Systems, Vol. 6 No 1 pp. 68–93 (1984)
Mogens Nielsen, Gordon Plotkin, Glynn Winskel: Petri Nets, Event Structures and Domains, Part I. Theoretical Computer Science Vol. 13, No 1, pp. 85–108 (1980)
Shlomil S. Pinter, Pierre Wolper: A Temporal Logic of Reasoning about Partially Ordered Computations. Proceedings of the third ACM Symposium on Principles of Distributes Computing, Vancouver, Canada, pp. 28–37 (1984)
Wolfgang Reisig: Towards a Temporal Logic for True Concurrence, Part I: Linear Time Propositional Logic. Arbeitspapiere der GMD 277 (1987)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Reisig, W. (1988). Temporal logic and causality in concurrent systems. In: Vogt, F.H. (eds) CONCURRENCY 88. CONCURRENCY 1988. Lecture Notes in Computer Science, vol 335. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-50403-6_37
Download citation
DOI: https://doi.org/10.1007/3-540-50403-6_37
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-50403-0
Online ISBN: 978-3-540-45999-6
eBook Packages: Springer Book Archive