-
2
-
-
85028755887
-
A determinizable class of timed automata
-
Springer Verlag
-
R. Alur, L. Fix and T.A. Henzinger. A determinizable class of timed automata, in Computer-Aided Verification, LNCS 818:1-13, Springer Verlag, 1994.
-
(1994)
Computer-Aided Verification, LNCS
, vol.818
, pp. 1-13
-
-
Alur, R.1
Fix, L.2
Henzinger, T.A.3
-
3
-
-
0029708178
-
The benefits of relaxing punctuality
-
R. Alur and T. Henzinger. The benefits of relaxing punctuality, Journal of ACM, 43:116-146, 1996.
-
(1996)
Journal of ACM
, vol.43
, pp. 116-146
-
-
Alur, R.1
Henzinger, T.2
-
4
-
-
0030718786
-
A Kleene Theorem for Timed Automata
-
G. Winskel (Ed.)
-
E. Asarin, P. Caspi and O. Maler, A Kleene Theorem for Timed Automata, in G. Winskel (Ed.) Proc. LICS’97, p.160-171, 1997.
-
(1997)
Proc. LICS’97
, pp. 160-171
-
-
Asarin, E.1
Caspi, P.2
Maler, O.3
-
5
-
-
0000767643
-
Characterization of the expressive power of silent transitions in timed automata
-
B. Bérard, V. Diekert, P. Gastin and A. Petit. Characterization of the expressive power of silent transitions in timed automata, Fundamenta Informatic æ, 36:145-182, 1998.
-
(1998)
Fundamenta Informatic æ
, vol.36
, pp. 145-182
-
-
Bérard, B.1
Diekert, V.2
Gastin, P.3
Petit, A.4
-
9
-
-
84947934863
-
On the design of Hybrid Control Systems Using Automata Models
-
V. Chandru and V. Vinay (Eds.)
-
Dang Van Hung and Wang Ji, On the design of Hybrid Control Systems Using Automata Models, in V. Chandru and V. Vinay (Eds.) FSTTCS, LNCS 1180:156-167, 1996.
-
(1996)
FSTTCS, LNCS
, vol.1180
, pp. 156-167
-
-
Van Hung, D.1
Ji, W.2
-
10
-
-
0026154176
-
Temporal constraint networks
-
R. Dechter, I. Meiri and J. Pearl, Temporal constraint networks, Artificial Intelligence, 49:61-95, 1991.
-
(1991)
Artificial Intelligence
, vol.49
, pp. 61-95
-
-
Dechter, R.1
Meiri, I.2
Pearl, J.3
-
11
-
-
84944090405
-
-
Timed Regular Expressions, Real-Time Automata and Simple Duration Calculus, draft of a UNU/IIST report
-
C. Dima. Timed Regular Expressions, Real-Time Automata and Simple Duration Calculus, draft of a UNU/IIST report, 1998. Available at http://funinf.math.unibuc.ro/~cdima/work/report.ps.gz.
-
(1998)
-
-
Dima, C.1
-
12
-
-
84944090406
-
Automata and regular expressions for real-time languages
-
Vasszeczeny, Hungary, 9-13 august
-
C. Dima. Automata and regular expressions for real-time languages, Proceedings of the AFL’99 workshop, Vasszeczeny, Hungary, 9-13 august 1999.
-
(1999)
Proceedings of the AFL’99 Workshop
-
-
Dima, C.1
-
15
-
-
0003620778
-
-
Addison-Wesley/Narosa Publishing House, eighth edition, New Delhi
-
John E. Hopcroft and Jeffrey D. Ullman, Introduction to Automata Theory, Languages and Computation, Addison-Wesley/Narosa Publishing House, eighth edition, New Delhi, 1992.
-
(1992)
Introduction to Automata Theory, Languages and Computation
-
-
Hopcroft, J.E.1
Ullman, J.D.2
-
16
-
-
0000042790
-
A completeness theorem for Kleene algebras and the algebra of regular events
-
D. Kozen. A completeness theorem for Kleene algebras and the algebra of regular events, Information and Computation, 110:366-390, 1994.
-
(1994)
Information and Computation
, vol.110
, pp. 366-390
-
-
Kozen, D.1
|