module Promelaast:The abstract tree of promela representation. Such tree is used by promela parser/lexer before its translation into Data_for_ltl module.sig
..end
type
condition =
| |
POr of |
(* | Logical OR | *) |
| |
PAnd of |
(* | Logical AND | *) |
| |
PNot of |
(* | Logical NOT | *) |
| |
PCall of |
(* | Predicate modelling the call of an operation | *) |
| |
PReturn of |
(* | Predicate modelling the return of an operation | *) |
| |
PCallOrReturn of |
(* | Predicate modelling the call or the return of an operation | *) |
| |
PTrue |
(* | Logical constant TRUE | *) |
| |
PFalse |
(* | Logical constant FALSE | *) |
| |
PIndexedExp of |
(* | Variable introduced during ltl pre-process. It correponds to an expression lmanaged by the Data_for_ltl module. | *) |
type
state = {
|
name : |
(* | State name | *) |
|
mutable acceptation : |
(* | True iff state is an acceptation state | *) |
|
mutable init : |
(* | True iff state is an initial state | *) |
|
mutable nums : |
(* | Numerical ID of the state | *) |
type
trans = {
|
start : |
(* | Starting state of the transition | *) |
|
stop : |
(* | Ending state of the transition | *) |
|
cross : |
(* | Cross condition of the transition | *) |
|
mutable numt : |
(* | Numerical ID of the transition | *) |
typebuchautomata =
state list * trans list
type
funcStatus =
| |
Call |
| |
Return |