Entry Alur:1994:TTA from tcs1990.bib
Last update: Wed Sep 26 02:11:46 MDT 2018
Top |
Symbols |
Numbers |
Math |
A |
B |
C |
D |
E |
F |
G |
H |
I |
J |
K |
L |
M |
N |
O |
P |
Q |
R |
S |
T |
U |
V |
W |
X |
Y |
Z
BibTeX entry
@Article{Alur:1994:TTA,
author = "Rajeev Alur and David L. Dill",
title = "A theory of timed automata",
journal = j-THEOR-COMP-SCI,
volume = "126",
number = "2",
pages = "183--235",
day = "25",
month = apr,
year = "1994",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:18:04 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1994&volume=126&issue=2;
http://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1994&volume=126&issue=2&aid=1507",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4220 (Automata theory)",
corpsource = "Dept. of Comput. Sci., Stanford Univ., CA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "Boolean functions; Boolean operations; Buchi
acceptance conditions; closure properties; decision
problems; finite automata; finitely many real-valued
clocks; formal language theory; formal languages;
infinite sequences; intersection; language inclusion
problem; Muller acceptance conditions; PSPACE
algorithm; real-time systems; state-transition graphs;
subclasses; timed automata theory; timing constraints;
union; universality problem",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- acceptance,
93(2)227,
97(2)233
- boolean,
70(2)251,
74(3)313,
76(2)261,
79(1)25,
80(1)53,
80(1)77,
81(1)117,
81(2)257,
82(1)113,
82(1)141,
84(2)199,
88(1)139,
91(1)71,
93(2)227,
93(2)303,
97(2)285,
98(2)289,
99(2)243,
100(1)137,
101(1)133,
102(2)307,
103(1)25,
107(1)121,
108(2)271,
112(2)291,
113(1)167,
115(1)77,
116(2)399,
116(2)415,
118(2)167,
121(1)9,
121(1)411,
124(2)273,
126(1)3,
126(2)237,
133(1)35,
134(1)51,
134(1)79,
135(1)139,
136(2)419,
182(1)257
- Buchi,
93(2)227,
96(2)345,
97(2)233,
126(1)77
- clock,
94(1)125,
95(1)75,
128(1)3
- closure,
70(2)251,
73(2)213,
76(2)261,
76(2)273,
78(2)377,
80(1)53,
81(1)117,
82(2)215,
82(2)389,
83(2)249,
85(1)171,
86(2)233,
88(2)191,
88(2)287,
91(1)71,
93(1)43,
93(2)227,
93(2)321,
96(2)285,
97(2)217,
100(1)157,
103(1)3,
108(2)185,
111(1)89,
116(1)95,
117(1)z,
120(2)293,
125(2)167,
125(2)243,
127(1)25,
127(1)149,
127(2)287,
132(1)243,
134(2)329
- condition,
70(1)35,
70(1)151,
70(2)179,
72(1)27,
74(1)3,
75(1)111,
83(1)57,
83(2)189,
86(1)81,
86(2)233,
87(2)315,
88(2)269,
93(2)185,
93(2)227,
93(2)279,
94(1)101,
94(1)141,
94(2)335,
95(2)307,
97(1)143,
97(2)233,
100(1)157,
100(2)267,
100(2)325,
103(1)39,
105(1)7,
109(1)181,
110(1)1,
111(1)89,
112(1)145,
112(2)413,
113(1)93,
118(2)301,
120(1)69,
120(2)197,
121(1)309,
129(1)123,
131(2)271,
132(1)259
- constraint,
72(1)55,
75(3)347,
76(1)115,
90(2)391,
95(1)1,
97(1)105,
99(1)79,
105(1)27,
105(1)85,
109(1)225,
111(1)59,
116(1)117,
120(1)45,
122(1)165,
122(1)263,
125(1)3,
127(2)351,
131(2)331,
133(2)205,
133(2)267,
134(2)287,
134(2)473,
135(2)221
- decision,
71(3)281,
72(1)39,
72(2)265,
74(1)71,
80(2)227,
81(1)137,
81(2)169,
82(1)19,
84(1)127,
84(2)199,
85(1)33,
93(2)279,
95(1)115,
98(1)137,
98(1)z,
106(2)351,
107(1)63,
110(2)419,
112(1)145,
112(2)371,
113(1)119,
118(2)193,
119(1)173,
120(2)197,
123(2)183,
125(2)339,
127(1)25,
128(1)179,
133(2)307,
134(2)329,
134(2)365,
134(2)387,
135(1)139
- finitely,
71(3)281,
85(1)33,
87(2)315,
93(1)1,
100(2)267,
113(1)35,
114(2)273,
115(1)131,
131(2)271
- inclusion,
71(3)281,
82(2)215,
91(1)85,
93(1)43,
95(1)143,
97(2)217,
110(1)99,
133(1)15,
134(2)365
- infinite,
73(2)121,
74(1)71,
74(2)121,
74(2)227,
75(1)157,
76(2)309,
82(2)177,
83(2)301,
84(2)165,
86(1)3,
86(2)277,
88(1)83,
88(2)365,
93(2)227,
93(2)327,
94(2)161,
96(1)157,
96(1)z,
99(1)121,
100(1)105,
103(1)143,
103(2)165,
103(2)191,
104(1)3,
107(2)305,
108(1)45,
112(1)145,
112(2)277,
112(2)413,
113(1)35,
115(1)63,
116(1)3,
123(1)3,
123(1)55,
125(2)167,
126(1)77,
129(1)1,
129(2)385,
132(1)37,
132(1)337,
134(1)131,
134(2)329
- intersection,
81(2)295,
95(1)143,
98(1)5,
98(1)79,
99(2)177,
100(2)303,
102(1)135,
110(1)99,
129(2)397
- many,
72(2)133,
79(1)241,
89(1)3,
113(1)35,
123(2)407
- Muller,
83(2)323,
93(2)227,
96(2)345
- operation,
71(3)425,
72(2)203,
73(2)213,
76(2)261,
77(1)27,
78(2)377,
79(2)357,
84(2)293,
87(1)43,
88(1)127,
88(1)139,
89(2)207,
91(1)71,
92(1)49,
95(2)245,
99(2)243,
101(2)177,
103(2)283,
105(2)217,
107(2)333,
109(1)257,
110(1)99,
110(2)405,
111(1)89,
112(2)291,
115(1)131,
116(1)33,
116(1)195,
117(1)39,
117(1)187,
117(1)289,
119(1)23,
119(1)103,
119(2)355,
125(2)229,
125(2)315,
125(2)345,
127(2)255,
129(2)397,
130(1)49,
130(1)73,
130(1)125,
132(1)129,
133(1)141,
133(2)421
- PSPACE,
93(2)265,
97(2)199,
100(1)1,
100(1)45,
123(2)183,
132(1)319
- real-time,
88(2)287,
94(1)125,
95(2)207,
97(1)83,
97(2)245,
100(1)105,
101(2)289,
128(1)75,
131(1)219,
133(2)341
- sequence,
71(3)381,
71(3)419,
73(1)91,
73(2)121,
74(1)71,
74(3)341,
75(3)223,
76(1)115,
76(2)309,
79(2)275,
80(2)263,
83(1)131,
83(2)205,
83(2)219,
87(2)251,
90(2)391,
92(1)3,
93(2)279,
94(2)161,
94(2)215,
94(2)373,
95(2)231,
98(2)163,
100(1)105,
102(2)253,
103(1)137,
103(2)191,
107(1)31,
108(2)385,
113(2)349,
114(1)63,
115(1)63,
117(1)289,
119(2)345,
119(2)363,
122(1)137,
123(1)3,
123(1)55,
123(1)61,
123(2)239,
123(2)351,
127(2)351,
129(2)263,
129(2)369,
129(2)385,
132(1)1,
132(1)37,
132(1)337
- state-transition,
101(2)289
- subclasses,
70(3)277,
74(3)325
- time, real-,
88(2)287,
94(1)125,
95(2)207,
97(1)83,
97(2)245,
100(1)105,
101(2)289,
128(1)75,
131(1)219,
133(2)341
- timed,
103(2)335
- timing,
131(1)219
- transition, state-,
101(2)289
- union,
74(3)325,
76(1)53,
76(2)273,
76(2)309,
77(3)291,
79(1)137,
88(2)351,
91(2)239,
97(2)217,
99(2)177,
110(1)99,
113(2)293,
116(1)33,
124(2)195,
126(1)31,
131(2)311,
132(1)71,
134(1)225,
136(2)333
- universality,
119(1)223,
129(2)419