Labeled Transition Systems with State Attributes
A Labeled Transition System with Attributes on states (LTSA) is 6-uple (Q,L,A,I,a,R)
where
Q
is a set of state identifiersL
is a set of transition labelsA
is a set of state attributesI
is a subset of Q
giving the initial statesa
is function from Q
to A
associating a state to its attributeR
is the transition relation, defined as a subset of QxLxQ
type Utils.Dot.graph_style +=
| Circular
Circular layout (circo); default is layered
| NoAttr
Do not draw state attributes
| NoLabel
Do not draw transition label
Extension to the Dot.graph_style
type for drawing LTSAs
Input signatures of the functor Ltsa.Make
.
Signature of the module describing state identifiers
Signature of the module describing transition labels
module type ATTR = sig ... end
Signature of the module describing state attributes
module type T = sig ... end
Functor building an implementation of the LTSA structure given an implementation of state identifiers, transition labels and state attributes
Functor for converting a LTSA, with a given implementation of state identifiers, transition labels and state attributes into another one with different respective implementations
Functor for computing the external product, in different flavors, of two LTSA
Functor for computing the external product, in different flavors, of three LTSA
module type Merge = sig ... end
Signature of the second argument for the IProduct
functor
Functor for computing the internal product, in different flavors, of two LTSA
module type Merge3 = sig ... end
Signature of the second argument for the IProduct3
functor
Functor for computing the "internal" product, in different flavors, of three LTSA