On projective and separable properties

Theoretical Computer Science

Volumn 186, Issue 1-2, 1997, Pages 135-156

  Peled, Doron ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LOGIC; PARALLEL PROCESSING SYSTEMS; THEOREM PROVING;

PROJECTIVE LANGUAGES; PROPOSITIONAL LINEAR TEMPORAL LOGIC; STUTTERING CLOSED COMPONENT LANGUAGES;

FORMAL LANGUAGES;

EID: 0031246956     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(96)00225-3     Document Type: Article

References (34)

1. M. Abadi, L. Lamport and P. Wolper, Realizable and unrealizable concurrent program specifications, in: Proc. 17th Internat. Coll. on Automata, Languages and Programming, 1989, Lecture Notes in Computer Science, Vol. 372 (Springer, Berlin, 1989) 1-17.
2. Y. Afek, G.M. Brown and M. Merritt, Lazy caching, ACM Trans. Programming Languages Systems 15 (1993) 182-205.
3. K. Apt, N. Francez and S. Katz, Appraising fairness in languages for distributed programming, Distributed Comput. 2 (1988) 226-241.
4. A. Arnold, A syntactic congruence for rational ω-languages, Theoret. Comput. Sci. 39 (1985) 333-335.
5. V. Diekert, Combinatorics on Traces, Lecture Notes in Computer Science, Vol. 454 (Springer, Berlin, 1990).
6. V. Diekert, P. Gastin and A. Petit, Rational and recognizable trace languages, Inform. Comput. 116 (1995) 134-153.
7. S. Eilenberg, Automata, Languages and Machines, Vol. A (Academic Press, New York, 1974).
8. D. Gabbay, A. Pnueli, S. Shelah and J. Stavi, On the temporal analysis of fairness, in: Proc. ACM Symp. on Principles of Programming Languages (1980) 163-173.
9. P. Godefroid and P. Wolper, A partial approach to model checking, Inform, and Comput. 110 (1994) 305-326.
10. G.J. Holzmann, Design and Validation of Computer Protocols, Prentice-Hall Software Series (Prentice-Hall, Englewood Cliffs, NJ, 1992).
11. G.J. Holzmann and D. Peled, An improvement in formal verification, in: Proc. 7th Internal. Conf. on Formal Description Techniques, Berne, Switzerland (Chapmann & Hall, New York, 1994) 197-211.
12. J.E. Hopcroft and J.D. Ullman, Introduction to Automata Theory, Languages and Computation (Addison-Wesley, Reading, MA, 1979).
13. N.D. Jones, L.H. Landweber and Y.E. Lien, Complexity of some problems in Petri nets, Theoret. Comput. Sci. 4 (1977) 277-299.
14. S. Katz and D. Peled, Interleaving set temporal logic, Theoret. Comput. Sci. 75 (1990) 21-43.
15. S. Katz and D. Peled, Verification of distributed programs using representative interleaving sequences, Distributed Comput. 6 (1992) 107-120.
16. M.Z. Kwiatkowska, Event fairness and non-interleaving concurrency, Formal Aspects Comput. 1 (1989) 213-228.
17. L. Lamport, How to make a multiprocess computer that correctly executes multiprocess programs, IEEE Trans. Comput. c-28 (1979) 690-691.
18. L. Lamport, What good is temporal logic, in: R.E.A. Mason, ed., Information Processing, Vol. 83 (Elsevier, Amsterdam, 1983) 657-668.
19. R. McNaughton and S. Papert, Counter-Free Automata (The MIT Press, Cambridge, MA, 1971).
20. A. Mazurkiewicz, Trace theory, in: Advances in Petri Nets, 1986, Bad Honnef, Germany, Lecture Notes in Computer Science, Vol. 255 (Springer, Berlin, 1987) 279-324.
21. A. Nerode, Linear automaton transformations, Proc. AMS 9 (1958) 541-544.
22. C. Papadimitiou, The Theory of Database Concurrency Control (Computer Science Press, Rockville, MD, 1986).
23. D. Peled, All from one, one for all: on model checking using representatives, in: Proc. 5th Internat. Conf. on Computer Aided Verification, Elounda, Greece, Lecture Notes in Computer Science, Vol. 697 (Springer, Berlin, 1993) 609-623.
24. D. Peled, Combining partial order reductions with on-the-fly model-checking, in: Proc. 6th Internat. Conf. on Computer Aided Verification, Lecture Notes in Computer Science, Vol. 818 (Springer, Stanford, CA, 1994) 377-390.
25. D. Peled, S. Katz and A. Pnueli, Specifying and proving serializability in temporal logic, in: Proc. 6th IEEE Ann. Symp. on Logic in Computer Science, Amsterdam (1991) 232-245.
26. D. Peled, Th. Wilke and P. Wolper, An algorithmic approach for cheeking closure properties of CD-regular languages, in: CONCUR'96, 7th Internal. Conf. on Concurrency Theory, Pisa, Italy, 1996.
27. D. Perrin, Recent results on automata and infinite words, in: Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, Vol. 176 (Springer, Berlin, 1984) 134-148.
28. O. Lichtenstein and A. Pnueli, Checking that finite-state concurrent programs satisfy their linear specification, in: Proc. 11th ACM Ann. Symp. on Principles of Programming Languages (1984) 97-107.
29. M.P. Schützenberger, Sur les relations rationnelles functionnelles, in: M. Nivat, ed., Automata, Languages and Programming (North-Holland, Amsterdam, 1972) 103-114.
30. A.P. Sistla and E.M. Clarke, The complexity of prepositional temporal logics, J. ACM 32 (1985) 733-749.
31. W. Thomas, Automata on infinite objects, in: J. Van Leeuwen, ed., Handbook of Theoretical Computer Science, Vol. B (Elsevier, Amsterdam, 1990) 133-191.
32. A. Valmari, Stubborn sets for reduced state space generation, in: Proc. 10th Internat. Conf. on Application and Theory of Petri Nets, Vol. 2, Bonn (1989) 1-22.
33. Th. Wilke and D. Peled, Stutter-invariant temporal properties are expressible without Next-time operator, In preparation.
34. P. Wolper, Temporal logic can be more expressive, Inform. Control 56 (1983) 72-99.