Sciweavers

39 search results - page 2 / 8
» Simulation as a Correct Transformation of Rewrite Systems
Sort
View
FUIN
2002
80views more  FUIN 2002»
13 years 7 months ago
P Systems with Replicated Rewriting and Stream X-Machines (Eilenberg Machines)
Abstract. The aim of this paper is to show how the P systems with replicated rewriting can be modeled by X-machines (also called Eilenberg machines). In the first approach, the par...
Joaquin Aguado, Tudor Balanescu, Anthony J. Cowlin...
ENTCS
2006
168views more  ENTCS 2006»
13 years 7 months ago
Case Study: Model Transformations for Time-triggered Languages
In this study, we introduce a model transformation tool for a time-triggered language: Giotto. The tool uses graphs to represent the source code (Giotto) and the target (the sched...
Tivadar Szemethy
ENTCS
2008
98views more  ENTCS 2008»
13 years 7 months ago
An Intermediate Language for the Simulation of Biological Systems
We propose String MultiSet Rewriting (SMSR) as an intermediate language for simulation of biomolecular systems. Higher level formalisms for biological systems description can be t...
Roberto Barbuti, Giulio Caravagna, Andrea Maggiolo...
SBCCI
2003
ACM
135views VLSI» more  SBCCI 2003»
14 years 18 days ago
Modeling a Reconfigurable System for Computing the FFT in Place via Rewriting-Logic
The growing adoption of reconfigurable architectures opens new implementation alternatives and creates new design challenges. In the case of dynamically reconfigurable architectur...
Mauricio Ayala-Rincón, Rodrigo B. Nogueira,...
CSL
2009
Springer
14 years 1 months ago
On the Relation between Sized-Types Based Termination and Semantic Labelling
We investigate the relationship between two independently developed termination techniques for rst and higher-order rewrite systems. On the one hand, sized-types based termination...
Frédéric Blanqui, Cody Roux