SCOPUS 정보 검색 플랫폼

Volumn 84, Issue 2, 2002, Pages 75-85

A logical characterization of data languages

a CNRS (France)

Author keywords

Formal languages; Real time systems

Indexed keywords

AUTOMATA THEORY; COMPUTER SCIENCE; FORMAL LOGIC; REAL TIME SYSTEMS; SET THEORY; THEOREM PROVING;

DATA LANGUAGES;

FORMAL LANGUAGES;

EID: 0037206519 PISSN: 00200190 EISSN: None Source Type: Journal
DOI: 10.1016/S0020-0190(02)00229-6 Document Type: Article

Times cited : (45)

References (20)

1
- 44949269544
- Model-checking in dense real-time
- (1993) Inform. and Comput. , vol.104 , Issue.1 , pp. 2-34
- Alur, R.¹ Courcoubetis, C.² Dill, D.³

2
- 0030718786
- A Kleene theorem for timed automata
- IEEE Computer Society Press
- (1997) Proc. 12th IEEE Symp. Logic in Computer Science (LICS'97) , pp. 160-171
- Asarin, E.¹ Caspi, P.² Maler, O.³

3
- 0010252473
- Timed regular expressions
- (2002) J. ACM , vol.49 , Issue.2 , pp. 172-206
- Asarin, E.¹ Caspi, P.² Maler, O.³

4
- 85031771187
- Automata for modeling real-time systems
- Proc. 17th Internat. Coll. Automata, Languages, and Programming (ICALP'90), Springer, Berlin
- (1990) Lecture Notes in Computer Science , vol.443 , pp. 322-335
- Alur, R.¹ Dill, D.²

5
- 85028755887
- Event-clock automata: A determinizable class of timed automata
- Proc. 6th Internat. Conf. Computer Aided Verification (CAV'94), Springer, Berlin
- (1994) Lecture Notes in Computer Science , vol.818 , pp. 1-13
- Alur, R.¹ Fix, L.² Henzinger, T.A.³

7
- 0002921593
- On a decision method in restricted second order arithmetic
- Stanford University Press, Stanford, CA
- (1962) Proc. (1960) Internat. Congr. Logic, Methodology and Philosophy of Science , pp. 1-11
- Büchi, J.R.¹

8
- 84887454941
- Decomposition and composition of timed automata
- Proc. 26th Internat. Coll. Automata, Languages, and Programming (ICALP'99), Springer, Berlin
- (1999) Lecture Notes in Computer Science , vol.1644 , pp. 210-219
- Bouyer, P.¹ Petit, A.²

9
- 0038158498
- A Kleene/Büchi-like theorem for clock languages
- to appear
- (2002) J. Automat. Languages Combin.
- Bouyer, P.¹ Petit, A.²

10
- 84944033436
- An algebraic characterization of data and timed languages
- Proc. 12th Internat. Conf. Concurrency Theory (CONCUR'01), Springer, Berlin
- (2001) Lecture Notes in Computer Science , vol.2154 , pp. 248-261
- Bouyer, P.¹ Petit, A.² Thérien, D.³

11
- 0003962322
- MIT Press, Cambridge, MA
- (1999) Model Checking
- Clarke, E.¹ Grumberg, O.² Peled, D.³

13
- 84945915318
- Controlled timed automata
- Proc. 9th Internat. Conf. Concurrency Theory (CONCUR'98), Springer, Berlin
- (1998) Lecture Notes in Computer Science , vol.1466 , pp. 455-469
- Demichelis, F.¹ Zielonka, W.²

14
- 84878576366
- The regular real-time languages
- Proc. 25th Internat. Coll. Automata, Languages, and Programming (ICALP'98), Springer, Berlin
- (1998) Lecture Notes in Computer Science , vol.1443 , pp. 580-591
- Henzinger, T.A.¹ Raskin, J.-F.² Schobbens, P.-Y.³

15
- 84896693115
- Uppaal in a nutshell
- (1997) J. Software Tools Technology Transfer , vol.1 , Issue.1-2 , pp. 134-152
- Larsen, K.G.¹ Pettersson, P.² Yi, W.³

16
- 0000550710
- Logic on words
- (1994) Bull. European Assoc. Theoret. Comput. Sci. , vol.54 , pp. 145-165
- Pin, J.-E.¹

17
- 0004348610
- Can be found on
- (2001) Infinite words
- Perrin, D.¹ Pin, J.-E.²

19
- 85005984698
- Specifying timed state sequences in powerful decidable logics and timed automata
- Proc. 3rd Internat. Symp. Formal Techniques in Real-Time and Fault-Tolerant Systems (FTRTFT'94), Springer, Berlin
- (1994) Lecture Notes in Computer Science , vol.863 , pp. 694-715
- Wilke, T.¹

20
- 84958967825
- Model-checking timed automata
- School on Embedded Systems, Springer, Berlin
- (1998) Lecture Notes in Computer Science , vol.1494 , pp. 114-152
- Yovine, S.¹

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.