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

twagraph: merge_edge() can determinize automata

Browse source 
Reported by František Blahoudek.

* spot/twa/twagraph.cc: Reset prop_universal() if edges are merged in
a non-deterministic automaton.
* tests/core/det.test: Add test case.
* NEWS: Mention the issue.
This commit is contained in:
Alexandre Duret-Lutz 2019-12-31 22:34:39 +01:00
parent 383d1c003c
commit 265332dedf
3 changed files with 40 additions and 1 deletions
Download patch file Download diff file Expand all files Collapse all files

9
NEWS
View file

@ -5,6 +5,15 @@ New in spot 2.8.4.dev (not yet released)
- ltl2tgba -B could return automata with "t" acceptance, instead
of the expected Inf(0).
- twa_graph::merge_edges() (a.k.a. autfilt --merge-transitions) was
unaware that merging edges can sometimes transform a
non-deterministic automaton into a deterministic one, causing the
following unexpected diagnostic:
"print_hoa(): automaton is universal despite prop_universal()==false"
The kind of non-deterministic automata where this occurs is not
naturally produced by any Spot algorithm, but can be found for
instance in automata produced by Goal 2015-10-18.
New in spot 2.8.4 (2019-12-08)
Bugs fixed: