All Downloads are FREE. Search and download functionalities are using the official Maven repository.
  • Log In
  • Register

    • rationals.StateMachine Maven / Gradle / Ivy

    Go to download

    HermiT is reasoner for ontologies written using the Web Ontology Language (OWL). Given an OWL file, HermiT can determine whether or not the ontology is consistent, identify subsumption relationships between classes, and much more. This is the maven build of HermiT and is designed for people who wish to use HermiT from within the OWL API. It is now versioned in the main HermiT version repository, although not officially supported by the HermiT developers. The version number of this package is a composite of the HermiT version and a value representing the OWLAPI release it is compatible with. Note that the group id for the upstream HermiT is com.hermit-reasoner, while this fork is released under net.sourceforge.owlapi. This fork exists to allow HermiT users to use newer OWLAPI versions than the ones supported by the original HermiT codebase. This package includes the Jautomata library (http://jautomata.sourceforge.net/), and builds with it directly. This library appears to be no longer under active development, and so a "fork" seems appropriate. No development is intended or anticipated on this code base.

    The newest version!
    /*______________________________________________________________________________
 * 
 * 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 5 avr. 2005
 *
 */
package rationals;

import java.util.List;
import java.util.Set;

/**
 * An interface for abstract state machines.
 * 
    
 * A state machine - or labelled transition system - is defined by a tuple
 * (Q,S,q0,d) where:
 * 
      
 * 
    • Q is a set of states ;
      • 
 * 
    • S is a finite set of labels ;
      • 
 * 
    • q0 is the initial state of the machine ;
      • 
 * 
    • d is a transition relation in Q x S x Q.
 * 
    
 * This definition is slightly modified for this interface as the initials is
 * defined as a set instead of a single state.
 * null may be used to denote silent transitions, that is
 * unobservable internal behavior of the machine, which can lead to non
 * determinism.
 * 
    
 * The rationals.Automaton is the main implementation for this interface.
 * 
 * @author nono
 * @version $Id: StateMachine.java 10 2007-05-30 17:25:00Z oqube $
 */
public interface StateMachine {

    /**
     * Returns the alphabet - S - of this state machine.
     * 
     * @return a Set of Object.
     */
    Set alphabet();

    /**
     * Retrieves the state factory associated to this SM.
     * 
     * @return a StateFactory instance
     */
    StateFactory getStateFactory();

    /**
     * Returns the set of all transitions of this machine starting from a given
     * state and labelled with a given label.
     * 
     * @param state
     *            a state of this SM.
     * @param label
     *            a label used in this SM.
     * @return the set of all transitions of this automaton starting from state
     *         {@code state} and labelled by {@code label}. Objects which are
     *         contained in this set are instances of class {@code Transition}.
     * @see Transition
     */
    Set delta(State state, Object label);

    /**
     * Return all transitions from a State.
     * 
     * @param state
     *            start state
     * @return a new Set of transitions (maybe empty)
     */
    Set delta(State state);

    /**
     * Returns all transitions from a given set of states.
     * 
     * @param s
     *            a Set of State objects
     * @return a Set of Transition objects
     */
    Set delta(Set s);

    /**
     * Return the set of states this SM will be in after reading the word from
     * start states s.
     * 
     * @param s
     *            the set of starting states
     * @param word
     *            the word to read.
     * @return the set of reached states. Maybe empty or null.
     */
    Set steps(Set s, List word);

    /**
     * Return the set of states accessible in one transition from given set of
     * states s and letter o.
     * 
     * @param s
     *            the starting states
     * @param o
     *            the letter
     * @return a set of reachable states. Maybe empty or null.
     */
    Set step(Set s, Object o);

    /**
     * Returns the set of initial states for this machine.
     * 
     * @return a Set of State objects.
     */
    Set initials();

    /**
     * Returns the set of states that can access the given states' set
     * st. This is the inverse relation of d
     * 
     * @param st
     *            end states
     * @return a set of states that can reach st. May be empty or
     *         null.
     */
    Set deltaMinusOne(State st);
}    
    
    
    

    




    
    
    © 2015 - 2025 Weber Informatics LLC | Privacy Policy