Commit cfa80ed8 by Alexandre Duret-Lutz

### tests: avoid some superfluous calls to remove_alternation()

`* tests/python/toweak.py: Here.`
parent f45112a2
 ... @@ -30,31 +30,21 @@ GF!b ... @@ -30,31 +30,21 @@ GF!b (b & GF!b) | (!b & FGb) (b & GF!b) | (!b & FGb) b | (a & XF(b R a)) | (!a & XG(!b U !a))""" b | (a & XF(b R a)) | (!a & XG(!b U !a))""" phi1 = phi1.split('\n') bdddict = spot.make_bdd_dict() def equivalent(a, phi): def equivalent(a, phi): negphi = spot.formula.Not(phi) negphi = spot.formula.Not(phi) nega = spot.dualize(a) nega = spot.dualize(a) a2 = spot.translate(phi, 'TGBA', 'SBAcc' ) return not (spot.translate(negphi).intersects(a) nega2 = spot.translate(negphi, 'TGBA', 'SBAcc') or spot.translate(phi).intersects(nega)) ra = spot.remove_alternation(a) ran = spot.remove_alternation(nega) return spot.product(spot.remove_alternation(a), nega2).is_empty()\ and spot.product(spot.remove_alternation(nega), a2).is_empty() def test_phi(phi): def test_phi(phi): a = spot.translate(phi, 'TGBA', 'SBAcc') a = spot.translate(phi, 'TGBA', 'SBAcc') a0 = spot.dualize(a) res = spot.to_weak_alternating(spot.dualize(a)) res = spot.to_weak_alternating(a0) assert equivalent(res, spot.formula.Not(spot.formula(phi))) assert equivalent(res, spot.formula.Not(spot.formula(phi))) for p in phi1: for p in phi1.split('\n'): print(p) test_phi(p) test_phi(p) phi2 = spot.formula("(G((F a) U b)) W a") phi2 = spot.formula("(G((F a) U b)) W a") a2 = spot.automaton(""" a2 = spot.automaton(""" HOA: v1 HOA: v1 ... @@ -99,5 +89,3 @@ State: 6 ... @@ -99,5 +89,3 @@ State: 6 """) """) a2 = spot.to_weak_alternating(a2) a2 = spot.to_weak_alternating(a2) assert equivalent(a2, phi2) assert equivalent(a2, phi2)
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!