Model checking is the process of verifying whether a model of a concurrent system satisfies a specified temporal property. Symbolic algorithms based on Binary Decision Diagrams (BD...
Pankaj Chauhan, Edmund M. Clarke, Somesh Jha, Jame...
In order to analyze or better develop modern computer games it is critical to have an appropriate representation framework. In this paper a symbolic representation of modern comput...
We show that it is possible to extend hidden Markov models to have a countably infinite number of hidden states. By using the theory of Dirichlet processes we can implicitly integ...
Matthew J. Beal, Zoubin Ghahramani, Carl Edward Ra...
This paper is driven by a general motto: bisimulate a hybrid system by a finite symbolic dynamical system. In the case of o-minimal hybrid systems, the continuous and discrete com...
This paper is concerned with the problem of intrinsically assigning meaning to the signals responsible for autonomic responses in a system. Without an associated cognitive system,...
Martin Randles, A. Taleb-Bendiab, Philip Miseldine