Spider Diagrams (SDs) are a well-established visual language used to specify sets, their relationships, and constraints on their cardinalities. We propose two extensions allowing their use in the definition of temporal policies. Firstly, Timed SDs (TSDs) enable the expression of temporal constraints. We adopt an interval-based model of calendar time, permitting diagram elements to be specified to exist only over some interval. We introduce basic TSDs, where time constraints refer to an entire diagram rather than individual elements, as a canonical form for TSDs, and decompose complex TSDs into comic strip-like sequences of basic TSDs. Secondly, we introduce an innovative usage of SDs by specialising and adapting them to an OO-modelling context: in type-SDs a spider represents a type, whereas in instance-SDs a spider represents a specific object of a given type. A notion of conformance of an instance-SD to a type-SD ensues and we extend the concepts to instance-TSDs and type-TSDs. Finally, we combine extensions to allow the specification of temporal policies, which define permissible states for instances of some given type over a period without temporal gaps in it, and introduce a notion of conformance to a policy for a sequence of time-annotated instances.
|Number of pages||23|
|Journal||Journal of Visual Languages and Computing|
|Publication status||Published - 1 Jun 2013|
- Visual logic
- Temporal constraint specification
- Spider Diagrams
- Visual modelling