GeneralDeterministicFiniteAutomaton (MixedParadigm)

java.lang.Object
- org.processmining.mixedparadigm.models.dfa.GeneralDeterministicFiniteAutomaton

All Implemented Interfaces:

DeterministicFiniteAutomaton

Direct Known Subclasses:

AbsenceN, AlternatePrecedenceAB, AlternateResponseAB, AlternateSuccessionAB, ChainPrecedenceAB, ChainResponseAB, ChainSuccessionAB, CoExistenceAB, ExactlyN, Exclusive1ofM, ExistenceN, InitA, NotChainSuccessionAB, NotCoExistenceAB, NotSuccessionAB, PrecedenceAB, RespondedExistenceAB, ResponseAB, SuccessionAB
```
public class GeneralDeterministicFiniteAutomaton
extends java.lang.Object
implements DeterministicFiniteAutomaton
```
A memory inefficient implementation of DFA's, but effective for small model sizes and low number of transitions. The automaton should be deterministic and complete, i.e. any activity that is not in the set of outgoing transitions of a state is simply not allowed to occur.

Author:

bfvdonge

Field Summary

Fields
Modifier and Type	Field and Description
`protected int`	`alphabetSize`
`protected short`	`initialState`
`protected java.lang.String`	`label`
`protected short[][]`	`matrix` Stores the representation of this automaton.

Fields inherited from interface org.processmining.mixedparadigm.models.dfa.DeterministicFiniteAutomaton
AC, PS, PV, TS, TV

Constructor Summary

Constructors
Constructor and Description
`GeneralDeterministicFiniteAutomaton(java.lang.String label, int alphabetSize)` Constructs a DFA over a given alphabet from [0..alphabetSize) (exclusive) without states.
`GeneralDeterministicFiniteAutomaton(java.lang.String label, int alphabetSize, int matrixSize)` Constructs a DFA over a given alphabet from [0..alphabetSize) (exclusive) without states.

Method Summary

All Methods Instance Methods Concrete Methods
Modifier and Type	Method and Description
`short`	`addState(boolean isInitial, byte type, boolean addSelfLoops)` Adds a new state to the matrix
`void`	`addTransition(short fromS, short toS, short label)` Add a transition from state fromS to state toS labeled with label
`void`	`complete()` Adds a single PV type state to which all other states can transition using any label not currently in the DFA.
`boolean`	`equals(java.lang.Object o)`
`short`	`getInitialState()` Returns the initial state
`java.lang.String`	`getLabel()`
`short`	`getNextState(short currentState, int label)` returns the new state after executing a transition with the given label in currentState, or NOSTATE is no such new state exists.
`byte`	`getStateType(short state)` Returns the type of the state (PV, TV, PS, or TS)
`int`	`hashCode()`
`boolean`	`isAcceptingState(short state)` Returns true if the given state is an accepting state
`boolean`	`isAllowed(short currentState, int label)` Checks if the transition with the given label is possible in the given state
`boolean`	`isComplete()` Check if the automaton is complete, i.e.
`void`	`reduce()` Reduces the DFA to remove all permanently violated states by simply removing all transitions into these states and then removing unreachable states.
`void`	`removeTransition(short fromS, short label)` Remove transition labeled with label from state fromS
`void`	`setInitialState(short state)` Sets the initial state
`void`	`setStateType(short state, byte type)`
`java.lang.String`	`toString()`

Methods inherited from class java.lang.Object
clone, finalize, getClass, notify, notifyAll, wait, wait, wait

- Field Detail
  - alphabetSize
```
protected final int alphabetSize
```
  - matrix
```
protected short[][] matrix
```
    Stores the representation of this automaton. This is a very dense representation. Each row represents a state, each column a transitionlabel. A transition from state s to state t labelled with a is encoded as matrix[s][a] = t
  - initialState
```
protected short initialState
```
  - label
```
protected final java.lang.String label
```
- Constructor Detail
  - GeneralDeterministicFiniteAutomaton
```
public GeneralDeterministicFiniteAutomaton(java.lang.String label,
                                           int alphabetSize)
```
    Constructs a DFA over a given alphabet from [0..alphabetSize) (exclusive) without states.
    
    Parameters:
    
    alphabetSize -
  - GeneralDeterministicFiniteAutomaton
```
public GeneralDeterministicFiniteAutomaton(java.lang.String label,
                                           int alphabetSize,
                                           int matrixSize)
```
    Constructs a DFA over a given alphabet from [0..alphabetSize) (exclusive) without states.
    
    Parameters:
    
    alphabetSize -
- Method Detail
  - addState
```
public short addState(boolean isInitial,
                      byte type,
                      boolean addSelfLoops)
```
    Description copied from interface: DeterministicFiniteAutomaton
    
    Adds a new state to the matrix
    
    Specified by:
    
    addState in interface DeterministicFiniteAutomaton
    
    Returns:
  - addTransition
```
public void addTransition(short fromS,
                          short toS,
                          short label)
```
    Description copied from interface: DeterministicFiniteAutomaton
    
    Add a transition from state fromS to state toS labeled with label
    
    Specified by:
    
    addTransition in interface DeterministicFiniteAutomaton
  - removeTransition
```
public void removeTransition(short fromS,
                             short label)
```
    Description copied from interface: DeterministicFiniteAutomaton
    
    Remove transition labeled with label from state fromS
    
    Specified by:
    
    removeTransition in interface DeterministicFiniteAutomaton
  - getNextState
```
public short getNextState(short currentState,
                          int label)
```
    Description copied from interface: DeterministicFiniteAutomaton
    
    returns the new state after executing a transition with the given label in currentState, or NOSTATE is no such new state exists.
    
    Specified by:
    
    getNextState in interface DeterministicFiniteAutomaton
    
    Returns:
  - isAllowed
```
public boolean isAllowed(short currentState,
                         int label)
```
    Description copied from interface: DeterministicFiniteAutomaton
    
    Checks if the transition with the given label is possible in the given state
    
    Specified by:
    
    isAllowed in interface DeterministicFiniteAutomaton
    
    Returns:
  - getInitialState
```
public short getInitialState()
```
    Description copied from interface: DeterministicFiniteAutomaton
    
    Returns the initial state
    
    Specified by:
    
    getInitialState in interface DeterministicFiniteAutomaton
    
    Returns:
  - setInitialState
```
public void setInitialState(short state)
```
    Description copied from interface: DeterministicFiniteAutomaton
    
    Sets the initial state
    
    Specified by:
    
    setInitialState in interface DeterministicFiniteAutomaton
  - isAcceptingState
```
public boolean isAcceptingState(short state)
```
    Description copied from interface: DeterministicFiniteAutomaton
    
    Returns true if the given state is an accepting state
    
    Specified by:
    
    isAcceptingState in interface DeterministicFiniteAutomaton
    
    Returns:
  - setStateType
```
public void setStateType(short state,
                         byte type)
```
    Specified by:
    
    setStateType in interface DeterministicFiniteAutomaton
  - reduce
```
public void reduce()
```
    Description copied from interface: DeterministicFiniteAutomaton
    
    Reduces the DFA to remove all permanently violated states by simply removing all transitions into these states and then removing unreachable states.
    
    Specified by:
    
    reduce in interface DeterministicFiniteAutomaton
  - complete
```
public void complete()
```
    Description copied from interface: DeterministicFiniteAutomaton
    
    Adds a single PV type state to which all other states can transition using any label not currently in the DFA. After this call, all states have an equal amount of outgoing transitions, equal to the alphabet.
    
    Specified by:
    
    complete in interface DeterministicFiniteAutomaton
  - isComplete
```
public boolean isComplete()
```
    Description copied from interface: DeterministicFiniteAutomaton
    
    Check if the automaton is complete, i.e. for all states, there is a transition defined for all labels
    
    Specified by:
    
    isComplete in interface DeterministicFiniteAutomaton
    
    Returns:
  - getStateType
```
public byte getStateType(short state)
```
    Description copied from interface: DeterministicFiniteAutomaton
    
    Returns the type of the state (PV, TV, PS, or TS)
    
    Specified by:
    
    getStateType in interface DeterministicFiniteAutomaton
    
    Returns:
  - equals
```
public boolean equals(java.lang.Object o)
```
    Specified by:
    
    equals in interface DeterministicFiniteAutomaton
    
    Overrides:
    
    equals in class java.lang.Object
  - hashCode
```
public int hashCode()
```
    Specified by:
    
    hashCode in interface DeterministicFiniteAutomaton
    
    Overrides:
    
    hashCode in class java.lang.Object
  - toString
```
public java.lang.String toString()
```
    Specified by:
    
    toString in interface DeterministicFiniteAutomaton
    
    Overrides:
    
    toString in class java.lang.Object
  - getLabel
```
public java.lang.String getLabel()
```
    Specified by:
    
    getLabel in interface DeterministicFiniteAutomaton

Class GeneralDeterministicFiniteAutomaton

Field Summary

Fields inherited from interface org.processmining.mixedparadigm.models.dfa.DeterministicFiniteAutomaton

Constructor Summary

Method Summary

Methods inherited from class java.lang.Object

Field Detail

alphabetSize

matrix

initialState

label

Constructor Detail

GeneralDeterministicFiniteAutomaton

GeneralDeterministicFiniteAutomaton

Method Detail

addState

addTransition

removeTransition

getNextState

isAllowed

getInitialState

setInitialState

isAcceptingState

setStateType

reduce

complete

isComplete

getStateType

equals

hashCode

toString

getLabel