Skip to search formSkip to main contentSkip to account menu

Bitstate hashing

Bitstate hashing is a hashing method invented in 1968 by Morris. It is used for state hashing, where each state (e.g. of an automaton) is represented… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
We report on a case study in which we have model checked some properties for the Suzuki-Kasami distributed mutual exclusion… 
2013
2013
Explicit-state model checking which is conducted by state space search has difficulty in exploring satisfactory state space… 
2012
2012
One disadvantage of bitstate hashing, the traditional probabilistic state space analysis method, is the possible large amount of… 
2008
2008
The paper proposes an improvement for SCC-based emptiness checking algorithms,which combines the advantages of SCC-based and… 
2006
2006
Emptiness check is very important in model checking to LTL. In this paper we first present a new emptiness checking algorithm… 
2005
2005
In this paper we refine external exploration for explicit state model checking by a fusion of External A* with internal bit state… 
2005
2005
In this paper we refine external exploration for explicit state model checking by a fusion with internal bitstate hashing… 
2000
2000
In this paper we address the problem of scheduling and synthesizing distributed control programs for a batch production plant. We… 
1998
1998
Partial search methods like bitstate hashing, or supertrace, allow formal verification techniques to be applied to problems which… 
1995
1995
A gas turbine engine of a gas-coupled type suited for driving a vehicle has auxiliary devices such as an air conditioning…