Sciweavers

86 search results - page 5 / 18
» Priority Rewrite Systems for OSOS Process Languages
Sort
View
IANDC
2011
129views more  IANDC 2011»
14 years 10 months ago
Rigid tree automata and applications
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a res...
Florent Jacquemard, Francis Klay, Camille Vacher
IFIP
2004
Springer
15 years 8 months ago
Ensuring Termination by Typability
A term terminates if all its reduction sequences are of finite length. We show four type systems that ensure termination of well-typed π-calculus processes. The systems are obtai...
Yuxin Deng, Davide Sangiorgi
ENTCS
2006
168views more  ENTCS 2006»
15 years 3 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
GIS
2004
ACM
16 years 4 months ago
Query processing in a geographic mediation system
Despite various interoperability recommendations, heterogeneity of Geographic Information Systems (GIS) is still an issue. This led to an increasing need for a data integration sy...
François-Marie Colonna, Mehdi Essid, Omar B...
ANCS
2007
ACM
15 years 7 months ago
Ruler: high-speed packet matching and rewriting on NPUs
Programming specialized network processors (NPU) is inherently difficult. Unlike mainstream processors where architectural features such as out-of-order execution and caches hide ...
Tomas Hruby, Kees van Reeuwijk, Herbert Bos