Delaney, Aidan and Stapleton, Gem (2007) Spider diagrams of order In: Proceedings of the VLL 2007 workshop on Visual Languages and Logic, Coeur d'Aléne, Idaho, USA, 23 September 2007.
SpiderCEUR.pdf - Published Version
Download (339kB) | Preview
Spider diagrams are a visual logic capable of making statements about relationships between sets and their cardinalities. Various meta-level results for spider diagrams have been established, including their soundness, completeness and expressiveness. Recent work has established various relationships between spider diagrams and regular languages, which highlighted various classes of languages that spider diagrams could not define. In particular, this work illustrated the inability of spider diagrams to place an order on certain letters in words. To overcome this limitation, in this paper we introduce spider diagrams of order, incorporating an order relation and present a formalisation of the syntax and semantics. Subsequently, we define the language of such a diagram and establish that the class of such languages includes that of the piecewise testable languages.
|Item Type:||Contribution to conference proceedings in the public domain ( Full Paper)|
|Additional Information:||© 2007 for the individual papers by the papers' authors. Copying permitted for private and scientific purposes. Re-publication of material on this page requires permission by the copyright owners.|
|Uncontrolled Keywords:||Visual languages; spider diagrams|
|Subjects:||G000 Computing and Mathematical Sciences > G600 Software Engineering|
|Faculties:||Faculty of Science and Engineering > School of Computing, Engineering and Mathematics > Visual Modelling|
|Date Deposited:||26 Nov 2007|
|Last Modified:||12 Mar 2015 11:47|
Actions (login required)
Downloads per month over past year