Sciweavers

1650 search results - page 62 / 330
» The HOM problem is decidable
Sort
View
SERVICES
2008
130views more  SERVICES 2008»
13 years 11 months ago
Composition of Interactive Web Services Based on Controller Synthesis
an abstract form of service composition where Web services are represented as nondeterministic communicating automata. Considering the case in which communication is done via chan...
Philippe Balbiani, Fahima Cheikh, Guillaume Feuill...
IJAC
2007
117views more  IJAC 2007»
13 years 10 months ago
Equations in Free Inverse Monoids
It is known that the problem of determining consistency of a finite system of equations in a free group or a free monoid is decidable, but the corresponding problem for systems o...
Timothy Deis, John C. Meakin, Géraud S&eacu...
INFORMATICALT
2000
82views more  INFORMATICALT 2000»
13 years 9 months ago
Some Grammatical Structures of Programming Languages as Simple Bracketed Languages
Abstract. We consider in this paper so called simple bracketed languages having special limitations. They are sometimes used for the definitions of some grammatical structures of p...
Boris Melnikov, Elena Kashlakova
RC
2002
96views more  RC 2002»
13 years 9 months ago
Verification of Invertibility of Complicated Functions over Large Domains
A new method to decide the invertibility of a given high-dimensional function over a domain is presented. The problem arises in the field of verified solution of differential algeb...
Jens Hoefkens, Martin Berz
ICTAC
2009
Springer
13 years 7 months ago
A First-Order Policy Language for History-Based Transaction Monitoring
Online trading invariably involves dealings between strangers, so it is important for one party to be able to judge objectively the trustworthiness of the other. In such a setting,...
Andreas Bauer 0002, Rajeev Goré, Alwen Tiu