Abstract
Modeling execution as partial orders increases the flexibility in reasoning about concurrent programs by allowing the use of alternative, equivalent execution sequences. This is a desirable feature in specifying concurrent systems which allows formalizing frequently used arguments such as ‘in an equivalent execution sequence’, or ‘in a consistent global state, not necessarily on the execution sequence’ to be formalized. However, due to the addition of structure to the model, verification of partial order properties is non-trivial and sparse. We present here a new approach which allows expressing and verifying partial order properties. It is based on modeling an execution as a linear sequence of global states, where each state is equipped with its past partial-order history. The temporal logic BPLTL (for Branching Past Linear Temporal Logic) is introduced. We provide a sound and relatively complete proof system for the logic BPLTL over transitions programs. Our proof system augments an existing proof system for LTL.
Preview
Unable to display preview. Download preview PDF.
References
R. Alur W. Penczek, D. Peled, Model-Checking of Causality Properties, 10th Symposium on Logic in Computer Science, IEEE, 1995, 90–100, San Diego, California, USA.
K. M. Chandy, L. Lamport, Distributed Snapshots: determining the global state of distributed systems, ACM Transactions on Computer Systems 3 (1985), 63–75.
D. Harel, First order Dynamic Logic, Lecture Notes in Computer Science 68, Springer, 1979.
S. Katz, D. Peled, Interleaving Set Temporal Logic, Theoretical Computer Science, Vol. 75, Number 3, 21–43
S. Katz, D. Peled, Verification of Distributed Programs using Representative Interleaving Sequences, Distributed Computing 6 (1992) 107–120.
Z. Manna, A. Pnueli, Completing the Temporal Picture, Proceedings 16th International Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science 372, Springer, 1989, 534–558.
A. Mazurkiewicz, Trace semantics, in: W. Brauer, W. Reisig, G. Rozenberg (eds.) Proceedings of Advances in Petri Nets 1986, Bad Honnef, Lecture Notes in Computer Science 255, Springer, 1987, 279–324.
D. Peled, S. Katz, A. Pnueli, Specifying and Proving Serializability in Temporal Logic, 6th IEEE annual symposium on Logic in Computer Science, Amsterdam, The Netherlands, July 1991, 232–245.
D. Peled, A. Pnueli, Proving partial order properties. Theoretical Computer Science 126, 143–182, 1994.
D. Peled, Th. Wilke, P. Wolper, An Algorithmic Approach for Checking Closure Properties of ω-Regular Languages, CONCUR'96, 7th International Conference on Concurrency Theory, Pisa, Italy, 1996.
W. Penczek, Temporal Logics for Trace Systems: On Automated Verification, International Journal of Foundations of Computer Science, 4 (1993), 31–67.
W. Penczek, R. Kuiper, Traces and Logic, in V. Diekert, G. Rozenberg (eds.) The Book of Traces, World Scientific, 1995, 307–390.
S. Pinter, P. Wolper, A temporal logic for reasoning about partially ordered computations, 3rd ACM Symposium on Principles of Distributed Computing, Vancouver, B. C., Canada, August 1984, 23–27.
V. Pratt, Modeling concurrency with partial orders, International Journal of Parallel Programming, 15 (1986), 33–71.
W. Reisig, Partial order semantics versus interleaving semantics for CSP like languages and its impact on fairness. Proc. 11th International Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science 172, 1984, Springer, 403–413.
W. Reisig, Interleaved Progress, Concurrent Progress and Local Progress, in D. Peled, V. Pratt, G. Holzmann (eds.), Partial Order Methods in Verification, AMS, to appear, 1997.
P.S. Thiagarajan, A Trace Based Extension of Linear Time Temporal Logic. Proceedings of 10th IEEE Logic in Computer Science, 1994.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bhat, G., Peled, D. (1997). Adding partial orders to linear temporal logic. In: Mazurkiewicz, A., Winkowski, J. (eds) CONCUR '97: Concurrency Theory. CONCUR 1997. Lecture Notes in Computer Science, vol 1243. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63141-0_9
Download citation
DOI: https://doi.org/10.1007/3-540-63141-0_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63141-5
Online ISBN: 978-3-540-69188-4
eBook Packages: Springer Book Archive