Package io.github.contractautomata.catlib.automaton
The automaton package contains the class implementing an automaton.
Each
To be composable, an Automaton implements the interface
Contract Automata have special labels, implemented inside the package labels. Contract Automata have been introduced (and formalised) in :
Each
Automaton has a set of transitions, a set of states, an initial state and a set of final states.To be composable, an Automaton implements the interface
Ranked. The rank is the number of components contained in the automaton.Contract Automata have special labels, implemented inside the package labels. Contract Automata have been introduced (and formalised) in :
- Basile, D., et al. 2016. Automata for specifying and orchestrating service contracts. Logical methods in computer science, 12. https://doi.org/10.2168/LMCS-12(4:6)2016
-
Interface Summary Interface Description Ranked This interface is implemented by ranked elements. -
Class Summary Class Description Automaton<S1,L1,S extends State<S1>,T extends Transition<S1,L1,S,? extends Label<L1>>> This class implements an automaton.