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

sat-minimize: limit number of iterations

Browse source 
* src/tgbaalgos/dtbasat.cc, src/tgbaalgos/dtgbasat.cc: Compute the
actual number of reachable states in the produced automaton to prepare
the next iteration.
This commit is contained in:
Alexandre Duret-Lutz 2014-01-17 11:47:07 +01:00
parent e1be8e6e42
commit 1319ec0bad
2 changed files with 13 additions and 4 deletions
Download patch file Download diff file Expand all files Collapse all files

9
src/tgbaalgos/dtbasat.cc
View file

@ -1,5 +1,5 @@
// -*- coding: utf-8 -*-
// Copyright (C) 2013 Laboratoire de Recherche et Développement
// Copyright (C) 2013, 2014 Laboratoire de Recherche et Développement
// de l'Epita.
//
// This file is part of Spot, a model checking library.
@ -803,6 +803,8 @@ namespace spot
dtba_sat_synthetize(const tgba* a, int target_state_number,
bool state_based)
{
if (target_state_number == 0)
return 0;
trace << "dtba_sat_synthetize(..., states = " << target_state_number
<< ", state_based = " << state_based << ")\n";
dict d;
@ -834,6 +836,9 @@ namespace spot
dtba_sat_synthetize(prev ? prev : a, --n_states, state_based);
if (next == 0)
break;
else
n_states = stats_reachable(next).states;
delete prev;
prev = next;
}
@ -860,7 +865,7 @@ namespace spot
{
delete prev;
prev = next;
max_states = target - 1;
max_states = stats_reachable(next).states - 1;
}
}
return prev;

8
src/tgbaalgos/dtgbasat.cc
View file

@ -1,5 +1,5 @@
// -*- coding: utf-8 -*-
// Copyright (C) 2013 Laboratoire de Recherche et Développement
// Copyright (C) 2013, 2014 Laboratoire de Recherche et Développement
// de l'Epita.
//
// This file is part of Spot, a model checking library.
@ -947,6 +947,8 @@ namespace spot
dtgba_sat_synthetize(const tgba* a, unsigned target_acc_number,
int target_state_number, bool state_based)
{
if (target_state_number == 0)
return 0;
trace << "dtgba_sat_synthetize(..., acc = " << target_acc_number
<< ", states = " << target_state_number
<< ", state_based = " << state_based << ")\n";
@ -983,6 +985,8 @@ namespace spot
--n_states, state_based);
if (next == 0)
break;
else
n_states = stats_reachable(next).states;
delete prev;
prev = next;
}
@ -1011,7 +1015,7 @@ namespace spot
{
delete prev;
prev = next;
max_states = target - 1;
max_states = stats_reachable(next).states - 1;
}
}
return prev;