3 search results - page 1 / 1 » A Theory of History Dependent Abstractions for Learning Inte... |
CONCUR
2012
Springer
11 years 7 months ago
2012
Springer
BIRTHDAY
2008
Springer
13 years 6 months ago
2008
Springer
We use History Dependent Automata (HD-automata) as a syntax-indepentend formalism to check compatibility of services at binding time in Service-Oriented Computing. Informally speak...
INTERFACES
2008
13 years 4 months ago
2008
re more abstract than necessary. They depend on assumptions that are highly unlikely to occur in practical situations, which are often less formal and rigid. Nonetheless, we discus...