module Promelaast: sig
.. end
The abstract tree of promela representation. Such tree is used by promela parser/lexer before its translation into Data_for_aorai module.
type
condition =
| |
POr of condition * condition |
| |
PAnd of condition * condition |
| |
PNot of condition |
| |
PCall of string |
| |
PReturn of string |
| |
PCallOrReturn of string |
| |
PTrue |
| |
PFalse |
| |
PIndexedExp of string |
| |
PFuncParam of string * string * string list |
| |
PFuncReturn of string * string |
Promela parsed abstract syntax trees
type
state = {
}
Internal representation of a State from the Buchi automata.
type
trans = {
}
Internal representation of a transition from the Buchi automata.
type
buchautomata = state list * trans list
Internal representation of a Buchi automata : a list of states and a list of transitions.
type
funcStatus =
An operation can have two status: currently calling or returning.