Modifier and Type | Method and Description |
---|---|
DFA |
CompareLog2PetriNet.projectAndAutomatiseModel(org.processmining.acceptingpetrinet.models.AcceptingPetriNet model,
CompareParameters parameters,
org.processmining.framework.plugin.ProMCanceller canceller,
java.lang.String... names) |
DFA |
ComparePetriNet2PetriNet.projectAndAutomatiseModel(org.processmining.acceptingpetrinet.models.AcceptingPetriNet model,
CompareParameters parameters,
org.processmining.framework.plugin.ProMCanceller canceller,
java.lang.String... names) |
DFA |
CompareLog2ProcessTree.projectAndAutomatiseModel(org.processmining.plugins.InductiveMiner.efficienttree.EfficientTree model,
CompareParameters parameters,
org.processmining.framework.plugin.ProMCanceller canceller,
java.lang.String... names) |
DFA |
CompareProcessTree2ProcessTree.projectAndAutomatiseModel(org.processmining.plugins.InductiveMiner.efficienttree.EfficientTree model,
CompareParameters parameters,
org.processmining.framework.plugin.ProMCanceller canceller,
java.lang.String... names) |
abstract DFA |
LogModelFramework.projectAndAutomatiseModel(M model,
CompareParameters parameters,
org.processmining.framework.plugin.ProMCanceller canceller,
java.lang.String... names)
Transform the model into an automaton.
|
abstract DFA |
ModelModelFramework.projectAndAutomatiseModel(M model,
CompareParameters parameters,
org.processmining.framework.plugin.ProMCanceller canceller,
java.lang.String... names)
Transform the model into an automaton.
|
DFA |
ComparePetriNet2PetriNet.projectAndAutomatiseSystem(org.processmining.acceptingpetrinet.models.AcceptingPetriNet system,
CompareParameters parameters,
org.processmining.framework.plugin.ProMCanceller canceller,
java.lang.String... names) |
DFA |
CompareProcessTree2ProcessTree.projectAndAutomatiseSystem(org.processmining.plugins.InductiveMiner.efficienttree.EfficientTree system,
CompareParameters parameters,
org.processmining.framework.plugin.ProMCanceller canceller,
java.lang.String... names) |
abstract DFA |
ModelModelFramework.projectAndAutomatiseSystem(S system,
CompareParameters parameters,
org.processmining.framework.plugin.ProMCanceller canceller,
java.lang.String... names)
Transform the system into an automaton.
|
Modifier and Type | Method and Description |
---|---|
static org.processmining.plugins.InductiveMiner.Pair<java.lang.Integer,DFA> |
LogModelFramework.processLog(EfficientLog log,
RunAutomaton2 modelAutomaton,
org.processmining.framework.plugin.ProMCanceller canceller,
java.lang.String... names) |
Modifier and Type | Method and Description |
---|---|
static boolean |
LogModelFramework.addTraceToAutomaton(RunAutomaton2 modelAutomaton,
DFA logAutomaton,
EfficientLog log,
int trace,
short[] projectionKey,
org.processmining.framework.plugin.ProMCanceller canceller)
Add trace to log automaton and returns whether the trace can be replayed
on the model.
|
static double |
ModelModelFramework.compareAutomata(DFA automatonA,
DFA automatonB,
org.processmining.framework.plugin.ProMCanceller canceller) |
Modifier and Type | Method and Description |
---|---|
static DFA |
AcceptingPetriNet2automaton.convert(org.processmining.acceptingpetrinet.models.AcceptingPetriNet net,
long maxStates,
org.processmining.framework.plugin.ProMCanceller canceller)
The ReachabilityGraph class of ProM gives errors.
|
static DFA |
Tree2Automaton.convert(org.processmining.plugins.InductiveMiner.efficienttree.EfficientTree tree,
org.processmining.framework.plugin.ProMCanceller canceller) |
static DFA |
Tree2Automaton.getOr(DFA automaton1,
DFA automaton2,
org.processmining.framework.plugin.ProMCanceller canceller) |
static DFA |
AcceptingPetriNetProject.projectAndAutomatisePetrinet(org.processmining.acceptingpetrinet.models.AcceptingPetriNet net,
CompareParameters parameters,
org.processmining.framework.plugin.ProMCanceller canceller,
java.lang.String... names) |
static DFA |
EfficientTreeProject.projectAndAutomatiseTree(org.processmining.plugins.InductiveMiner.efficienttree.EfficientTree system,
CompareParameters parameters,
org.processmining.framework.plugin.ProMCanceller canceller,
java.lang.String... names)
Projects a tree and transforms it into an automaton
|
Modifier and Type | Method and Description |
---|---|
static DFA |
Tree2Automaton.getOr(DFA automaton1,
DFA automaton2,
org.processmining.framework.plugin.ProMCanceller canceller) |
static gnu.trove.map.TIntObjectMap<gnu.trove.set.TIntSet> |
MapConjunction2.mapConjunction(DFA conjunction,
DFA automatonA,
org.processmining.framework.plugin.ProMCanceller canceller) |
Modifier and Type | Class and Description |
---|---|
class |
DFAImplEdgeList |
Modifier and Type | Field and Description |
---|---|
static java.util.List<DFA> |
testAutomatonBasic.automata |
Modifier and Type | Method and Description |
---|---|
static DFA |
DFAFactory.createAutomaton() |
Modifier and Type | Method and Description |
---|---|
static boolean |
DFAOperations.accepts(DFA automaton,
short[] trace) |
static int |
DFAOperations.addTrace(DFA automaton,
short[] trace,
org.processmining.framework.plugin.ProMCanceller canceller)
Adds the trace to the automaton in a branching manner, such that the
automaton accepts the trace.
|
static java.util.BitSet |
DFAOperations.getLiveStates(DFA automaton) |
static java.util.BitSet |
DFAOperations.getReachableStates(DFA automaton) |
static int |
DFAOperations.walk(DFA automaton,
short[] trace)
Performs a walk through the automaton.
|
Constructor and Description |
---|
RunAutomaton2(DFA automaton,
org.processmining.framework.plugin.ProMCanceller canceller) |
Modifier and Type | Method and Description |
---|---|
static DFA |
Automaton2Concatenate.concatenate(DFA automatonA,
DFA automatonB,
org.processmining.framework.plugin.ProMCanceller canceller) |
static DFA |
Automaton2Concatenate.concatenate(java.util.List<DFA> automata,
org.processmining.framework.plugin.ProMCanceller canceller)
Returns an automaton that accepts the concatenation of the given
automata.
|
static DFA |
Automaton2Repeat.repeat(DFA automatonA,
org.processmining.framework.plugin.ProMCanceller canceller)
Constructs a new automaton that accepts any repetition (Kleene star) of
the original automaton.
|
static DFA |
Automaton2Shuffle.shuffle(DFA automatonA,
DFA automatonB,
org.processmining.framework.plugin.ProMCanceller canceller) |
static DFA |
Automaton2Shuffle.shuffle(java.util.List<DFA> automata,
org.processmining.framework.plugin.ProMCanceller canceller)
Returns a new automaton that accepts the shuffle product of automatonA
and automatonB.
|
static DFA |
Automaton2Union.union(DFA automatonA,
DFA automatonB,
org.processmining.framework.plugin.ProMCanceller canceller) |
static DFA |
Automaton2Union.union(java.util.List<DFA> automata,
org.processmining.framework.plugin.ProMCanceller canceller)
Returns an automaton that accepts the union of the given automata.
|
Modifier and Type | Method and Description |
---|---|
static org.processmining.plugins.InductiveMiner.Pair<DFA,gnu.trove.map.TObjectIntMap<StatePair>> |
Automaton2Conjunction.conjunction(DFA automatonA,
DFA automatonB,
org.processmining.framework.plugin.ProMCanceller canceller)
Returns the conjunction of automaton1 and automaton2.
|
Modifier and Type | Method and Description |
---|---|
static boolean |
StatePairSet.aPairIsBothAccepting(DFA automatonA,
DFA automatonB,
int[] statePairSet) |
static DFA |
Automaton2Concatenate.concatenate(DFA automatonA,
DFA automatonB,
org.processmining.framework.plugin.ProMCanceller canceller) |
static org.processmining.plugins.InductiveMiner.Pair<DFA,gnu.trove.map.TObjectIntMap<StatePair>> |
Automaton2Conjunction.conjunction(DFA automatonA,
DFA automatonB,
org.processmining.framework.plugin.ProMCanceller canceller)
Returns the conjunction of automaton1 and automaton2.
|
static boolean |
Automaton2Repeat.isAnyAccepting(DFA automaton,
gnu.trove.set.TIntSet stateSet) |
static void |
Automaton2Minimise.minimise(DFA automaton,
org.processmining.framework.plugin.ProMCanceller canceller)
Minimise the automaton with the Hopcroft algorithm
|
static boolean |
StatePairSet.oneStateBIsAccepting(DFA automatonB,
int[] statePairSet) |
static void |
Automaton2Conjunction.process(DFA conjunction,
java.util.LinkedList<StatePair> worklist,
gnu.trove.map.TObjectIntMap<StatePair> statePair2conjunctionState,
DFAImplEdgeList.EdgeIterableOutgoing itA,
DFAImplEdgeList.EdgeIterableOutgoing itB,
int conjunctionSourceState) |
static void |
Automaton2Minimise.removeDeadStates(DFA automaton)
Remove the states from which no accepting state can be reached.
|
static DFA |
Automaton2Repeat.repeat(DFA automatonA,
org.processmining.framework.plugin.ProMCanceller canceller)
Constructs a new automaton that accepts any repetition (Kleene star) of
the original automaton.
|
static DFA |
Automaton2Shuffle.shuffle(DFA automatonA,
DFA automatonB,
org.processmining.framework.plugin.ProMCanceller canceller) |
static DFA |
Automaton2Union.union(DFA automatonA,
DFA automatonB,
org.processmining.framework.plugin.ProMCanceller canceller) |
Modifier and Type | Method and Description |
---|---|
static DFA |
Automaton2Concatenate.concatenate(java.util.List<DFA> automata,
org.processmining.framework.plugin.ProMCanceller canceller)
Returns an automaton that accepts the concatenation of the given
automata.
|
static DFA |
Automaton2Shuffle.shuffle(java.util.List<DFA> automata,
org.processmining.framework.plugin.ProMCanceller canceller)
Returns a new automaton that accepts the shuffle product of automatonA
and automatonB.
|
static DFA |
Automaton2Union.union(java.util.List<DFA> automata,
org.processmining.framework.plugin.ProMCanceller canceller)
Returns an automaton that accepts the union of the given automata.
|
Constructor and Description |
---|
StatePairEdgesIterator(DFA automatonA,
DFA automatonB) |