Sciweavers

206 search results - page 11 / 42
» Probabilistic Analysis of Large Finite State Machines
Sort
View
ICMLA
2010
14 years 9 months ago
A Probabilistic Graphical Model of Quantum Systems
Quantum systems are promising candidates of future computing and information processing devices. In a large system, information about the quantum states and processes may be incomp...
Chen-Hsiang Yeang
ISSTA
1998
ACM
15 years 3 months ago
Improving Efficiency of Symbolic Model Checking for State-Based System Requirements
We present various techniques for improving the time and space efficiency of symbolic model checking for system requirements specified as synchronous finite state machines. We use...
William Chan, Richard J. Anderson, Paul Beame, Dav...
DSN
2002
IEEE
15 years 4 months ago
Model Checking Safety Properties of Servo-Loop Control Systems
This paper presents the experiences of using a symbolic model checker to check the safety properties of a servoloop control system. Symbolic model checking has been shown to be be...
M. Edwin Johnson
ECAI
2008
Springer
15 years 1 months ago
A probabilistic analysis of diagnosability in discrete event systems
Abstract. This paper shows that we can take advantage of information about the probabilities of the occurrences of events, when this information is available, to refine the classic...
Farid Nouioua, Philippe Dague
SIGCOMM
2006
ACM
15 years 5 months ago
Beyond bloom filters: from approximate membership checks to approximate state machines
Many networking applications require fast state lookups in a concurrent state machine, which tracks the state of a large number of flows simultaneously. We consider the question ...
Flavio Bonomi, Michael Mitzenmacher, Rina Panigrah...