Witness and Counterexample Automata for ACTL

Witnesses and counterexamples produced by model checkers provide a very useful source of diagnostic information. They are usually returned in the form of a single computation path along the model of the system. However, a single computation path is not enough to explain all reasons of a validity or a failure. Our work in this area is motivated by the application of action-based model checking algorithms to the test case generation for models formally specified with a CCS-like process algebra. There, only linear and finite witnesses and counterexamples are useful and for the given formula and model an efficient representation of the set of witnesses (counterexamples) explaining all reasons of validity (failure) is needed. This paper identifies a fragment of action computation tree logic (ACTL) that can be handled in this way. Moreover, a suitable form of witnesses and counterexamples is proposed and witness and counterexample automata are introduced, which are finite automata recognizin...

• Type: Conference
• Year: 2004
• Where: FORTE
• Authors: Robert Meolic, Alessandro Fantechi, Stefania Gnesi
• Keywords: Counterexample, FORTE 2004, FORTE 2007, Single Computation Path, Witnesses