| AboutAction |
This is an action that displays the information about GOAL in a dialog.
|
| AbstractAlphabetAction |
This class provides an action that can abstract the alphabet of an automaton.
|
| AbstractComplementAction<T extends ComplementConstruction<FSA,FSA>> |
This is an abstract action for complementing an NBW.
|
| AbstractNewAutomatonAction<T extends Automaton> |
This is an action for creating new automata.
|
| AbstractNewEditableAction<T extends Editable> |
This is an action relying a creator to create new editable objects.
|
| AbstractStepByStepTranslationAction<F extends Logic,T extends Automaton> |
An AbstractStepByStepTranslationAction takes a translator as a
parameter and uses the translator to translate a formula step-by-step.
|
| AbstractTranslationAction<F extends Logic,T extends Automaton> |
A TranslationAction takes a translator as a parameter and uses the
translator to translate formulae.
|
| AbstractZoomAction |
This is an abstract class for zooming an automaton at some level.
|
| AperiodicAction |
This class provides an action that determines if the language of a classic
finite state automaton or a Büchi automaton is aperiodic, that is, the
language is star-free.
|
| AutomatonConsistencyAction |
This is an action that tests if an automaton is consistent.
|
| AutomatonOperationAction<T extends Automaton,O extends Automaton> |
This is an abstract action for operations on automata that will produce new
automata.
|
| AutomatonSearchAction |
This is an action for searching components in an automaton.
|
| BuchiRepositoryAction |
This is an action for displaying automata in the local repository.
|
| BuchiStoreAction |
This is an action for displaying automata in Büchi Store.
|
| BuchiStoreUploaderAction |
This is an action that displays a dialog for uploading the active Büchi
automaton to the Büchi Store.
|
| CCJ09Actions |
This class contains several actions provided by translation algorithm in [CCJ09].
|
| CCJ09Actions.QPTL2NBWAction |
This is an action that translates a QPTL formula into an equivalent NBW
by the translation algorithm in [CCJ09].
|
| CheckUpdateAction |
This is an action for checking if there is a newer version of GOAL available.
|
| ClassicalMinimizationAction |
This is an action that minimizes a classic finite state automaton.
|
| ClassicComplementAction |
This is an action for complementing a classic finite state automaton.
|
| ClearAllRecentFileAction |
This is an action for clearing the list of recent files.
|
| ClickButtonAction |
This is an action that clicks a button.
|
| CloseActiveTabAction |
This is an action for closing the active tab of a window.
|
| CloseAllTabsAction |
This is an action for closing all tabs of a window.
|
| ClosureAction |
This is an action for taking the closure of an NFW or an NBW.
|
| ConcatenationAction |
This is an action that concatenates two automata.
|
| ContainmentAction |
This is an action that tests if an automaton A is contained in another
automaton B by constructing the intersection of A and the complement of B
explicitly and checking if the intersection is empty.
|
| ContractAlphabetAction |
This is an action that removes an atomic proposition or a classical symbol
from the alphabet of an automaton.
|
| ConvertAction |
This is an action that converts an automaton into other types of automata.
|
| ConvertAlphabetTypeAction |
This is an action that opens a dialog for entering the mapping between two
alphabet types and converts the alphabet type of the active automaton.
|
| ConvertAlternationStyleAction |
This is an action that converts the alternation style of an alternating
automaton.
|
| ConvertLabelPositionAction |
This class provides a conversion of label positions.
|
| ConvertToComplementABWAction |
This is an action that converts a NCW into a complement ABW.
|
| ConvertToComplementACWAction |
This is an action that converts a NBW into a complement ACW.
|
| ConvertToComplementAPWAction |
This is an action that converts an APW into a complement APW.
|
| ConvertToComplementDBWAction |
This is an action that converts a DCW into a complement DBW.
|
| ConvertToComplementDCWAction |
This is an action that converts a DBW into a complement DCW.
|
| ConvertToComplementDMWAction |
This is an action that converts a DMW into a complement DMW.
|
| ConvertToComplementDPWAction |
This is an action that converts a DPW into a complement DPW.
|
| ConvertToComplementDRWAction |
This is an action that converts a DSW into a complement DRW.
|
| ConvertToComplementDSWAction |
This is an action that converts a DRW into a complement DSW.
|
| ConvertToDBWByBK09Action |
This is an action that converts an automaton into an equivalent DBW through
DCW by the approach in [BK09].
|
| ConvertToDBWByDEK07Action |
|
| ConvertToDBWByLandweberAction |
This is an action that converts an automaton into an equivalent DBW through
DMW by the approach in [Lan69].
|
| ConvertToHOAAction |
This is an action that converts an automaton into an equivalent Hanoi
automaton.
|
| ConvertToNBGAction |
This is an action that converts a game into an equivalent NBG.
|
| ConvertToNBWAction |
This is an action that converts an automaton into an equivalent NBW.
|
| ConvertToNCGAction |
This is an action that converts a game into an equivalent NCG.
|
| ConvertToNCWAction |
This is an action that converts an automaton into an equivalent NCW (if the
source automaton is NCW-recognizable) or a larger NCW (in language).
|
| ConvertToNGBGAction |
This is an action that converts a game into an equivalent NGBG.
|
| ConvertToNGBWAction |
This is an action that converts an automaton into an equivalent NGBW.
|
| ConvertToNMGAction |
This is an action that converts a game into an equivalent NMG.
|
| ConvertToNMWAction |
This is an action that converts an automaton into an equivalent NMW.
|
| ConvertToNPGAction |
This is an action that converts a game into an equivalent NPG.
|
| ConvertToNPWAction |
This is an action that converts an automaton into an equivalent NPW.
|
| ConvertToNRGAction |
This is an action that converts a game into an equivalent NRG.
|
| ConvertToNRWAction |
This is an action that converts an automaton into an equivalent NRW.
|
| ConvertToNSGAction |
This is an action that converts a game into an equivalent NSG.
|
| ConvertToNSWAction |
This is an action that converts an automaton into an equivalent NSW.
|
| ConvertToNTBWAction |
This is an action that converts an automaton into an equivalent NTBW.
|
| ConvertToNTGBWAction |
This is an action that converts an automaton into an equivalent NTGBW.
|
| ConvertToOmegaRegularExpressionAction |
This is an action that converts an ω-automaton into an equivalent
ω-regular expression.
|
| ConvertToRegularExpressionAction |
This is an action that converts a classic finite state automaton into an
equivalent regular expression.
|
| ConvertToWDBWAction |
|
| CopyAction |
This class provides an action for copying text in a formula editor or copying
states in an automaton editor.
|
| CopyAsGasTeXAction |
This class provides an action that can copy an automaton as LaTeX (GasTeX)
code.
|
| CopyAsPromelaAction |
This class provides an action that can copy an automaton as Promela code.
|
| CopyAsTikzAction |
This class provides an action that can copy an automaton as LaTeX (Tikz)
code.
|
| CopyAsVaucansonAction |
This class provides an action that can copy an automaton as LaTeX
(Vaucanson-G) code.
|
| CouvreurActions |
This class contains several actions provided by the Couvreur translators.
|
| CouvreurActions.QPTL2NBWAction |
This is an action that translates a QPTL formula into an equivalent NBW
by Couvreur's algorithm.
|
| CouvreurActions.QPTL2NTGBWAction |
This is an action that translates a QPTL formula into an equivalent NTGBW
by Couvreur's algorithm.
|
| CutAction |
This class provides an action for cutting text in a formula editor.
|
| DebugCoreAction |
This is an action that toggles the logging of debugging information produced
from the core package.
|
| DebugExceptionAction |
This is an action that toggles the option of throwing exceptions in the
console.
|
| DebugUIAction |
This is an action that toggles the display of UI debugging information.
|
| DelayedSimulatedAction |
This is an action for testing if a Büchi automaton is delayed simulated
by another Büchi automaton by the approach in [EWS01].
|
| DelayedSimulationAction |
This is an action for displaying the delayed simulation relation by the approach
in [EWS01].
|
| DelayedSimulationSimplificationAction |
This is an action that simplifies an NBW by a delayed simulation relation.
|
| DeleteAction |
This class provides an action for deleting selected automaton components or
selected text in a formula editor.
|
| DetachAction |
This is an action that moves the active tab to a new window.
|
| DeterministicAction |
This is an action that tests if an automaton is deterministic.
|
| DirectSimulatedAction |
This is an action for testing if a Büchi automaton is direct simulated
by another Büchi automaton.
|
| DisplayGridlinesAction |
This is an action that toggles the display of gridlines.
|
| DisplayGuidelinesAction |
This is an action that toggles the display of guidelines.
|
| DisposeAction |
This is an action that disposes a Window.
|
| DuplicateAction |
This is an action that duplicates the active automaton.
|
| EditableAction<I extends Editable,O> |
An EditableAction is an action applicable to some non-null editable
objects.
|
| EfficientSimulationAction |
This is an action for displaying the direct simulation relation computed by
the EfficientSimilarity procedure in [HHK95].
|
| EliminateEpsilonAction |
This class provides an action for eliminating ε-transitions of a
classic finite state automaton with a classical alphabet.
|
| EmptinessAction |
This is an action that checks the emptiness of an FSA.
|
| EquivalenceWithAutomatonAction |
This is an action that checks if two automata are equivalent.
|
| EquivalenceWithFormulaAction |
This is an action that checks if an automaton is equivalent to a QPTL
formula.
|
| ExitAction |
This is an action that terminates the GOAL process.
|
| ExpandAlphabetAction |
This is an action that expands the alphabet of the active automaton by a new
atomic proposition or classical symbol.
|
| ExportAction |
This is an action that exports the object in the active editor to another
file or another format.
|
| ExportMultipleAction |
This class provides an action that can export multiple objects in a single
file by GFFCollectionCodec. |
| ExtendedCouvreurActions |
This class contains several actions provided by the extended Couvreur translators.
|
| ExtendedCouvreurActions.QPTL2NBWAction |
This is an action that translates a QPTL formula into an equivalent NBW
by the extended Couvreur's algorithm.
|
| ExtendedCouvreurActions.QPTL2NTGBWAction |
This is an action that translates a QPTL formula into an equivalent NTGBW
by the extended Couvreur's algorithm.
|
| ExtendedGPVWActions |
This class contains several actions provided by the extended GPVW
translators.
|
| ExtendedGPVWActions.QPTL2LOSNBWAction |
This is an action that translates a QPTL formula into an equivalent
label-on-state NBW by extended GPVW.
|
| ExtendedGPVWActions.QPTL2LOSNGBWAction |
This is an action that translates a QPTL formula into an equivalent
label-on-state NGBW by extended GPVW.
|
| ExtendedGPVWActions.QPTL2NBWAction |
This is an action that translates a QPTL formula into an equivalent NBW
by extended GPVW.
|
| ExtendedGPVWActions.QPTL2NGBWAction |
This is an action that translates a QPTL formula into an equivalent NGBW
by extended GPVW.
|
| ExtendedGPVWActions.StepByStepQPTL2LOSNGBWAction |
This is an action that translates step-by-step a QPTL formula into an
equivalent label-on-state NGBW by extended GPVW.
|
| ExtendedGPVWPlusActions |
This class contains several actions provided by the extended GPVW+
translators.
|
| ExtendedGPVWPlusActions.QPTL2LOSNBWAction |
This is an action that translates a QPTL formula into an equivalent
label-on-state NBW by extended GPVW+.
|
| ExtendedGPVWPlusActions.QPTL2LOSNGBWAction |
This is an action that translates a QPTL formula into an equivalent
label-on-state NGBW by extended GPVW+.
|
| ExtendedGPVWPlusActions.QPTL2NBWAction |
This is an action that translates a QPTL formula into an equivalent NBW
by extended GPVW+.
|
| ExtendedGPVWPlusActions.QPTL2NGBWAction |
This is an action that translates a QPTL formula into an equivalent NGBW
by extended GPVW+.
|
| ExtendedGPVWPlusActions.StepByStepQPTL2LOSNGBWAction |
This is an action that translates step-by-step a QPTL formula into an
equivalent label-on-state NGBW by extended GPVW+.
|
| ExtendedLTL2AUTActions |
This class contains several actions provided by the extended LTL2AUT
translators.
|
| ExtendedLTL2AUTActions.QPTL2LOSNBWAction |
This is an action that translates a QPTL formula into an equivalent
label-on-state NBW by extended LTL2AUT.
|
| ExtendedLTL2AUTActions.QPTL2LOSNGBWAction |
This is an action that translates a QPTL formula into an equivalent
label-on-state NGBW by extended LTL2AUT.
|
| ExtendedLTL2AUTActions.QPTL2NBWAction |
This is an action that translates a QPTL formula into an equivalent NBW
by extended LTL2AUT.
|
| ExtendedLTL2AUTActions.QPTL2NGBWAction |
This is an action that translates a QPTL formula into an equivalent NGBW
by extended LTL2AUT.
|
| ExtendedLTL2AUTActions.StepByStepQPTL2LOSNGBWAction |
This is an action that translates step-by-step a QPTL formula into an
equivalent label-on-state NGBW by extended LTL2AUT.
|
| ExtendedLTL2AUTPlusActions |
This class contains several actions provided by extended LTl2AUT+.
|
| ExtendedLTL2AUTPlusActions.QPTL2LOSNBWAction |
This is an action that translates a QPTL formula into an equivalent
label-on-state NBW by extended LTL2AUT+.
|
| ExtendedLTL2AUTPlusActions.QPTL2LOSNGBWAction |
This is an action that translates a QPTL formula into an equivalent
label-on-state NGBW by extended LTL2AUT+.
|
| ExtendedLTL2AUTPlusActions.QPTL2NBWAction |
This is an action that translates a QPTL formula into an equivalent NBW
by extended LTL2AUT+.
|
| ExtendedLTL2AUTPlusActions.QPTL2NGBWAction |
This is an action that translates a QPTL formula into an equivalent NGBW
by extended LTL2AUT+.
|
| ExtendedLTL2AUTPlusActions.StepByStepQPTL2LOSNGBWAction |
This is an action that translates step-by-step a QPTL formula into an
equivalent label-on-state NGBW by extended LTL2AUT+.
|
| ExtendedLTL2BuchiActions |
This class contains several actions provided by extended LTL2Buchi.
|
| ExtendedLTL2BuchiActions.QPTL2NBWAction |
This is an action that translates a QPTL formula into an equivalent NBW
by extended LTL2Buchi.
|
| ExtendedLTL2BuchiActions.QPTL2NTGBWAction |
This is an action that translates a QPTL formula into an equivalent NTGBW
by extended LTL2Buchi.
|
| ExtendedModellaActions |
This class contains several actions provided by the extended MoDeLLa
translators.
|
| ExtendedModellaActions.QPTL2LOSNBWAction |
This is an action that translates a QPTL formula into an equivalent
label-on-state NBW by extended MoDeLLa.
|
| ExtendedModellaActions.QPTL2LOSNGBWAction |
This is an action that translates a QPTL formula into an equivalent
label-on-state NGBW by extended MoDeLLa.
|
| ExtendedModellaActions.QPTL2NBWAction |
This is an action that translates a QPTL formula into an equivalent NBW
by extended MoDeLLa.
|
| ExtendedModellaActions.QPTL2NGBWAction |
This is an action that translates a QPTL formula into an equivalent NGBW
by extended MoDeLLa.
|
| ExtendedModellaActions.StepByStepQPTL2LOSNGBWAction |
This is an action that translates step-by-step a QPTL formula into an
equivalent label-on-state NGBW by extended MoDeLLa.
|
| FairSimulatedAction |
This is an action for testing if a Büchi automaton is fairly simulated
by another Büchi automaton by the approach in [EWS01] for
label-on-transition Büchi automata or by the approach in [GBS02] for
label-on-state Büchi automata.
|
| FairSimulationAction |
This is an action for displaying the fair simulation relation by the approach
in [EWS01] for label-on-transition Büchi automata or by the approach in
[GBS02] for label-on-state Büchi automata.
|
| FairSimulationSimplificationAction |
This is an action that simplifies a label-on-state NBW by a fair simulation
relation.
|
| FindElementaryCyclesAction |
This is an action that finds and displays all elementary cycles in the active
automaton.
|
| FindMSCCAction |
This is an action that finds and displays the maximal strongly connected
components of the active automaton.
|
| FindStateCyclesAction |
This is an action that finds and displays all (compact) cycles in the active
automaton.
|
| FindTransitionCyclesAction |
This is an action that finds and displays all cycles in the active automaton.
|
| FloatableToolbarAction |
This is an action that toggles the floatable state of tool bars.
|
| FSA2GameAction |
This class provides an action that can convert an automaton to a turn-based
game.
|
| FSAClassificationAction |
This is an action that classifies an automaton into the temporal hierarchy.
|
| FSAProductAction |
This class provides an action that takes the product of two FSAs.
|
| GameConversionAction |
This is an action that converts a game into other types of games.
|
| GameGenerationAction |
This is an action for generating games from inputs and outputs.
|
| GameProductAction |
This class provides an action that takes the product of a game and a finite
state automaton.
|
| HelpContentsAction |
This is an action that displays the help content.
|
| HierarchyComplementAction |
This is an action that complements an NBW by a hierarchical construction.
|
| HomomorphismAction |
This is an action that checks if two automata are homomorphic.
|
| HopcroftMinimizationAction |
This is an action that minimizes a classic finite state automaton.
|
| ImportFromTextAction |
This is an action that can parse an editable object from a text.
|
| IncTableauActions |
This class contains several actions provided by the Incremental Tableau
translators.
|
| IncTableauActions.QPTL2LOSNBWAction |
This is an action that translates a QPTL formula into an equivalent
label-on-state NBW by Incremental Tableau.
|
| IncTableauActions.QPTL2LOSNGBWAction |
This is an action that translates a QPTL formula into an equivalent
label-on-state NGBW by Incremental Tableau.
|
| IncTableauActions.QPTL2NBWAction |
This is an action that translates a QPTL formula into an equivalent NBW
by Incremental Tableau.
|
| IncTableauActions.QPTL2NGBWAction |
This is an action that translates a QPTL formula into an equivalent NGBW
by Incremental Tableau.
|
| InputSimulatorAction |
This class provides an action that can display an input simulator of an
automaton on some word.
|
| InputTestAction |
This is an action that tests directly if an input sequence is accepted by an
automaton.
|
| IntersectionAction |
This is an action that takes the intersection of two automata.
|
| IsomorphismAction |
This is an action that checks if two automata are isomorphic.
|
| IsVeryWeakAction |
This is an action that test if an automaton is very weak or not.
|
| IsWeakAction |
This is an action that test if an NBW or an ABW is weak or not.
|
| KP02Actions |
This class contains several actions provided by KP02.
|
| KP02Actions.QPTL2NBWAction |
This is an action that translates a QPTL formula into an equivalent
Büchi automaton by KP02.
|
| KurshanComplementAction |
This is an action that complements an NBW by Kurshan's construction.
|
| LayoutAction |
This is an action that lays out the active automaton by a layout algorithm.
|
| LogicAction<I extends Logic,O> |
A LogicAction takes a FormulaHolder as the input.
|
| LTL2BAActions |
This class contains several actions provided by LTL2BA.
|
| LTL2BAActions.QPTL2NBWAction |
This is an action that translates a QPTL formula into an equivalent NBW
by LTL2BA.
|
| LTL2BAActions.QPTL2NTGBWAction |
This is an action that translates a QPTL formula into an equivalent NTGBW
by LTL2BA.
|
| LTL2BAActions.QPTL2VWAAAction |
This is an action that translates a QPTL formula into an equivalent VWAA
by LTL2BA.
|
| LTL2BuchiActions |
This class contains several actions provided by LTL2Buchi.
|
| LTL2BuchiActions.QPTL2NBWAction |
This is an action that translates a QPTL formula into an equivalent NBW
by LTL2Buchi.
|
| LTL2BuchiActions.QPTL2NTGBWAction |
This is an action that translates a QPTL formula into an equivalent NTGBW
by LTL2Buchi.
|
| MaximizeAcceptanceSetAction |
This is an action that maximizes the acceptance set of an NBW without
changing its language.
|
| MergeAction |
This is an action that merges another automaton to the active automaton.
|
| MergeStatesAction |
This class provides an action for merging selected states in an automaton.
|
| MinimizeAcceptanceSetAction |
This is an action that simplifies the acceptance set of an NBW without
changing its language.
|
| ModellaActions |
This class contains several actions provided by the MoDeLLa translators.
|
| ModellaActions.QPTL2LOSNBWAction |
This is an action that translates a QPTL formula into an equivalent
label-on-state NBW by MoDeLLa.
|
| ModellaActions.QPTL2LOSNGBWAction |
This is an action that translates a QPTL formula into an equivalent
label-on-state NGBW by MoDeLLa.
|
| ModellaActions.QPTL2NBWAction |
This is an action that translates a QPTL formula into an equivalent NBW
by MoDeLLa.
|
| ModellaActions.QPTL2NGBWAction |
This is an action that translates a QPTL formula into an equivalent NGBW
by MoDeLLa.
|
| ModellaActions.StepByStepQPTL2LOSNGBWAction |
This is an action that translates step-by-step a QPTL formula into an
equivalent label-on-state NGBW by MoDeLLa.
|
| ModifiedSafraComplementAction |
This is an action that complements an NBW by the modified Safra's
construction.
|
| ModifiedSafraContainmentAction |
This is an action that tests if an automaton is contained in another
automaton based on incremental modified Safra's construction.
|
| MoveTabAction |
This is an action that moves the active tab of a source window to a target
window.
|
| MoveToNextWindowAction |
This is an action that moves the active tab of a window to its next window.
|
| MoveToPreviousWindowAction |
This is an action that moves the active tab of a window to its previous
window.
|
| MSComplementAction |
This is an action that complements an NBW by Muller-Schupp construction.
|
| MSContainmentAction |
This is an action that tests if an automaton is contained in another
automaton based on incremental Muller-Schupp construction.
|
| NaiveSimulationAction |
This is an action that can display the direct simulation relation and the
reverse simulation relation defined in [SB00] based on a naive computation
procedure.
|
| NBWToDPWByPitermanAction |
This is an action that determinizes an NBW to a DPW by Safra-Piterman
construction.
|
| NBWToDRWByModifiedSafraAction |
This is an action that determinizes an NBW to a DRW by modified Safra's
construction.
|
| NBWToDRWByMSAction |
This is an action that determinizes an NBW to a DRW by Muller-Schupp
construction.
|
| NBWToDRWBySafraAction |
This is an action that determinizes an NBW to a DRW by Safra's construction.
|
| NegationNormalFormAction |
This class provides an action for converting a logic formula into negation
normal form.
|
| NewACTLAction |
This is an action that creates a new ACTL formula.
|
| NewCNFABWAction |
This is an action that creates a new alternating Büchi word automaton in
CNF.
|
| NewCNFACWAction |
This is an action that creates a new alternating co-Büchi word automaton
in CNF.
|
| NewCNFAGBWAction |
This is an action that creates a new alternating generalized Büchi word
automaton in CNF.
|
| NewCNFAMWAction |
This is an action that creates a new alternating Muller word automaton in
CNF.
|
| NewCNFAPWAction |
This is an action that creates a new alternating parity word automaton in
CNF.
|
| NewCNFARWAction |
This is an action that creates a new alternating Rabin word automaton in CNF.
|
| NewCNFASWAction |
This is an action that creates a new alternating Streett word automaton in
CNF.
|
| NewCNFTWABWAction |
This is an action that creates a new two-way alternating Büchi word
automaton in CNF.
|
| NewCNFTWACWAction |
This is an action that creates a new two-way alternating co-Büchi word
automaton in CNF.
|
| NewCNFTWAGBWAction |
This is an action that creates a new two-way alternating generalized
Büchi word automaton in CNF.
|
| NewCNFTWAMWAction |
This is an action that creates a new two-way alternating Muller word
automaton in CNF.
|
| NewCNFTWAPWAction |
This is an action that creates a new two-way alternating parity word
automaton in CNF.
|
| NewCNFTWARWAction |
This is an action that creates a new two-way alternating Rabin word automaton
in CNF.
|
| NewCNFTWASWAction |
This is an action that creates a new two-way alternating Streett word
automaton in CNF.
|
| NewDNFABWAction |
This is an action that creates a new alternating Büchi word automaton in
DNF.
|
| NewDNFACWAction |
This is an action that creates a new alternating co-Büchi word automaton
in DNF.
|
| NewDNFAGBWAction |
This is an action that creates a new alternating generalized Büchi word
automaton in DNF.
|
| NewDNFAMWAction |
This is an action that creates a new alternating Muller word automaton in
DNF.
|
| NewDNFAPWAction |
This is an action that creates a new alternating parity word automaton in
DNF.
|
| NewDNFARWAction |
This is an action that creates a new alternating Rabin word automaton in DNF.
|
| NewDNFASWAction |
This is an action that creates a new alternating Streett word automaton in
DNF.
|
| NewDNFTWABWAction |
This is an action that creates a new two-way alternating Büchi word
automaton in DNF.
|
| NewDNFTWACWAction |
This is an action that creates a new two-way alternating co-Büchi word
automaton in DNF.
|
| NewDNFTWAGBWAction |
This is an action that creates a new two-way alternating generalized
Büchi word automaton in DNF.
|
| NewDNFTWAMWAction |
This is an action that creates a new two-way alternating Muller word
automaton in DNF.
|
| NewDNFTWAPWAction |
This is an action that creates a new two-way alternating parity word
automaton in DNF.
|
| NewDNFTWARWAction |
This is an action that creates a new two-way alternating Rabin word automaton
in DNF.
|
| NewDNFTWASWAction |
This is an action that creates a new two-way alternating Streett word
automaton in DNF.
|
| NewEditableAction |
This is an action that displays a dialog for selecting the type of object to
be created.
|
| NewHOAAction |
This is an action that creates a new Hanoi omega-automaton.
|
| NewNBGAction |
This is an action that creates a new nondeterministic Büchi game.
|
| NewNBWAction |
This is an action that creates a new nondeterministic Büchi word
automaton (NBW).
|
| NewNCGAction |
This is an action that creates a new nondeterministic co-Büchi game.
|
| NewNCWAction |
This is an action that creates a new nondeterministic co-Büchi word
automaton (NCW).
|
| NewNFGAction |
This is an action that creates a new nondeterministic classic game.
|
| NewNFWAction |
This is an action that creates a new nondeterministic classic finite word
automaton (NFW).
|
| NewNGBGAction |
This is an action that creates a new nondeterministic generalized Büchi
game.
|
| NewNGBWAction |
This is an action that creates a new nondeterministic generalized Büchi
word automaton (NGBW).
|
| NewNMGAction |
This is an action that creates a new nondeterministic Muller game.
|
| NewNMWAction |
This is an action that creates a new nondeterministic Muller word automaton
(NMW).
|
| NewNPGAction |
This is an action that creates a new nondeterministic parity game.
|
| NewNPWAction |
This is an action that creates a new nondeterministic parity word automaton
(NPW).
|
| NewNREGAction |
This is an action that creates a new nondeterministic reachability game.
|
| NewNREWAction |
This is an action that creates a new nondeterministic reachability automaton
(NREW).
|
| NewNRGAction |
This is an action that creates a new nondeterministic Rabin game.
|
| NewNRWAction |
This is an action that creates a new nondeterministic Rabin word automaton
(NRW).
|
| NewNSGAction |
This is an action that creates a new nondeterministic Streett game.
|
| NewNSWAction |
This is an action that creates a new nondeterministic Streett word automaton
(NSW).
|
| NewNTBWAction |
This is an action that creates a new nondeterministic transition Büchi
word automaton (NTBW).
|
| NewNTGBWAction |
This is an action that creates a new nondeterministic transition generalized
Büchi word automaton (NTGBW).
|
| NewNTMWAction |
This is an action that creates a new nondeterministic transition Muller word
automaton (NTMW).
|
| NewNTPWAction |
This is an action that creates a new nondeterministic transition parity word
automaton (NTPW).
|
| NewNTRWAction |
This is an action that creates a new nondeterministic transition Rabin word
automaton (NTRW).
|
| NewNTSWAction |
This is an action that creates a new nondeterministic transition Streett word
automaton (NTSW).
|
| NewOmegaRegularExpressionAction |
This is an action that creates a new ω-regular expression.
|
| NewQPTLAction |
This is an action that creates a new QPTL formula.
|
| NewRandomEditableAction |
This is an action that creates a random automaton.
|
| NewRandomFSAAction |
This is an action that creates a random finite state automaton.
|
| NewRandomGameAction |
This is an action that creates a random game.
|
| NewRandomQPTLAction |
This is an action that creates a random QPTL formula.
|
| NewRegularExpressionAction |
This is an action that creates a new regular expression.
|
| NewWindowAction |
This is an action that creates a new window.
|
| NextTabAction |
This is an action that makes the next tab active.
|
| NextWindowAction |
This is an action that makes the next window active.
|
| NFWToDFWAction |
This is an action that determinizes a classic automaton to another classic
automaton.
|
| OmegaAction |
This is an action that creates a nondeterministic Büchi automaton from a
classic finite state automaton.
|
| OmegaRegularExpressionTranslationAction |
This class provides an action that can translate an ω-regular
expression to a Büchi automaton.
|
| OpenAction |
This is an action that opens a file as an editable object.
|
| OpenAllRecentFileAction |
This is an action that opens all recent files.
|
| OpenRecentFileAction |
This is an action that opens a recent file.
|
| ParityCompressionAction |
This is an action for compressing a parity acceptance condition.
|
| ParityInterpretationAction |
This is an action that converts a parity condition under an interpretation to
an equivalent parity condition under another interpretation.
|
| ParityPropagationAction |
This is an action for propagating parities of states in a parity acceptance
condition.
|
| PasteAction |
This class provides an action for pasting text to a formula editor or pasting
states to an automaton.
|
| PastFutureSeparationAction |
This class provides an action for separating the past operators and the
future operators in a QPTL formula.
|
| PitermanComplementAction |
This is an action that complements an NBW by Safra-Piterman construction.
|
| PitermanContainmentAction |
This is an action that tests if an automaton is contained in another
automaton based on incremental Safra-Piterman construction.
|
| PLTL2BAActions |
This class contains several actions provided by PLTL2BA.
|
| PLTL2BAActions.QPTL2NBWAction |
This is an action that translates a QPTL formula into an equivalent NBW
by PLTL2BA.
|
| PLTL2BAActions.QPTL2NTGBWAction |
This is an action that translates a QPTL formula into an equivalent NTGBW
by PLTL2BA.
|
| PLTL2BAActions.QPTL2TWVWAAAction |
This is an action that translates a QPTL formula into an equivalent 2VWAA
by PLTL2BA.
|
| PMT02Actions |
This class contains several actions provided by the tableau construction in
[PMT02].
|
| PMT02Actions.ACTL2LOSNBWAction |
This is an action that translates an ACTL formula into an equivalent
label-on-state NBW by the tableau construction in [PMT02].
|
| PMT02Actions.ACTL2LOSNGBWAction |
This is an action that translates an ACTL formula into an equivalent
label-on-state NGBW by the tableau construction in [PMT02].
|
| PMT02Actions.ACTL2NBWAction |
This is an action that translates an ACTL formula into an equivalent NBW
by the tableau construction in [PMT02].
|
| PMT02Actions.ACTL2NGBWAction |
This is an action that translates an ACTL formula into an equivalent NGBW
by the tableau construction in [PMT02].
|
| PreferenceAction |
This is an action that opens the preference dialog.
|
| PrenexNormalFormAction |
This class provides an action for converting a logic formula into prenex
normal form.
|
| PreviousTabAction |
This is an action that makes the previous tab active.
|
| PreviousWindowAction |
This is an action that makes the previous window active.
|
| PrintAction |
This is an action that prints an editable object.
|
| ProgressMeasureComplementAction |
This is an action that complements an NBW by rank-based construction.
|
| PromelaAction |
This is an action that creates a dialog for displaying the Promela code of an
NBW.
|
| PropertyEditorAction |
This is an action that toggles the visibility of the property editor.
|
| PruningFairSetsAction |
This is an action that simplifies an NGBW by pruning fair sets proposed in
[Somenzi and Bloom.
|
| QPTL2BAActions |
This class contains several actions provided by QPTL2BA.
|
| QPTL2BAActions.CanonicalQPTL2TWACWAction |
This is an action that translates a QPTL formula in canonical forms into
an equivalent two-way alternating co-Büchi automaton by QPTL2BA.
|
| QPTL2BAActions.FutureQPTL2ABWAction |
This is an action that translates a QPTL formula without past operators
into an equivalent alternating Büchi automaton by QPTL2BA.
|
| QPTL2BAActions.QPTL2NBWAction |
This is an action that translates a QPTL formula into an equivalent NBW
by QPTL2BA.
|
| QPTLLanguageClassificationAction |
This is an action that classifies the language of a QPTL formula into the
Temporal Hierarchy via translation to automata.
|
| QPTLSyntaxClassificationAction |
This is an action that classifies an LTL formula into standard
κ-formulae via syntax check where κ is safety, guarantee,
obligation, recurrence, persistence, or reactivity.
|
| RabinIndexSimplificationAction |
This is an action that simplifies the acceptance condition of an NPW by Rabin
index.
|
| RamseyComplementAction |
This is an action that complements an NBW by Ramsey-based construction.
|
| RankComplementAction |
This is an action that complements an NBW by rank-based construction.
|
| RecentFilesAction |
This is an action that displays a dialog containing the list of recent files.
|
| RedoAction |
This is an action that performs a redo.
|
| ReduceAltConnectorsAction |
This is an action that removes or merges unnecessary alternating connectors
from an alternating automaton.
|
| ReducedSplitTreeAction |
This class provides an action that can display a reduced split tree of an
automaton on some word.
|
| ReduceStatesAction |
This is an action that removes unreachable and dead states from an automaton.
|
| RefinedSimulationAction |
This is an action for displaying the direct simulation relation computed by
the RefinedSimilarity procedure in [HHK95].
|
| RegularExpressionTranslationAction |
This class provides an action that can translate a regular expression to a
classic finite state automaton.
|
| RenamePropositionAction |
This is an action that renames an atomic proposition or a classical symbol in
the alphabet of an automaton.
|
| ReplacementAction |
This class provides an action for the replacement of strings represented as
classic finite automata.
|
| RepositionAction |
This is an action that repositions the object in the active editor.
|
| ResetAccAction |
This is an action that resets the acceptance condition of an automaton.
|
| ReverseNFWAction |
This is an action that reverses a classic finite state automaton.
|
| RunDagAction |
This class provides an action that can display a run dag of an automaton on
some word.
|
| RunTreeAction |
This class provides an action that can display a run tree of an automaton on
some word.
|
| SafraComplementAction |
This is an action that complements an NBW by Safra's construction.
|
| SafraContainmentAction |
This is an action that tests if an automaton is contained in another
automaton based on incremental Safra's construction.
|
| SatisfiabilityAction |
This class provides an action for testing if a logic formula is satisfiable.
|
| SaveAction |
This is an action that saves the object in the active editor to a file.
|
| SaveAllAction |
This is an action that saves objects in all editors to files.
|
| SaveAsAction |
This is an action that saves the object in the active editor to another file
or another format.
|
| SchematicSimulationAction |
This is an action for displaying the direct simulation relation computed by
the SchematicSimilarity1 procedure in [HHK95].
|
| SDBWComplementAction |
This is an action that complements a semi-deterministic Büchi automaton.
|
| SelectAllAction |
This is an action that selects all states and transitions of an automaton.
|
| SemanticallyDeterministicAction |
This is an action that tests if an automaton is semantically deterministic,
that is, equivalent to some deterministic Büchi automaton.
|
| SemiDeterministicAction |
This is an action that tests if a Büchi automaton is semi-deterministic.
|
| ShowAtomicPropositionsAction |
This is an action that displays the atomic propositions or classical symbols
in the alphabet of an automaton.
|
| SimplifyFormulaAction |
This is an action that simplifies logic formulae based on registered formula
rewriters.
|
| SimulationEquivalenceAction |
This is an action that tests if two automata are simulation equivalent.
|
| SimulationSimplificationAction |
This is an action that simplifies a finite state automaton by simulation
relations.
|
| SliceAntichainAction |
This is an action that tests if an automaton is contained in another
automaton based on slice-based antichain.
|
| SliceComplementAction |
This is an action that complements an NBW by slice-based construction.
|
| SliceContainmentAction |
This is an action that tests if an automaton is contained in another
automaton based on incremental slice-based construction.
|
| SnapToGridAction |
This is an action that toggles the option of snapping states to grid.
|
| SolveGameAction |
This is an action for solving games.
|
| SplitTreeAction |
This class provides an action that can display a split tree of an automaton
on some word.
|
| StepByStepHierarchyComplementAction |
This is an action that step-by-step complements an NBW by the hierarchical
construction HierarchyConstruction. |
| StepByStepModifiedSafraComplementAction |
This is an action that step-by-step complements an NBW by the modified
Safra's construction.
|
| StepByStepMSComplementAction |
This is an action that step-by-step complements an NBW by Muller-Schupp
construction.
|
| StepByStepPitermanComplementAction |
This is an action that step-by-step complements an NBW by Safra-Piterman
construction.
|
| StepByStepRankComplementAction |
This is an action that step-by-step complements an NBW by rank-based
construction.
|
| StepByStepSafraComplementAction |
This is an action that step-by-step complements an NBW by Safra's
construction.
|
| StepByStepSDBWComplementAction |
This is an action that step-by-step complements an SDBW.
|
| StepByStepSliceComplementAction |
This is an action that step-by-step complements an NBW by slice-based
construction.
|
| StepByStepSolveGameAction |
This is an action for solving games step-by-step.
|
| StepByStepWAAComplementAction |
This is an action that step-by-step complements an NBW by the WAA
construction.
|
| StepByStepWAPAComplementAction |
This is an action that step-by-step complements an NBW by WAPA construction.
|
| SubsetAction |
This class provides an action that performs subset construction.
|
| TableauActions |
This class contains several actions provided by the Tableau translators.
|
| TableauActions.QPTL2LOSNBWAction |
This is an action that translates a QPTL formula into an equivalent
label-on-state NBW by Tableau.
|
| TableauActions.QPTL2LOSNGBWAction |
This is an action that translates a QPTL formula into an equivalent
label-on-state NGBW by Tableau.
|
| TableauActions.QPTL2NBWAction |
This is an action that translates a QPTL formula into an equivalent NBW
by Tableau.
|
| TableauActions.QPTL2NGBWAction |
This is an action that translates a QPTL formula into an equivalent NGBW
by Tableau.
|
| TableauActions.StepByStepQPTL2LOSNGBWAction |
This is an action that translates step-by-step a QPTL formula into an
equivalent label-on-state NGBW by Tableau.
|
| TemporalTesterActions |
This class contains several actions provided by the Temporal Tester
translators.
|
| TemporalTesterActions.QPTL2LOSNBWAction |
This is an action that translates a QPTL formula into an equivalent
label-on-state NBW by Temporal Tester.
|
| TemporalTesterActions.QPTL2LOSNGBWAction |
This is an action that translates a QPTL formula into an equivalent
label-on-state NGBW by Temporal Tester.
|
| TemporalTesterActions.QPTL2NBWAction |
This is an action that translates a QPTL formula into an equivalent NBW
by Temporal Tester.
|
| TemporalTesterActions.QPTL2NGBWAction |
This is an action that translates a QPTL formula into an equivalent NGBW
by Temporal Tester.
|
| UnambiguousAction |
This is an action that tests if a Bü automaton is unambiguous.
|
| UndoAction |
This is an action that performs an undo.
|
| UnionAction |
This is an action that takes the union of two automata.
|
| ValidityAction |
This class provides an action for testing if a logic formula is valid.
|
| WAAComplementAction |
This is an action that complements an NBW by WAA construction.
|
| WAPAComplementAction |
This is an action that complements an NBW by WAPA construction.
|
| WindowAction<T> |
This class provides actions in GOAL windows.
|
| WringOptimizationAction |
This is an action that simplifies an NGBW by the Wring approach proposed in
[Somenzi and Bloom.
|
| ZoomActions |
This class provides several actions for changing the zoom level.
|
| ZoomActions.CustomZoomAction |
This is an action that can zoom in/out an automaton with a custom zoom
level.
|
| ZoomActions.Zoom100Action |
This is an action that sets the zoom level to 100%.
|
| ZoomActions.Zoom125Action |
This is an action that sets the zoom level to 125%.
|
| ZoomActions.Zoom150Action |
This is an action that sets the zoom level to 150%.
|
| ZoomActions.Zoom175Action |
This is an action that sets the zoom level to 175%.
|
| ZoomActions.Zoom200Action |
This is an action that sets the zoom level to 200%.
|
| ZoomActions.Zoom50Action |
This is an action that sets the zoom level to 50%.
|
| ZoomActions.Zoom75Action |
This is an action that sets the zoom level to 75%.
|
| ZoomActions.ZoomAutoAction |
This is an action that sets the zoom level to auto.
|