1895 search results - page 291 / 379 » Using ATL for Checking Models |
90
Voted
AAAI
2008
15 years 4 months ago
2008
We introduce Bayesian Coalitional Games1 (BCGs), a generalization of classical coalitional games to settings with uncertainties. We define the semantics of BCG using the partition...
130
Voted
BIRTHDAY
2008
Springer
15 years 4 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...
109
click to vote
CAV
2008
Springer
15 years 4 months ago
2008
Springer
We propose a type system for lock-freedom in the -calculus, which guarantees that certain communications will eventually succeed. Distinguishing features of our type system are: it...
101
click to vote
LREC
2008
15 years 3 months ago
2008
Recently the LATL has undertaken the development of a multilingual translation system based on a symbolic parsing technology and on a transfer-based translation model. A crucial c...
105
click to vote
DAGSTUHL
2003
15 years 3 months ago
2003
Message Sequence Charts (MSCs) is a notation used in practice by protocol designers and system engineers. It is defined within an international standard (ITU Z120), and is also i...