39 search results - page 6 / 8 » On the Relation between SAT and BDDs for Equivalence Checkin... |
RSEISP
2007
Springer
14 years 2 months ago
2007
Springer
Most information about the external world comes from our visual brain. However, it is not clear how this information is processed. We will analyze brain responses using machine lea...
LICS
2006
IEEE
14 years 1 months ago
2006
IEEE
We prove that the modal mu-calculus model-checking problem for (ranked and ordered) node-labelled trees that are generated by order-n recursion schemes (whether safe or not, and w...
CIE
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. The input to a constraint satisfaction problem (CSP) consists of a set of variables, each with a domain, and constraints between these variables formulated by relations o...
QEST
2007
IEEE
14 years 2 months ago
2007
IEEE
The paper introduces symbolic bisimulations for a simple probabilistic π-calculus to overcome the infinite branching problem that still exists in checking ground bisimulations b...
ESORICS
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. We revisit the classical notion of noninterference for statebased systems, as presented by Rushby in 1992. We strengthen his results in several ways, in particular clarif...