Sciweavers

3820 search results - page 261 / 764
» Bounded Model Debugging
Sort
View
173
Voted
FOSSACS
2006
Springer
15 years 7 months ago
A Finite Model Construction for Coalgebraic Modal Logic
In recent years, a tight connection has emerged between modal logic on the one hand and coalgebras, understood as generic transition systems, on the other hand. Here, we prove tha...
Lutz Schröder
ICECCS
2010
IEEE
161views Hardware» more  ICECCS 2010»
15 years 3 months ago
Model Checking Round-Based Distributed Algorithms
—In the field of distributed computing, there are many round-based algorithms to solve fundamental problems, such as leader election and distributed consensus. Due to the nature...
Xin An, Jun Pang
MSS
2008
IEEE
112views Hardware» more  MSS 2008»
15 years 3 months ago
Axiomatization of stochastic models for choice under uncertainty
: This paper develops a theory of probabilistic models for risky choices. Part of this theory can be viewed as an extension of the expected utility theory to account for bounded ra...
John K. Dagsvik
137
Voted
IM
2007
15 years 3 months ago
Pursuit-Evasion in Models of Complex Networks
Vertex pursuit games, such as the game of Cops and Robbers, are a simplified model for network security. In these games, cops try to capture a robber loose on the vertices of the ...
Anthony Bonato, Pawel Pralat, Changping Wang
AUTOMATICA
2004
77views more  AUTOMATICA 2004»
15 years 3 months ago
Non-asymptotic quality assessment of generalised FIR models with periodic inputs
In any real-life identification problem, only a finite number of data points is available. On the other hand, almost all results in stochastic identification pertain to asymptotic...
Marco C. Campi, Su Ki Ooi, Erik Weyer