2 search results - page 1 / 1 » History Dependent Automata for Service Compatibility |
90
Voted
BIRTHDAY
2008
Springer
15 years 4 days 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...
77
Voted
FOSSACS
2005
Springer
15 years 3 months ago
2005
Springer
Nominal calculi have been shown very effective to formally model a variety of computational phenomena. The models of nominal calculi have often infinite states, thus making model ...