module Ltsa:sig
..end
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 +=
| |
NoLabel |
|||
| |
NoAttr |
|||
| |
Circular |
(* |
Circular layout (circo); default is layered
| *) |
Dot.graph_style
type for drawing LTSAsmodule type STATE = Utils.OrderedTypeExt.T
module type LABEL = Utils.OrderedTypeExt.T
module type ATTR =sig
..end
module type T =sig
..end
Ltsa.Make
.
module Make(
S
:
STATE
)
(
L
:
LABEL
)
(
A
:
ATTR
)
:T
with type state = S.t and type label = L.t and type attr = A.t
module Trans(
S1
:
T
)
(
S2
:
T
)
:sig
..end
module Product(
S1
:
T
)
(
S2
:
T
)
:sig
..end
module Product3(
S1
:
T
)
(
S2
:
T
)
(
S3
:
T
)
:sig
..end
module type Merge =sig
..end
Ltsa.IProduct
functor
module IProduct(
S
:
T
)
(
M
:
Merge
with type state=S.state and type label=S.label and type attr=S.attr
)
:sig
..end
module type Merge3 =sig
..end
Ltsa.IProduct3
functor
module IProduct3(
S
:
T
)
(
M
:
Merge3
with type state=S.state and type label=S.label and type attr=S.attr
)
:sig
..end