130,045 research outputs found
Conversion of LSAT behavioral specifications to automata
The Logistics Specification and Analysis Tool (LSAT) is a model-based
engineering tool used for manufacturing system design and analysis. Using a
domain specific language, a system can be specified in LSAT. In this paper, a
conversion method is presented to obtain the system behavior of an LSAT
specification in automata structure.Comment: 10 pages, 6 figure
Model-based testing with chi and TorX : a case study of the ASML laser subsystem
Within the TANGRAM project, a case study on model-based testing of the ASML laser subsystem has been performed. The approach used in the case study is based on the proposed model-based testing framework, instantiated with state-of-the-art tooling from the TANGRAM project partners: chi as specification language and TorX as test tool. A chi specification model of the laser state behavior and communication interface has been developed. After verification and validation, the model has been used for automatic model-based testing with TorX. Using this approach, discrepancies between the implementation and specification of the laser subsystem have been found
CHR Grammars
A grammar formalism based upon CHR is proposed analogously to the way
Definite Clause Grammars are defined and implemented on top of Prolog. These
grammars execute as robust bottom-up parsers with an inherent treatment of
ambiguity and a high flexibility to model various linguistic phenomena. The
formalism extends previous logic programming based grammars with a form of
context-sensitive rules and the possibility to include extra-grammatical
hypotheses in both head and body of grammar rules. Among the applications are
straightforward implementations of Assumption Grammars and abduction under
integrity constraints for language analysis. CHR grammars appear as a powerful
tool for specification and implementation of language processors and may be
proposed as a new standard for bottom-up grammars in logic programming.
To appear in Theory and Practice of Logic Programming (TPLP), 2005Comment: 36 pp. To appear in TPLP, 200
Graph Creation, Visualisation and Transformation
We describe a tool to create, edit, visualise and compute with interaction
nets - a form of graph rewriting systems. The editor, called GraphPaper, allows
users to create and edit graphs and their transformation rules using an
intuitive user interface. The editor uses the functionalities of the TULIP
system, which gives us access to a wealth of visualisation algorithms.
Interaction nets are not only a formalism for the specification of graphs, but
also a rewrite-based computation model. We discuss graph rewriting strategies
and a language to express them in order to perform strategic interaction net
rewriting
- …