Adding Partial Orders to Linear Temporal Logic

Fundamenta Informaticae

Volumn 36, Issue 1, 1998, Pages 1-21

  Bhat, Girish ^a,c   Peled, Doron ^b  

^a Make Systems   (United States)

^b LUCENT TECHNOLOGIES   (United States)

^c North Carolina State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0347877336     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: 10.3233/fi-1998-3611     Document Type: Article

References (21)

1. Alur R., Penczek W. and Peled, D.: Model-Checking of Causality Properties, 10th Symposium on Logic in Computer Science, IEEE, 1995, San Diego, California, USA, 90-100.
2. Alur R., McMillan K.L. and Peled, D.: "Deciding global partial-order properties", 25th International Colloquium on Automata, Languages and Programming, Aalborg, Denmark, July, 1998, Lecture Notes in Computer Science 1443, Springer, 41-52.
3. Chandy, K.M., and Lamport L.: Distributed Snapshots: determining the global state of distributed systems, ACM Transactions on Computer Systems 3, 1985, 63-75.
4. Dijkstra E.W.: "Guarded commands, Nondeterminancy and Formal Derivation of Programs", Communication of the ACM, 18, 1975, 453-457.
5. Harel D.: First order Dynamic Logic, Lecture Notes in Computer Science 68, Springer, 1979.
6. Katz S. and Peled D.: "Interleaving Set Temporal Logic", Theoretical Computer Science, 75, 1991, 21-43.
7. Katz S. and Peled D.: "Verification of Distributed Programs using Representative Interleaving Sequences", Distributed Computing 6, 1992, 107-120.
8. Manna Z. and Pnueli A.: "Completing the Temporal Picture", Proceedings 16th International Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science 372, Springer, 1989, 534-558.
9. Mazurkiewicz A.: "Trace theory", 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.
10. Peled D., Katz S. and Pnueli A.: "Specifying and Proving Serializability in Temporal Logic", 6th IEEE annual symposium on Logic in Computer Science, Amsterdam, The Netherlands, July 1991, 232-245.
11. Peled D. and Pnueli A.: "Proving partial order properties", Theoretical Computer Science 126, 1994, 143-182.
12. Peled D., Wilke Th. and Wolper P.: "An Algorithmic Approach for Checking Closure Properties of ω-Regular Languages", 7th International Conference on Concurrency Theory, Pisa, Italy, 1996.
13. Penczek W.: "Temporal Logics for Trace Systems: On Automated Verification", International Journal of Foundations of Computer Science, 4, 1993, 31-67.
14. Penczek W.:
15. "On undecidability of propositional temporal logics on trace systems". Information Processing Letters, 43, 1992, 147-153.
16. Penczek W. and Kuiper R.: "Traces and Logic", in V. Diekert, G. Rozenberg (eds.) The Book of Traces, World Scientific, 1995, 307-390.
17. Pinter S. and Wolper P.: "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.
18. Pratt V.R.: "Modeling concurrency with partial orders", International Journal of Parallel Programming, 15, 1986 , 33-71.
19. Reisig W.: "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.
20. Reisig W.: "Interleaved Progress, Concurrent Progress and Local Progress", in D. Peled, V. Pratt, G. Holzmann (eds.), Partial Order Methods in Verification, American Mathematical Society, 1997, 99-115.
21. Thiagarajan P.S.: "A Trace Based Extension of Linear Time Temporal Logic". Proceedings of 10th IEEE Logic in Computer Science, 1994.