Visual Language Theory 1998
DOI: 10.1007/978-1-4612-1676-6_8
|View full text |Cite
|
Sign up to set email alerts
|

How to Represent a Visual Specification

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
9
0

Year Published

1998
1998
2002
2002

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 14 publications
(9 citation statements)
references
References 8 publications
0
9
0
Order By: Relevance
“…The symbols of any sentence (or word) w ∈ L are only related to each other by a linear ordering. In contrast, a sentence (or diagram or picture) p of a visual language VL over an alphabet A consists of a set of symbols of A that are, in general, related by several relationships {r 1 , …, r n } = R. Thus we can say that a picture p is given by a pair (s, r) where s ⊆ A is the set of symbols of the picture and r ⊆ s×R×s gives the relationships that hold in p. 1 In other words, p is nothing but a directed graph with edge labels drawn from R, and a visual language is simply a set of such graphs.…”
Section: Abstract Visual Syntaxmentioning
confidence: 99%
See 2 more Smart Citations
“…The symbols of any sentence (or word) w ∈ L are only related to each other by a linear ordering. In contrast, a sentence (or diagram or picture) p of a visual language VL over an alphabet A consists of a set of symbols of A that are, in general, related by several relationships {r 1 , …, r n } = R. Thus we can say that a picture p is given by a pair (s, r) where s ⊆ A is the set of symbols of the picture and r ⊆ s×R×s gives the relationships that hold in p. 1 In other words, p is nothing but a directed graph with edge labels drawn from R, and a visual language is simply a set of such graphs.…”
Section: Abstract Visual Syntaxmentioning
confidence: 99%
“…We can view a graph in the style of algebraic data types found in functional languages like ML or Haskell: a graph is either empty, or it is constructed by a graph g and a new node v together 1. Note that we do not need node labels to distinguish variables.…”
Section: An Inductive Graph Modelmentioning
confidence: 99%
See 1 more Smart Citation
“…, p n (cp i ,cp n ) hold. For example, to build sentences of the Message Sequence Charts language, as reported in [Andries et al 1998], VALID is defined by @m ʦ Msg, ?l 1 ,l 2 ʦLines, s.t. origin(m,l 1 ), dest(m,l 2 ) ∧ @a ʦ Act ?i ʦ Inst s.t.…”
Section: Control Automata For Visual Interaction: Constructionmentioning
confidence: 99%
“…Finally, we can mention [1,34]: two theoretical frameworks for defining graphical notations from concrete aspects to semantics. They supply a hierarchy of graph grammars to concentrate on concrete and abstract syntax aspects, but the semantics is relegated to textual annotations in natural language.…”
Section: Related Workmentioning
confidence: 99%