Adding partial orders to linear temporal logic

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1243, Issue , 1997, Pages 119-134

  Bhat, Girish ^a   Peled, Doron ^b  

^a North Carolina State University   (United States)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84957880196     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63141-0_9     Document Type: Conference Paper

References (17)

1. 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
2. K. M. Chamdy, L. Lamport, Distributed Snapshots: determining the global state of distributed systems, ACM Transactions on Computer Systems 3 (1985), 63-75.
3. D. Harel, First order Dynamic Logic, Lecture Notes in Computer Science 68, Springer, 1979.
4. S. Katz, D. Peled, Interleaving Set Temporal Logic, Theoretical Computer Science, Vol. 75, Number 3, 21-43
5. S. Katz, D. Peled, Verification of Distributed Programs using Representative Interleaving Sequences, Distributed Computing 6 (1992) 107-120.
6. 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.
7. A. Mazurkiewicz, Trace semantics, in: W. Braner, W. Reisig, G. Rozenberg (eds.) Proceedings of Advances in Petri Nets 1986, Bad Honnef, Lecture Notes in Computer Science 255, Springer, 1987, 279-324.
8. 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.
9. D. Peled, A. Pnueli, Proving partial order properties. Theoretical Computer Science 126, 143-182, 1994.
10. 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.
11. W. Penczek, Temporal Logics for Trace Systems: On Automated Verification, International Journal of Foundations of Computer Science, 4 (1993), 31-67.
12. W. Penczek, R. Kuiper, Traces and Logic, in V. Diekert, G. Rozenberg (eds.) The Book of Traces, World Scientific, 1995, 307-399.
13. S. Pinter, P. Wolper, A temporal logic for reasoning about partially ordered computations, 3rd A CM Symposium on Principles of Distributed Computing, Vancouver, B. C., Canada, August 1984, 23-27.
14. V. Pratt, Modeling concurrency with partial orders, International Journal of Parallel Programming, 15 (1986), 33-71.
15. 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.
16. 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.
17. P.S. Thiagarajan, A Trace Based Extension of Linear Time Temporal Logic. Proceedings of 10th IEEE Logic in Computer Science, 1994.