package electrod

You can search for identifiers within the package.

in-package search v0.2.0

On This Page

Parameters
Signature

package electrod

electrod.libelectrod
- Libelectrod
  - Ast
  - Ast_to_elo
  - Atom
  - Domain
  - Elo
    
    fold
    
    map
  - Elo_recursor
    
    recursor
  - Elo_to_ltl1
    
    Make
    
    Ltl
    
    Atomic
    
    Infix
    
    converter
    
    environment
  - Elo_to_ltl_intf
    
    S
  - Elo_to_model1
    
    Make
    
    ConvertFormulas
    
    Ltl
    
    Atomic
    
    Infix
    
    Model
  - Elo_to_smv1
    
    Elo_to_SMV_LTL
    
    converter
    
    environment
    
    Elo_to_SMV_model
    
    SMV_LTL
    
    Atomic
    
    Infix
    
    SMV_atom
    
    SMV_file_format
  - Exp_bounds
  - Fmtc
    
    Dump
  - Gen_goal
    
    fold
    
    map
  - Gen_goal_recursor
    
    recursor
  - Instance
  - Intf
    
    COMPARE
    
    Print
    
    Mixin
    
    M
    
    S
  - Invar_computation
  - Location
  - Msg
    
    Extract
    
    Fatal
    
    LoggingSetup
    
    Warn
  - Name
    
    Map
  - Outcome
  - Parser
  - Parser_main
  - Raw
  - Raw_ident
  - Raw_to_ast
  - Relation
  - Scanner
  - Scope
  - Scripts
  - Shortnames
  - Simplify1
    
    simplify
  - Simplify2
    
    simplify
  - Smv
    
    Make_SMV_LTL
    
    At
    
    Infix
    
    Make_SMV_file_format
    
    Ltl
    
    Atomic
    
    Infix
  - Smv_trace_parser
    
    Make
    
    D
  - Smv_trace_scanner
  - Smv_trace_tokens
  - Solver
    
    ATOMIC_PROPOSITION
    
    LTL
    
    Atomic
    
    Infix
    
    LTL_from_Atomic
    
    At
    
    Infix
    
    MODEL
  - Symbol
  - Symmetry
  - Transfo
  - Tuple
    
    Set
  - Tuple_set
  - Var

Legend:
Library
Module
Module type
Parameter
Class
Class type

Builds an LTL implementation out of an implementation of atomicic propositions.

Parameters

module At : ATOMIC_PROPOSITION

Signature

module Atomic = At

type tcomp =

| Lte
| Lt
| Gte
| Gt
| Eq
| Neq

type t = private

| Comp of tcomp * term * term
| True
| False
| Atomic of Atomic.t
| Not of t
| And of t * t
| Or of t * t
| Imp of t * t
| Iff of t * t
| Xor of t * t
| Ite of t * t * t
| X of t
| F of t
| G of t
| Y of t
| O of t
| H of t
| U of t * t
| R of t * t
| S of t * t
| T of t * t

and term = private

| Num of int
| Plus of term * term
| Minus of term * term
| Neg of term
| Count of t list

val true_ : t

val false_ : t

val atomic : Atomic.t -> t

val not_ : t -> t

val and_ : t -> t Stdlib.Lazy.t -> t

val or_ : t -> t Stdlib.Lazy.t -> t

val implies : t -> t Stdlib.Lazy.t -> t

val xor : t -> t -> t

val iff : t -> t -> t

val conj : t list -> t

val disj : t list -> t

val wedge : range:'a Iter.t -> ('a -> t Stdlib.Lazy.t) -> t

val vee : range:'a Iter.t -> ('a -> t Stdlib.Lazy.t) -> t

val ifthenelse : t -> t -> t -> t

val next : t -> t

val always : t -> t

val eventually : t -> t

val yesterday : t -> t

val once : t -> t

val historically : t -> t

val until : t -> t -> t

val releases : t -> t -> t

val since : t -> t -> t

val triggered : t -> t -> t

val num : int -> term

val plus : term -> term -> term

val minus : term -> term -> term

val neg : term -> term

val count : t list -> term

val comp : tcomp -> term -> term -> t

val lt : tcomp

val lte : tcomp

val gt : tcomp

val gte : tcomp

val eq : tcomp

val neq : tcomp

module Infix : sig ... end

val pp : Stdlib.Format.formatter -> t -> unit

val pp_gather_variables : 
  ?next_is_X:bool ->
  Atomic.t Iter.t Stdlib.ref ->
  Stdlib.Format.formatter ->
  t ->
  unit