Generating a checking sequence with a minimum number of reset transitions

Given a finite state machine M, a checking sequence is an input sequence that is guaranteed to lead to a failure if the implementation under test is faulty and has no more states than M. There has been much interest in the automated generation of a short checking sequence from a finite state machine. However, such sequences can contain reset transitions whose use can adversely affect both the cost of applying the checking sequence and the effectiveness of the checking sequence. Thus, we sometimes want a checking sequence with a minimum number of reset transitions rather than a shortest checking sequence. This paper describes a new algorithm for generating a checking sequence, based on a distinguishing sequence, that minimises the number of reset transitions used.This work was supported in part by Leverhulme Trust grant number F/00275/D, Testing State Based Systems, Natural Sciences and Engineering Research Council (NSERC) of Canada grant number RGPIN 976, and Engineering and Physical Sciences Research Council grant number GR/R43150, Formal Methods and Testing (FORTEST)

Black box checking for biochemical networks

We propose black box checking as a framework for analyzing biochemical networks. Black box checking was originally introduced by Peled, Yannakakis and Vardi in the context of formal verification of concurrent systems as a strategy that combines model checking and testing, as two main techniques in that area. Based on the natural analogy between biochemical networks and concurrent systems we argue that black box checking can be used to design and perform experiments in a systematic manner, and also to learn about the network underlying mechanisms. We also discuss potential applications with emphasis on forward engineering of biochemical networks