Home | Trees | Indices | Help |
|
---|
|
Test if given formula belongs to an LTL fragment that is convertible to deterministic Buchi Automata (readily expressible in GR(1) ).
Functions | |||
|
|||
|
|||
|
|||
|
|||
GRSpec |
|
||
GRSpec |
|
||
GRSpec |
|
||
GRSpec |
|
Variables | |
logger = logging.getLogger(__name__)
|
|
__package__ = None hash(x) |
Function Details |
Return `GRSpec` from LTL formula `f` as `str`. Formula `f` must be in the form: A -> G where each of A, G is a conjunction of terms: `B`, `[]C`, `[]<>B`. For more details on `B, C`, see [split_gr1]. @type f: `str` @rtype: [GRSpec] |
Return `dict` of GR(1) subformulae. The formula `f` is assumed to be a conjunction of expressions of the form: `B`, `[]C` or `[]<>B` where: - `C` can contain "next" - `B` cannot contain "next" @param f: temporal logic formula @type f: `str` or AST @return: conjunctions of formulae A, B as `str`, grouped by keys: `'init', 'G', 'GF'` @rtype: `dict` of `str`: `list` of `str` |
Convert Warning: This conversion is sound, but not complete. See p.2, [E10] GR(1) form: !(aux) && [](aux -> X aux) && []<>(aux) && [](aux -> p)
|
Convert GR(1) form: []<>(aux) && []( (p && !q) -> X ! aux) && []( (! aux && !q) -> X ! aux)
|
Convert GR(1) form: !(aux) && [](aux -> X aux) && []<>(aux) && []( (!p && !aux) -> X!(aux) )
|
Convert GR(1) form: (!q -> !aux) && [](q -> aux) [](aux -> X aux) && []<>(aux) && []( (!aux && X(!q) ) -> X!(aux) ) && [](!aux -> p)
|
Home | Trees | Indices | Help |
|
---|
Generated by Epydoc 3.0.1 on Sat Nov 19 00:11:17 2016 | http://epydoc.sourceforge.net |