Regarding nite state machines as Markov chains facilitates the application of probabilistic methods to very large logic synthesis and formal verication problems. Recently, we ha...
Gary D. Hachtel, Enrico Macii, Abelardo Pardo, Fab...
Explicit model checking algorithms explore the full state space of a system. State spaces are usually treated as directed graphs without any specific features. We gather a large co...
Abstract. State elimination is an intuitive and easy-to-implement algorithm that computes a regular expression from a finite-state automaton (FA). The size of a regular expression...
The presented work addresses the observation problem for a large class of nonlinear systems, including systems which are nonlinear in the unmeasured states. Assuming partial state ...
Abstract. I introduce the notion of knowledge relativity as a proposed conceptual link between different scientific disciplines. Examples from Informatics and Philosophy, particula...