In the field of Business Process Management formal models for the control flow of business processes have been designed since more than 15 years. Which methods are best suited to verify the bulk of these models? The first step is to select a formal language which fixes the semantics of the models. We adopt the language of Boolean systems as reference language for Boolean process models. Boolean...

A hot research topic in genomics is to analyze the interactions between genes by systematic gene disruptions and gene overexpressions. Based on a boolean network model without time delay, we have been investigating efficient strategies for identifying a genetic network by multiple gene disruptions and overexpressions. This paper first shows the relationship between our boolean network model wit...

A fundamental issue in model checking of software is the choice of a model for software. We present a model called boolean programs that is expressive enough to represent features in common programming languages and is amenable to model checking. We present a model checking algorithm for boolean programs using context-free-language reachability. The model checking algorithm allows procedure cal...

In this paper, we propose a recurrent neural network that can flexibly make inferences to satisfy given Boolean constraints. In our proposed network, each Boolean variable is represented in dual representation by a pair of neurons, which can handle four states of true, false, unknown, and contradiction. We successfully import Blake’s classical Boolean reasoning algorithm to recurrent neural net...

Most symbolic software model checkers use abstraction techniques to reduce the verification of infinite-state programs to that of decidable classes. Boolean programs [T. Ball, S.K. Rajamani, Bebop: A symbolic model checker for Boolean programs, in: SPIN 00, in: Lecture Notes in Computer Science, vol. 1885, Springer, 2000, pp. 113–130] are the most popular representation for these abstractions. ...