alarsyo/spot
1
0
Fork 0
Code Issues Pull requests Projects Releases Wiki Activity

Rewrite F(a M b) as F(a & b), and G(a W b) as G(a | b).

Browse source 
* src/ltlvisit/simplify.cc: Implement these rules.
* src/ltltest/reduccmp.test: Add tests.
* doc/tl/tl.tex: Document them.
This commit is contained in:
Alexandre Duret-Lutz 2012-01-11 11:15:54 +01:00
parent 212c7ebdd7
commit 54d4a0a093
3 changed files with 65 additions and 16 deletions
Download patch file Download diff file Expand all files Collapse all files

7
src/ltltest/reduccmp.test
View file

@ -1,4 +1,4 @@
#! /bin/sh
#! /bin/sh
# Copyright (C) 2009, 2010, 2011, 2012 Laboratoire de Recherche et Developpement
# de l'Epita (LRDE).
# Copyright (C) 2004, 2006 Laboratoire d'Informatique de Paris 6 (LIP6),
@ -166,6 +166,11 @@ for x in ../reduccmp ../reductaustr; do
run 0 $x 'a R (!a M a)' '0'
run 0 $x 'a W (!a M a)' 'Ga'
run 0 $x 'F(a U b)' 'Fb'
run 0 $x 'F(a M b)' 'F(a & b)'
run 0 $x 'G(a R b)' 'Gb'
run 0 $x 'G(a W b)' 'G(a | b)'
# Syntactic implication
run 0 $x '(a & b) R (a R c)' '(a & b)R c'
run 0 $x 'a R ((a & b) R c)' '(a & b)R c'