Sciweavers

1000 search results - page 6 / 200
» Nominal rewriting systems
Sort
View
AMAST
2010
Springer
13 years 2 months ago
Proving Termination Properties with mu-term
mu-term is a tool which can be used to verify a number of termination properties of (variants of) Term Rewriting Systems (TRSs): termination of rewriting, termination of innermost ...
Beatriz Alarcón, Raúl Gutiérr...
ICAI
2004
13 years 8 months ago
Inductive System Health Monitoring
- The Inductive Monitoring System (IMS) software was developed to provide a technique to automatically produce health monitoring knowledge bases for systems that are either difficu...
David L. Iverson
AUTOMATICA
2006
92views more  AUTOMATICA 2006»
13 years 7 months ago
Robust control strategies for multi-inventory systems with average flow constraints
In this paper we consider multi
Dario Bauso, Franco Blanchini, Raffaele Pesenti
BIRTHDAY
2005
Springer
14 years 1 months ago
Primitive Rewriting
Undecidability results in rewriting have usually been proved by reduction from undecidable problems of Turing machines or, more recently, from Post’s Correspondence Problem. Ano...
Nachum Dershowitz
RTA
2005
Springer
14 years 29 days ago
Proving Positive Almost-Sure Termination
Abstract In order to extend the modeling capabilities of rewriting systems, it is rather natural to consider that the firing of rules can be subject to some probabilistic laws. Co...
Olivier Bournez, Florent Garnier