/**
* Create a new color
* @return the newly created color
*/
public int newColor()
{
_nr_of_colors++;
//_color2state.resize(_nr_of_colors);
Ultility.resize(_color2state, _nr_of_colors);
if (_detailed)
{
//_color2states->resize(_nr_of_colors);
Ultility.resize(_color2states, _nr_of_colors);
}
return(_nr_of_colors - 1);
}
/**
* Constructor, get initial size of the coloring from DRA.
* @param dra the DRA
* @param detailed Keep detailed information on the equivalence classes?
*/
public Coloring(DRA dra, bool detailed) //=false
{
_nr_of_colors = 0;
_detailed = detailed;
_coloring = new List <int>();
Ultility.resize(_coloring, dra.size());
_color2state = new List <int>();
//_coloring.resize(dra.size());
if (_detailed)
{
_color2states = new List <BitSet>();
}
else
{
_color2states = null;
}
}
/**
* Calculates BitSet which specifies which states in the NBA
* only have accepting successors.
*/
public void calculateStatesWithAllSuccAccepting()
{
_allSuccAccepting = new BitSet();
BitSet result = _allSuccAccepting;
SCCs sccs = getSCCs();
List <bool> scc_all_final = new List <bool>();
Ultility.resize(scc_all_final, sccs.countSCCs());
for (int i = 0; i < scc_all_final.Count; i++)
{
scc_all_final[i] = false;
}
for (int i = sccs.countSCCs(); i > 0; --i)
{
// go backward in topological order...
int scc = (sccs.topologicalOrder())[i - 1];
BitSet states_in_scc = sccs[scc];
// check to see if all states in this SCC are final
scc_all_final[scc] = true;
//for (BitSetIterator it=BitSetIterator(states_in_scc);it!=BitSetIterator::end(states_in_scc);++it)
for (int it = BitSetIterator.start(states_in_scc); it != BitSetIterator.end(states_in_scc); it = BitSetIterator.increment(states_in_scc, it))
{
if (!_nba[it].isFinal())
{
scc_all_final[scc] = false;
break;
}
}
bool might_be_final = false;
if (scc_all_final[scc] == false)
{
if (states_in_scc.length() == 1)
{
// there is only one state in this scc ...
int state = states_in_scc.nextSetBit(0);
if (sccs.stateIsReachable(state, state) == false)
{
// ... and it doesn't loop to itself
might_be_final = true;
}
}
}
if (scc_all_final[scc] == true || might_be_final)
{
// Check to see if all successors are final...
bool all_successors_are_final = true;
BitSet scc_succ = sccs.successors(scc);
//for (BitSetIterator it=BitSetIterator(scc_succ); it!=BitSetIterator::end(scc_succ); ++it) {
for (int it = BitSetIterator.start(scc_succ); it != BitSetIterator.end(scc_succ); it = BitSetIterator.increment(scc_succ, it))
{
if (!scc_all_final[it])
{
all_successors_are_final = false;
break;
}
}
if (all_successors_are_final)
{
// Add all states in this SCC to the result-set
result.Or(states_in_scc);
if (might_be_final)
{
scc_all_final[scc] = true;
}
}
}
}
}
/** Calculate the stutter closure for the NBA, for all symbols.
* @param nba the NBA
*/
public static NBA stutter_closure(NBA nba)
{
APSet apset = nba.getAPSet_cp();
NBA nba_result_ptr = new NBA(apset);
NBA result = nba_result_ptr;
int element_count = apset.powersetSize();
Debug.Assert(nba.getStartState() != null);
int start_state = nba.getStartState().getName();
for (int i = 0; i < nba.size(); i++)
{
int st = result.nba_i_newState();
Debug.Assert(st == i);
if (st == start_state)
{
result.setStartState(result[st]);
}
if (nba[st].isFinal())
{
result[st].setFinal(true);
}
}
for (int i = 0; i < nba.size(); i++)
{
for (int j = 0; j < element_count; j++)
{
int st = result.nba_i_newState();
Debug.Assert(st == nba.size() + (i * element_count) + j);
result[st].addEdge(new APElement(j), result[i]);
result[st].addEdge(new APElement(j), result[st]);
}
}
List <List <BitSet> > reachable = new List <List <BitSet> >();
//reachable.resize(element_count);
Ultility.resize(reachable, element_count);
for (int j = 0; j < element_count; j++)
{
//NBAEdgeSuccessors edge_successor = new NBAEdgeSuccessors(new APElement(j));
SCCs scc = new SCCs();
GraphAlgorithms.calculateSCCs(nba, scc, true, new APElement(j)); //,edge_successor
reachable[j] = scc.getReachabilityForAllStates();
#if VERBOSE
std::cerr << "SCCs for " << APElement(j).toString(*apset) << std::endl;
std::cerr << scc << std::endl;
std::cerr << " Reachability: " << std::endl;
std::vector <BitSet>& reach = *reachable[j];
for (unsigned int t = 0; t < reach.size(); t++)
{
std::cerr << t << " -> " << reach[t] << std::endl;
}
std::cerr << " ---\n";
#endif
}
for (int i = 0; i < nba.size(); i++)
{
NBA_State from = result[i];
for (int j = 0; j < element_count; j++)
{
BitSet result_to = new BitSet();
BitSet to = nba[i].getEdge(new APElement(j));
//for (BitSetIterator it=BitSetIterator(*to);it!=BitSetIterator::end(*to);++it)
for (int it = BitSetIterator.start(to); it != BitSetIterator.end(to); it = BitSetIterator.increment(to, it))
{
int to_state = it;
// We can go directly to the original state
result_to.set(to_state);
// We can also go to the corresponding stutter state instead
int stutter_state = nba.size() + (to_state * element_count) + j;
result_to.set(stutter_state);
// ... and then we can go directly to all the states that are j-reachable from to
result_to.Union(reachable[j][to_state]);
}
from.getEdge(new APElement(j)).Assign(result_to);
}
}
//for (int i=0; i<reachable.size(); ++i) {
// delete reachable[i];
// }
return(nba_result_ptr);
}
