Languages and models for hybrid automata: A coalgebraic perspective

被引：3

作者：

Neves, Renato ^{[1
]}

Barbosa, Luis S.

机构：

[1] INESC TEC, HASLab, Braga, Portugal

来源：

THEORETICAL COMPUTER SCIENCE | 2018年 / 744卷

关键词：

Coalgebra; Hybrid automata; Bisimulation; Regular expression; WEIGHTED TIMED AUTOMATA; SYSTEMS; BISIMULATION; CHECKING;

D O I：

10.1016/j.tcs.2017.09.038

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We study hybrid automata from a coalgebraic point of view. We show that such a perspective supports a generic theory of hybrid automata with a rich palette of definitions and results. This includes, among other things, notions of bisimulation and behaviour, state minimisation techniques, and regular expression languages. (C) 2017 Elsevier B.V. All rights reserved.

引用

页码：113 / 142

页数：30

共 37 条

[1]

Adamek J., 2005, TheoryAppl. Categ., V14, P157

[2]

Adamek J., 2012, COALGEBRAIC PERSPECT, P58

[3]

Adamek Jiri, 2009, Abstract and concrete categories: The joy of cats

[4] Optimal paths in weighted timed automata [J].

Alur, R ;

La Torre, S ;

Pappas, GJ .

THEORETICAL COMPUTER SCIENCE, 2004, 318 (03) :297-322

[5]

Alur R, 1997, LECT NOTES COMPUT SC, V1243, P74

[6] THE ALGORITHMIC ANALYSIS OF HYBRID SYSTEMS [J].

ALUR, R ;

COURCOUBETIS, C ;

HALBWACHS, N ;

HENZINGER, TA ;

HO, PH ;

NICOLLIN, X ;

OLIVERO, A ;

SIFAKIS, J ;

YOVINE, S .

THEORETICAL COMPUTER SCIENCE, 1995, 138 (01) :3-34

[7]

[Anonymous], PRINCIPLES CYBER PHY

[8]

[Anonymous], 2010, LOGICAL ANAL HYBRID

[9] 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

[10]

Bezhanishvili Nick, 2012, Logic, Language, Information and Computation. Proceedings of the 19th International Workshop, WoLLIC 2012, P191, DOI 10.1007/978-3-642-32621-9_14

← 1 2 3 4 →