Consistency Checking for LSC Specifications
Live sequence charts (LSCs) have been proposed as an inter-object scenario-based specification and visual pro gramming language. In this paper, we introduce a high level computational semantics of LSCs, in the form of a PLAY-tree, to show how a running LSC affects the system behaviors in response to a set of external events. Given a nonempty regular language of external events, the consis tency of an LSC specification is defined as whether there ex ists a corresponding PLAY-tree with all success branches; in case of inconsistency, failure traces can be obtained through failure branches of the PLA Y-tree. We also present an algorithm using a memoized depth-first search strategy and an implementation framework in logic programming for consistency checking of LSCs.
Hai-Feng Guo Wen Zheng Mahadevan Subramaniam
Department of Computer Science University of Nebraska at Omaha Omaha, NE 68182-0500, USA
国际会议
天津
英文
119-126
2009-07-29（万方平台首次上网日期，不代表论文的发表时间）