On projective and separable properties

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

Volumn 787 LNCS, Issue , 1994, Pages 291-307

  Peled, Doron ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FORESTRY; TEMPORAL LOGIC;

BOOLEAN COMBINATIONS; CARTESIAN PRODUCTS; COMPONENT LANGUAGE; LINEAR TEMPORAL LOGIC; SPECIFICATION AND VERIFICATION;

ALGEBRA;

EID: 85010991965     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0017489     Document Type: Conference Paper

References (27)

1. M. Abadi, L. Lamport, P. Wolper, Realizable and Unrealizable Concurrent Program Specifications, ICALP 1989, LNCS 372, Springer-Verlag, 1-17.
2. Y. Afek, G. M. Brown, M. Merritt, Lazy Caching, ACM Transactions on Programming Languages and Systems 15 (1993), 182-205.
3. K. Apt, N. Francez, S. Katz, Appraising fairness in languages for distributed programming, Distributed Computing, Vol 2 (1988), 226-241.
4. A. Arnold, A Syntactic congruence for Rational ω-languages, Theoretical Computer Science 39 (1985), 333-335.
5. V. Diekert, Combinatorics on Traces, LNCS 454, Springer-Verlag, 1990.
6. S. Eilenberg, Automata, Languages and Machines, Vol. A, Academic Press, New York, 1974.
7. D. Gabbay, A. Pnueli, S. Shelah, J. Stavi, On the Temporal Analysis of Fairness, ACM Symposium on Principles of Programming Languages, 1980,163-173.
8. J. E. Hopcroft, J. D. Ullman, Introduction to Automata Theory, Languages and Computation, Addison Wesley, 1979.
9. N. D. Jones, L.H. Landweber, Y. E. Lien, Complexity of some problems in Petri Nets, Theoretical Computer Science 4, 277-299.
10. S. Katz, D. Peled, Interleaving Set Temporal Logic, Theoretical Computer Science, Vol. 75, Number 3, 21—43.
11. S. Katz, D. Peled, Verification of Distributed Programs using Representative Interleaving Sequences, Distributed Computing (1992) 6, 107-120.
12. M. Z. Kwiatkowska, Fairness for Non-interleaving Concurrency, Phd. Thesis, Faculty of Science, University of Leicester, 1989.
13. L. Lamport, Time, clocks and the ordering of events in a distributed system, Communications of the ACM 21 (1978), 558-565.
14. L. Lamport, How to make a multiprocess computer that correctly executes multiprocess programs, IEEE Transactions on Computers, Vol. c-28, No. 9, 690-691.
15. L. Lamport, What good is temporal logic, in R.E.A. Mason (Ed.), Information Processing 83, Elsevier Science Publishers, 1983, 657-668.
16. O. Lichtenstein, A. Pnueli, Checking that finite-state concurrent programs satisfy their linear specification, Proceedings of the 11th ACM Annual Symposium on Principles of Programming Languages, 1984, 97-107.
17. R. McNaughton, S. Papert, Counter-Free Automata, The MIT Press, 1971.
18. A. Nerode, Linear Automaton Transformations, Proceedings AMS 9, 541-544.
19. C. Papadimitiou, The Theory of Database Concurrency Control, Computer Science Press, 1986.
20. D. Peled, All from One, One for All: on Model Checking using Representatives, Proceedings of Computer Aided Verification 93, Elounda, Greece, LNCS 697, 609-623.
21. 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.
22. D. Perrin, Recent Results on Automata and Infinite Words, Mathematical Foundations of Computer Science, LNCS 176, Springer Verlag 1984, 134-148.
23. M. P. Schützenberger, Sur les relations rationnelles functionnelles, in M. Nivat (ed.), Automata, Languages and Programming, North Holland, 103-114.
24. A.P. Sistla, E.M. Clarke, The Complexity of Propositional Temporal Logics, Journal of the ACM 32 (1985), 733-749.
25. W. Thomas, Automata on Infinite Objects, in J. Van Leeuwen (ed.), Handbook of Theoretical Computer Science, Vol. B, Elsvier, 133-191.
26. T. Wilke, An algebraic theory for regular languages of finite and infinite words, Technical report 9202,1992, Christian-Albrechts university, Kiel, Germany.
27. P. Wolper, Temporal Logic Can be More Expressive, Information and Control 56 (1983), 72-99.