1399 search results - page 210 / 280 » Multi-party Finite Computations |
131
click to vote
CSL
2006
Springer
15 years 8 months ago
2006
Springer
Game quantification is an expressive concept and has been studied in model theory and descriptive set theory, especially in relation to infinitary logics. Automatic structures on t...
148
click to vote
EMSOFT
2006
Springer
15 years 8 months ago
2006
Springer
We report on a case study in which the model checker Uppaal is used to formally model parts of Zeroconf, a protocol for dynamic configuration of IPv4 link-local addresses that has...
138
click to vote
MASCOTS
2008
15 years 6 months ago
2008
Two classic categories of models exist for computer networks: network information flow and network of queues. The network information flow model appropriately captures the multi-ho...
118
click to vote
APAL
2010
15 years 4 months ago
2010
A well-known polymodal provability logic GLP is complete w.r.t. the arithmetical semantics where modalities correspond to reflection principles of restricted logical complexity in...
152
click to vote
BMCBI
2010
15 years 4 months ago
2010
Background: The importance of stochasticity in cellular processes having low number of molecules has resulted in the development of stochastic models such as chemical master equat...