Real-time automata and the Kleene algebra of sets of real numbers

被引：0

作者：

Dima, C ^{[1
]}

机构：

[1] Univ Bucharest, Dept Fundamentals Comp Sci, RO-70109 Bucharest, Romania

来源：

STACS 2000: 17TH ANNUAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE | 2000年 / 1770卷

关键词：

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

A commutative complemented Kleene algebra of sets of (positive) real numbers is introduced. For the subalgebra generated by finite unions of rational intervals a normal form is found. These are then applied to the complementation problem for real-time automata.

引用

页码：279 / 289

页数：11

共 16 条

[1] A THEORY OF TIMED AUTOMATA [J].

ALUR, R ;

DILL, DL .

THEORETICAL COMPUTER SCIENCE, 1994, 126 (02) :183-235

[2] The benefits of relaxing punctuality [J].

Alur, R ;

Feder, T ;

Henzinger, TA .

JOURNAL OF THE ACM, 1996, 43 (01) :116-146

[3]

ALUR R, 1994, LNCS, V818, P1

[4] A Kleene theorem for timed automata [J].

Asarin, E ;

Caspi, P ;

Maler, O .

12TH ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, PROCEEDINGS, 1997, :160-171

[5]

Berard B., 1998, Fundamenta Informaticae, V36, P145

[6]

BOUYER P, 1999, LNCS SERIES

[7]

CHOFFRUT C, 1998, TIMED AUTOMATA PERIO

[8]

CONWAY JH, 1971, REGULAR ALGEBRA FINI

[9] TEMPORAL CONSTRAINT NETWORKS [J].

DECHTER, R ;

MEIRI, I ;

PEARL, J .

ARTIFICIAL INTELLIGENCE, 1991, 49 (1-3) :61-95

[10]

DIMA C, 1999, P AFL 99 WORKSH VASS

← 1 2 →