-
1
-
-
0020194420
-
Process logic: Expressiveness, decidability and completeness
-
Harel, D., Kozen, D., and Parikh, R. (1982), Process logic: Expressiveness, decidability and completeness, J. Comput. System Sci. 25, 144-201.
-
(1982)
J. Comput. System Sci.
, vol.25
, pp. 144-201
-
-
Harel, D.1
Kozen, D.2
Parikh, R.3
-
2
-
-
84947903049
-
Automata for the μ-calculus and related results
-
"MFCS '95," Springer-Verlag, Berlin
-
Janin, D., and Walukiewicz, I. (1995), Automata for the μ-calculus and related results, in "MFCS '95," Lecture Notes in Computer Science, Vol. 969, pp. 552-562, Springer-Verlag, Berlin.
-
(1995)
Lecture Notes in Computer Science
, vol.969
, pp. 552-562
-
-
Janin, D.1
Walukiewicz, I.2
-
3
-
-
84947707632
-
Axiomatising linear time mu-calculus
-
"CONCUR '95," Springer-Verlag, Berlin
-
Kaivola, R. (1995), Axiomatising linear time mu-calculus, in "CONCUR '95," Lecture Notes in Computer Sciences, Vol. 962, pp. 423-437, Springer-Verlag, Berlin.
-
(1995)
Lecture Notes in Computer Sciences
, vol.962
, pp. 423-437
-
-
Kaivola, R.1
-
4
-
-
49049126479
-
Results on the propositional mu-calculus
-
Kozen, D. (1983), Results on the propositional mu-calculus, Theoret. Comput. Sci. 27, 333-354.
-
(1983)
Theoret. Comput. Sci.
, vol.27
, pp. 333-354
-
-
Kozen, D.1
-
5
-
-
0040859656
-
A finite model theorem for the propositional μ-calculus
-
Kozen, D. (1988), A finite model theorem for the propositional μ-calculus, Studia Logica 47, (3) 234-241.
-
(1988)
Studia Logica
, vol.47
, Issue.3
, pp. 234-241
-
-
Kozen, D.1
-
6
-
-
84913355219
-
Regular expressions for infinite trees and a standard form of automata
-
"Fifth Symposium on Computation Theory" (A. Skowron, Ed.), Springer-Verlag, Berlin
-
Mostowski, A. W. (1984), Regular expressions for infinite trees and a standard form of automata, in "Fifth Symposium on Computation Theory" (A. Skowron, Ed.), Lecture Notes in Computer Science, Vol. 208, pp. 157-168, Springer-Verlag, Berlin.
-
(1984)
Lecture Notes in Computer Science
, vol.208
, pp. 157-168
-
-
Mostowski, A.W.1
-
7
-
-
0013263178
-
Games for μ-calculus
-
February Technical Report, TR 94-03(192), Institute of Informatics, Warsav University. To appear
-
Niwiński, D., and Walukiewicz, I. (February 1994), Games for μ-calculus, Technical Report, TR 94-03(192), Institute of Informatics, Warsav University. To appear in Theoret. Comput. Sci. Available from: http://www.daimi.aau.dk/igw/home.html.
-
(1994)
Theoret. Comput. Sci.
-
-
Niwiński, D.1
Walukiewicz, I.2
-
8
-
-
0001132880
-
Local model checking in the modal mu-calculus
-
Stirling, C. S., and Walker, D. J. (1991), Local model checking in the modal mu-calculus, Theoret. Comput. Sci. 89, 161-171.
-
(1991)
Theoret. Comput. Sci.
, vol.89
, pp. 161-171
-
-
Stirling, C.S.1
Walker, D.J.2
-
9
-
-
0024681890
-
An automata theoretic procedure for the propositional mu-calculus
-
Streett, R. S., and Emerson, E. A. (1989), An automata theoretic procedure for the propositional mu-calculus, Inform. and Comput. 81, 249-264.
-
(1989)
Inform. and Comput.
, vol.81
, pp. 249-264
-
-
Streett, R.S.1
Emerson, E.A.2
-
10
-
-
0027225010
-
On completeness of the μ-calculus
-
Walukiewicz, I. (1993), On completeness of the μ-calculus, in "LICS '93," pp. 136-146.
-
(1993)
LICS '93
, pp. 136-146
-
-
Walukiewicz, I.1
|