rationals.properties.ModelCheck Maven / Gradle / Ivy
Show all versions of org.semanticweb.hermit Show documentation
/*______________________________________________________________________________
*
* Copyright 2005 Arnaud Bailly - NORSYS/LIFL
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* (1) Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
*
* (2) Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in
* the documentation and/or other materials provided with the
* distribution.
*
* (3) The name of the author may not be used to endorse or promote
* products derived from this software without specific prior
* written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT,
* INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
* STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
* OF THE POSSIBILITY OF SUCH DAMAGE.
*
* Created on 20 avr. 2005
*
*/
package rationals.properties;
import rationals.Automaton;
import rationals.transformations.Complement;
import rationals.transformations.Mix;
import rationals.transformations.Pruner;
/**
* This class implements a basic model-checking algorithm.
*
* The first automata is first complemented on its alphabet using the operation
* {@see rationals.transformations.Complement}. It is then synchronized with
* the second automaton using the {@see rationals.transformations.Mix}
* operation.
*
* If the langage produced is empty, then the test returns true which means that
* automaton b
contains the language of a
. Else,
* the language produced represents counterexamples of the property modelled by
* a
in b
: the test returns false.
*
* The resulting automaton can be retrieved using the method
* {@see #counterExamples()}.
*
* @author nono
* @version $Id: ModelCheck.java 2 2006-08-24 14:41:48Z oqube $
*/
public class ModelCheck implements BinaryTest {
private Automaton cex;
/*
* (non-Javadoc)
*
* @see rationals.properties.BinaryTest#test(rationals.Automaton,
* rationals.Automaton)
*/
public boolean test(Automaton a, Automaton b) {
Automaton ca = new Complement().transform(a);
cex = new Pruner().transform(new Mix().transform(ca, b));
if (new isEmpty().test(ca))
return true;
else
return false;
}
/**
* Return the automaton resulting from this test.
*
* @return an Automaton or null if
* {@see #test(rationals.Automaton,rationals.Automaton)}has not
* been called yet.
*/
public Automaton counterExamples() {
return cex;
}
}