Wolper, Pierre ; Université de Liège - ULiège > Dép. d'électric., électron. et informat. (Inst.Montefiore) > Informatique (parallélisme et banques de données)
Language :
English
Title :
An Algorithmic Approach for Checking Closure Properties of omega-Regular Languages
Publication date :
1996
Event name :
7th International Conference on Concurrency Theory
Alur, R., Peled, D., Penczek, W.: Model-checking of causality properties. In Proc. 10th IEEE Symposium on Logic in Computer Science, San Diego, California (1995) 90-100.
Arnold, A.: A syntactic congruence for rational ω-languages. Theoretical Computer Science 39 (1985) 333-335.
Diekert, V., Gastin, P., Petit, A.: Rational and recognizable trace languages. Information and Computation 116 (1995) 134-153.
Godefroid, P.: Using partial orders to improve automatic verification methods. In Proc. 2nd Workshop on Computer Aided Verification, New Brunswick, NJ. Lect. Notes in Comput. Sci., vol. 531, Springer (1990) 176-185.
Katz, S., Peled, D.: Verification of distributed programs using representative interleaving sequences. Distributed Computing 6 (1992) 107-120.
Kwiatkowska, M. Z.: Event fairness and non-interleaving concurrency. Formal Aspects of Computing 1 (1989) 213-228.
Kozen, D.: Lower bounds for natural proof systems. 18th IEEE Symposium on Foundations of Computer Science, Providence, Rhode Island (1977) 254-266.
Lamport, L.: How to make a multiprocessor computer that correctly executes multiprocess programs. IEEE Transactions on Computers 28 (1979) 690-691.
Lamport, L.: What good is temporal logic? In Proc. IFIP Congr. on Information Processing, Elsevier (1983) 657-668.
Mazurkiewicz, A.: Trace theory. In Proc. Advances in Petri Nets 1986, Bad Honnef, Germany. Lect. Notes in Comput. Sci., vol. 255, Springer (1987) 279-324.
Pécuchet, J.-P.: Etude Syntaxique des parties reconnaissable de mots inflnis. In Automata, Languages, and Programming: 13th Intern. Coll. Rennes, France. Lect. Notes in Comput. Sci., vol. 226, Springer (1986) 294-303.
Peled, D.: On projective and separable properties. In Proc. Colloquium on Trees in Algebra and Programming, Edinburgh, Scotland. Lect. Notes in Comput. Sci., vol. 787, Springer (1994) 291-307.
Peled, D.: All from One, One from All: on Model Checking using representatives, In Proc. 5th International Conference on Computer Aided Verification, Elounda, Greece, Lect. Notes in Comput. Sci., vol. 697, Springer (1993) 409-423.
Peled, D.: Combining partial-order reductions with on-the-fly model-checking. Formal Methods in System Design 8 (1996) 39-64.
Pnueli, A.: The temporal logic of programs. In Proc. 18th IEEE Symposium on Foundation of Computer Science, Providence, Rhode Island (1977) 46-57.
Sistla, A. P., Clarke, E. M.: The complexity of propositional linear temporal logics. Journal of the ACM 32 (1985) 733-749.
Sistla, A. P., Vardi, M. Y., Wolper, P.: The complementation problem for Büchi automata with applications to temporal logic. Theoretical Computer Science 49 (1987) 217-237.
Thiagarajan, P. S.: A trace based extension of linear time temporal logic. In Proc. 10th IEEE Symposium on Logic in Computer Science, Paris, France (1994) 438-447.
Thomas, W.: Automata and quantifier hierarchies: formal properties of finite automata and applications. In Proc. of LITP Spring School on Theoretical Computer Science, J. E. Pin, ed. Lect. Notes in Comput. Sci., vol. 386, Springer (1989) 104-119.
Thomas, W.: Automata on infinite objects. In Handbook of Theoretical Computer Science, vol. B, J. van Leeuwen, ed., Elsevier, Amsterdam (1990) 133-191.
Valmari, A.: A stubborn attack on state explosion. Formal Methods in System Design 1 (1992) 297-322.
Vardi, M. Y., Wolper, P.: Automata-theoretic techniques for modal logics of programs. J. Comput. System Sci. 32 (1986) 182-221.
Vardi, M. Y., Wolper, P.: Reasoning about infinite computations. Information and Computation 115 (1994) 1-37.
Wolper, P.: Temporal logic can be more expressive. Information and Control 56 (1983) 72-99.
Wolper, P., Godefroid, P.: Partial-order methods for temporal verification. In Proc. CONCUR, 4th Conference on Concurrency Theory, Hildesheim, Germany. Lect. Notes in Comput. Sci, vol. 715, Springer (1993) 233-246.