-
- Sebastian Uchitel
- Imperial College London, London, U.K.
-
- Jeff Kramer
- Imperial College London, London, U.K.
-
- Jeff Magee
- Imperial College London, London, U.K.
この論文をさがす
説明
<jats:p>State machine based formalisms such as labelled transition systems (LTS) are generally assumed to be complete descriptions of system behaviour at some level of abstraction: if a labelled transition system cannot exhibit a certain sequence of actions, it is assumed that the system or component it models cannot or should not exhibit that sequence. This assumption is a valid one at the end of the modelling effort when reasoning about properties of the completed model. However, it is not a valid assumption when behaviour models are in the process of being developed. In this setting, the distinction between proscribed behaviour and behaviour that has not yet been defined is an important one. Knowing where the gaps are in a behaviour model permits the presentation of meaningful questions to stakeholders, which in turn can lead to model exploration and thus more comprehensive descriptions of the system behaviour. In this paper we propose using partial labelled transition systems (PLTS) to capture what remains to be defined of the system behaviour. In the context of scenario synthesis, we show that PLTSs can be used to support the iterative incremental elaboration of behaviour models.</jats:p>
収録刊行物
-
- ACM SIGSOFT Software Engineering Notes
-
ACM SIGSOFT Software Engineering Notes 28 (5), 19-27, 2003-09
Association for Computing Machinery (ACM)