Sciweavers

423 search results - page 8 / 85
» On Term Rewriting Systems Having a Rational Derivation
Sort
View
IAJIT
2010
166views more  IAJIT 2010»
14 years 8 months ago
Specification and Prototyping of Reactive Distributed Systems with Algebraic Term Nets
: The specification of the dynamic behaviour of reactive distributed systems must exhibit the structures of control and has to imply explicitly the relevant aspects of the distribu...
Faiza Bouchoul, Mohamed Mostefai
FOSSACS
2006
Springer
15 years 1 months ago
Processes for Adhesive Rewriting Systems
Abstract. Rewriting systems over adhesive categories have been recently introduced as a general framework which encompasses several rewriting-based computational formalisms, includ...
Paolo Baldan, Andrea Corradini, Tobias Heindel, Ba...
CDC
2008
IEEE
125views Control Systems» more  CDC 2008»
14 years 11 months ago
Application of real rational modules in system identification
This paper introduces a real rational module framework in the context of Prediction Error Identification using Box-Jenkins model structures. This module framework, which can easily...
Tzvetan Ivanov, Pierre-Antoine Absil, Brian D. O. ...
CADE
2008
Springer
14 years 11 months ago
Automated Implicit Computational Complexity Analysis (System Description)
Recent studies have provided many characterisations of the class of polynomial time computable functions through term rewriting techniques. In this paper we describe a (fully autom...
Martin Avanzini, Georg Moser, Andreas Schnabl
ICTAC
2004
Springer
15 years 3 months ago
A Proof of Weak Termination Providing the Right Way to Terminate
We give an inductive method for proving weak innermost termination of rule-based programs, from which we automatically infer, for each successful proof, a finite strategy for data...
Olivier Fissore, Isabelle Gnaedig, Hél&egra...