Some results on the expressive power and complexity of LSCs

被引:0
|
作者
Harel, David [1 ]
Maoz, Shahar [1 ]
Segall, Itai [1 ]
机构
[1] Weizmann Inst Sci, IL-76100 Rehovot, Israel
来源
PILLARS OF COMPUTER SCIENCE | 2008年 / 4800卷
关键词
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We survey some of the main results regarding the complexity and expressive power of Live Sequence Charts (LSCs). We first describe the two main semantics given to LSCs: a trace-based semantics and an operational semantics. The expressive power of the language is then examined by describing translations into various temporal logics. Some limitations of the language are also discussed. Finally, we survey complexity results, mainly due to Bontemps and Schobbens, regarding the use of LSCs for model checking, execution, and synthesis.
引用
收藏
页码:351 / 366
页数:16
相关论文
共 50 条