Unification & sharing in timed automata verification

Alexandre David; Gerd Behrmann; Kim G. Larsen; Wang Yi

doi:10.1007/3-540-44829-2_15

Unification & sharing in timed automata verification

Alexandre David
, Gerd Behrmann
, Kim G. Larsen
, Wang Yi

科研成果: 期刊稿件 › 文章 › 同行评审

12 引用（Scopus）

摘要

We present work on unifying the two main data structures involved during reachability analysis of timed automata. We also present result on sharing common elements between states. The experimental evaluations show speedups of up to 60% and memory savings of up to 80% compared to previous implementations.

源语言	英语
页（从-至）	225-229
页数	5
期刊	Lecture Notes in Computer Science
卷	2648
DOI	https://doi.org/10.1007/3-540-44829-2_15
出版状态	已出版 - 2003
已对外发布	是

访问文件

10.1007/3-540-44829-2_15

其它文件与链接

链接到 Scopus 的出版物

引用此

@article{35d8e86825ba4b02985a5954fd1bd978,

title = "Unification \& sharing in timed automata verification",

abstract = "We present work on unifying the two main data structures involved during reachability analysis of timed automata. We also present result on sharing common elements between states. The experimental evaluations show speedups of up to 60\% and memory savings of up to 80\% compared to previous implementations.",

author = "Alexandre David and Gerd Behrmann and Larsen, \{Kim G.\} and Wang Yi",

year = "2003",

doi = "10.1007/3-540-44829-2\_15",

language = "英语",

volume = "2648",

pages = "225--229",

journal = "Lecture Notes in Computer Science",

issn = "0302-9743",

publisher = "Springer Science and Business Media Deutschland GmbH",

}

TY - JOUR

T1 - Unification & sharing in timed automata verification

AU - David, Alexandre

AU - Behrmann, Gerd

AU - Larsen, Kim G.

AU - Yi, Wang

PY - 2003

Y1 - 2003

N2 - We present work on unifying the two main data structures involved during reachability analysis of timed automata. We also present result on sharing common elements between states. The experimental evaluations show speedups of up to 60% and memory savings of up to 80% compared to previous implementations.

AB - We present work on unifying the two main data structures involved during reachability analysis of timed automata. We also present result on sharing common elements between states. The experimental evaluations show speedups of up to 60% and memory savings of up to 80% compared to previous implementations.

UR - https://www.scopus.com/pages/publications/35248844099

U2 - 10.1007/3-540-44829-2_15

DO - 10.1007/3-540-44829-2_15

M3 - 文章

AN - SCOPUS:35248844099

SN - 0302-9743

VL - 2648

SP - 225

EP - 229

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

ER -

Unification & sharing in timed automata verification

摘要

访问文件

其它文件与链接

指纹

引用此