-
1
-
-
0029637354
-
The algorithmic analysis of hybrid systems
-
R. Alur, C. Courcoubetis, N. Halbwachs, T.A. Henzinger, P.-H. Ho, X. Nicollin, A. Olivero, J. Sifakis, and S. Yovine. The algorithmic analysis of hybrid systems. Theoretical Computer Science, 138:3-34, 1995.
-
(1995)
Theoretical Computer Science
, vol.138
, pp. 3-34
-
-
Alur, R.1
Courcoubetis, C.2
Halbwachs, N.3
Henzinger, T.A.4
Ho, P.-H.5
Nicollin, X.6
Olivero, A.7
Sifakis, J.8
Yovine, S.9
-
2
-
-
0029724779
-
General decidability theorems for infinite-state systems
-
IEEE Computer Society Press
-
P. A. Abdulla, K. Čerāns, B. Jonsson, and Y.-K. Tsay. General decidability theorems for infinite-state systems. In Proceedings of the 11th Annual Symposium on Logic in Computer Science, pages 313-321. IEEE Computer Society Press, 1996.
-
(1996)
Proceedings of the 11Th Annual Symposium on Logic in Computer Science
, pp. 313-321
-
-
Abdulla, P.A.1
Čerāns, K.2
Jonsson, B.3
Tsay, Y.-K.4
-
4
-
-
1542265614
-
Computer-aided Verification: An Introduction to Model Building and Model Checking for Concurrent Systems
-
R. Alur and T.A. Henzinger. Computer-aided Verification: An Introduction to Model Building and Model Checking for Concurrent Systems. Draft, 1998.
-
(1998)
Draft
-
-
Alur, R.1
Henzinger, T.A.2
-
7
-
-
84944382587
-
Minimal model generation
-
Lecture Notes in Computer Science 531, Springer-Verlag
-
Bouajjani, J.-C. Fernandez, and N. Halbwachs. Minimal model generation. In CAV 90: Computer-aided Verification, Lecture Notes in Computer Science 531, pages 197-203. Springer-Verlag, 1990.
-
(1990)
CAV 90: Computer-Aided Verification
, pp. 197-203
-
-
Bouajjanifernandez, J.-C.1
Halbwachs, N.2
-
8
-
-
0028420232
-
CTL* and ECTL* as fragments of the modal μ-calculus
-
M. Dam. CTL* and ECTL* as fragments of the modal μ-calculus. Theoretical Computer Science, 126:77-96, 1994.
-
(1994)
Theoretical Computer Science
, vol.126
, pp. 77-96
-
-
Dam, M.1
-
9
-
-
84957813927
-
On model checking for fragments of μ-calculus
-
Lecture Notes in Computer Science 697, Springer-Verlag
-
E.A. Emerson, C.S. Jutla, and A.P. Sistla. On model checking for fragments of μ-calculus. In CAV 93: Computer-aided Verification, Lecture Notes in Computer Science 697, pages 385-396. Springer-Verlag, 1993.
-
(1993)
CAV 93: Computer-Aided Verification
, pp. 385-396
-
-
Emerson, E.A.1
Jutla, C.S.2
Sistla, A.P.3
-
11
-
-
84958045872
-
Hybrid automata with finite bisimulations
-
Lecture Notes in Computer Science 944, Springer-Verlag
-
T.A. Henzinger. Hybrid automata with finite bisimulations. In ICALP 95: Automata, Languages, and Programming, Lecture Notes in Computer Science 944, pages 324-335. Springer-Verlag, 1995.
-
(1995)
ICALP 95: Automata, Languages, and Programming
, pp. 324-335
-
-
Henzinger, T.A.1
-
15
-
-
84955588655
-
State equivalences for rectangular hybrid au- tomata
-
Lecture Notes in Computer Science 1119, Springer-Verlag
-
T.A. Henzinger and P.W. Kopke. State equivalences for rectangular hybrid au- tomata. In CONCUR 96: Concurrency Theory, Lecture Notes in Computer Science 1119, pages 530-545. Springer-Verlag, 1996.
-
(1996)
CONCUR 96: Concurrency Theory
, pp. 530-545
-
-
Henzinger, T.A.1
Kopke, P.W.2
-
16
-
-
0032140730
-
What’s decidable about hybrid automata?
-
T.A. Henzinger, P.W. Kopke, A. Puri, and P. Varaiya. What’s decidable about hybrid automata? Journal of Computer and System Sciences, 57:94-124, 1998.
-
(1998)
Journal of Computer and System Sciences
, vol.57
, pp. 94-124
-
-
Henzinger, T.A.1
Kopke, P.W.2
Puri, A.3
Varaiya, P.4
-
18
-
-
0025432462
-
CCS expressions, finite-state processes, and three problems of equivalence
-
P.C. Kanellakis and S.A. Smolka. CCS expressions, finite-state processes, and three problems of equivalence. Information and Computation, 86:43-68, 1990.
-
(1990)
Information and Computation
, vol.86
, pp. 43-68
-
-
Kanellakis, P.C.1
Smolka, S.A.2
|