Denotational semantics of hybrid automata

被引：0

作者：

Edalat, A ^{[1
]}

Pattinson, D

机构：

[1] Univ London Imperial Coll Sci Technol & Med, Dept Comp, London SW7 2AZ, England

[2] Univ Leicester, Dept Comp Sci, Leicester LE1 7RH, Leics, England

来源：

FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATION STRUCTURES, PROCEEDINGS | 2006年 / 3921卷

关键词：

D O I：

暂无

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

We introduce a denotational semantics for non-linear hybrid automata, and relate it to the operational semantics given in terms of hybrid trajectories. The semantics is defined as least fixpoint of an operator on the continuous domain of functions of time that take values in the lattice of compact subsets of n-dimensional Euclidean space. The semantic function assigns to every point in time the set of states the automaton can visit at that time, starting from one of its initial states. Our main results are the correctness and computational adequacy of the denotational semantics with respect to the operational semantics and the fact that the denotational semantics is computable.

引用

页码：231 / 245

页数：15

共 50 条

[31] ON INFINITE COMPUTATIONS IN DENOTATIONAL SEMANTICS [J].

DEBAKKER, JW ;

MEYER, JJC ;

ZUCKER, JI .

THEORETICAL COMPUTER SCIENCE, 1983, 26 (1-2) :53-82

[32] OPERATIONAL AND DENOTATIONAL SEMANTICS OF PROLOG [J].

ARBAB, B ;

BERRY, DM .

JOURNAL OF LOGIC PROGRAMMING, 1987, 4 (04) :309-329

[33] Denotational semantics for timed testing [J].

Diaz, LFL ;

Escrig, DD .

TRANSFORMATION-BASED REACTIVE SYSTEMS DEVELOPMENT, 1997, 1231 :368-382

[34] DENOTATIONAL SEMANTICS OF QUERY LANGUAGES [J].

SUBIETA, K .

INFORMATION SYSTEMS, 1987, 12 (01) :69-82

[35] A MODULAR APPROACH TO DENOTATIONAL SEMANTICS [J].

MOGGI, E .

LECTURE NOTES IN COMPUTER SCIENCE, 1991, 530 :138-139

[36] LOGICAL SEMANTICS AND DENOTATIONAL SEMANTICS OF PROLOG INTERPRETERS [J].

DELAHAYE, JP .

RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS, 1988, 22 (01) :3-42

[37] Denotational semantics for thread algebra [J].

Vu, Thuy Duong .

JOURNAL OF LOGIC AND ALGEBRAIC PROGRAMMING, 2008, 74 (02) :94-111

[38] A denotational semantics of defeasible logic [J].

Maher, MJ .

COMPUTATIONAL LOGIC - CL 2000, 2000, 1861 :209-222

[39] DENOTATIONAL SEMANTICS OF PROGRAMMING LANGUAGES [J].

TENNENT, RD .

COMMUNICATIONS OF THE ACM, 1976, 19 (08) :437-453

[40] Towards a denotational semantics for TimeML [J].

Katz, Graham .

ANNOTATING, EXTRACTING AND REASONING ABOUT TIME AND EVENTS, 2007, 4795 :88-106

← 1 2 3 4 5 →