Sciweavers

209 search results - page 37 / 42
» Termination of Priority Rewriting
Sort
View
TII
2010
166views Education» more  TII 2010»
13 years 2 months ago
Source-to-Source Architecture Transformation for Performance Optimization in BIP
Behavior, Interaction, Priorities (BIP) is a component framework for constructing systems from a set of atomic components by using two kinds of composition operators: interactions ...
Marius Bozga, Mohamad Jaber, Joseph Sifakis
CADE
2006
Springer
14 years 8 months ago
Tree Automata with Equality Constraints Modulo Equational Theories
This paper presents new classes of tree automata combining automata with equality test and automata modulo equational theories. We believe that these classes have a good potential ...
Florent Jacquemard, Laurent Vigneron, Michaël...
RTA
2005
Springer
14 years 1 months ago
Leanest Quasi-orderings
A convenient method for defining a quasi-ordering, such as those used for proving termination of rewriting, is to choose the minimum of a set of quasi-orderings satisfying some d...
Nachum Dershowitz, E. Castedo Ellerman
ATAL
2010
Springer
13 years 8 months ago
Characterising and matching iterative and recursive agent interaction protocols
For an agent to intelligently use specifications of executable protocols, it is necessary that the agent can quickly and correctly assess the outcomes of that protocol if it is ex...
Tim Miller, Peter McBurney
APN
2007
Springer
14 years 1 months ago
Nets with Tokens Which Carry Data
Abstract. We study data nets, a generalisation of Petri nets in which tokens carry data from linearlyordered infinite domains and in which whole-place operations such as resets an...
Ranko Lazic, Thomas Christopher Newcomb, Joël...