ReachableStates.h

Go to the documentation of this file.

 
/*
 * This file is part of Algorithms library toolkit.
 * Copyright (C) 2017 Jan Travnicek (jan.travnicek@fit.cvut.cz)
 
 * Algorithms library toolkit is free software: you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 
 * Algorithms library toolkit is distributed in the hope that it will be reachable,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 
 * You should have received a copy of the GNU General Public License
 * along with Algorithms library toolkit.  If not, see <http://www.gnu.org/licenses/>.
 */
 
#pragma once
 
#include <ext/algorithm>
 
#include <alib/deque>
#include <alib/set>
#include <alib/map>
 
#include <automaton/FSM/ExtendedNFA.h>
#include <automaton/FSM/CompactNFA.h>
#include <automaton/FSM/EpsilonNFA.h>
#include <automaton/FSM/NFA.h>
#include <automaton/FSM/DFA.h>
#include <automaton/TA/DFTA.h>
#include <automaton/TA/NFTA.h>
#include <automaton/TA/ArcFactoredDeterministicZAutomaton.h>
#include <automaton/TA/ArcFactoredNondeterministicZAutomaton.h>
 
namespace automaton {
 
namespace properties {
 
class ReachableStates {
public:
    template < class T >
    requires isDFA < T > || isNFA < T > || isEpsilonNFA < T > || isCompactNFA < T > || isExtendedNFA < T >
    static ext::set < typename T::StateType > reachableStates ( const T & fsm );
 
    template < class T >
    requires isMultiInitialStateNFA < T > || isMultiInitialStateEpsilonNFA < T >
    static ext::set < typename T::StateType > reachableStates ( const T & fsm );
 
    template < class T >
    requires isDFTA < T > || isNFTA < T >
    static ext::set < typename T::StateType > reachableStates ( const T & fta );
 
    template < class T >
    requires isAFDZA < T > || isAFNZA < T >
    static ext::set < typename T::StateType > reachableStates ( const T & afza );
};
 
template < class T >
requires isDFA < T > || isNFA < T > || isEpsilonNFA < T > || isCompactNFA < T > || isExtendedNFA < T >
ext::set < typename T::StateType > ReachableStates::reachableStates( const T & fsm ) {
    using StateType = typename T::StateType;
 
    // 1a
    ext::deque<ext::set<StateType>> Qi;
    Qi.push_back( ext::set<StateType>( ) );
    Qi.at( 0 ).insert ( fsm.getInitialState( ) );
 
    int i = 0;
 
    // 1bc
    do {
        i = i + 1;
 
        Qi.push_back( Qi.at( i - 1 ) );
 
        for( const auto & p : Qi.at( i - 1 ) )
            for( const auto & transition : fsm.getTransitionsFromState( p ) )
                Qi.at( i ).insert( transition.second );
 
    } while ( Qi.at( i ) != Qi.at( i - 1 ) );
 
    return Qi.at( i );
}
 
template < class T >
requires isMultiInitialStateNFA < T > || isMultiInitialStateEpsilonNFA < T >
ext::set < typename T::StateType > ReachableStates::reachableStates( const T & fsm ) {
    using StateType = typename T::StateType;
 
    // 1a
    ext::deque<ext::set<StateType>> Qi;
    Qi.push_back( ext::set<StateType>( ) );
    Qi.at( 0 ) = fsm.getInitialStates( );
 
    int i = 0;
 
    // 1bc
    do {
        i = i + 1;
 
        Qi.push_back( Qi.at( i - 1 ) );
 
        for( const auto & p : Qi.at( i - 1 ) )
            for( const auto & transition : fsm.getTransitionsFromState( p ) )
                Qi.at( i ).insert ( transition.second );
    } while ( Qi.at( i ) != Qi.at( i - 1 ) );
 
    return Qi.at( i );
}
 
template < class T >
requires isDFTA < T > || isNFTA < T >
ext::set < typename T::StateType > ReachableStates::reachableStates( const T & fta ) {
    using StateType = typename T::StateType;
 
    // 1a
    ext::deque<ext::set<StateType>> Qi;
    Qi.push_back( ext::set<StateType>( ) );
 
    int i = 0;
 
    // 1bc
    do {
        i = i + 1;
 
        Qi.push_back( Qi.at( i - 1) );
 
        for( const auto & transition : fta.getTransitions ( ) )
            if ( std::all_of ( transition.first.second.begin ( ), transition.first.second.end ( ), [ & ] ( const StateType & state ) { return Qi.at ( i - 1 ).count ( state ); } ) )
                Qi.at( i ).insert ( transition.second );
 
    } while ( Qi.at( i ) != Qi.at( i - 1 ) );
 
    return Qi.at( i );
}
 
template < class T >
requires isAFDZA < T > || isAFNZA < T >
ext::set < typename T::StateType > ReachableStates::reachableStates( const T & afza ) {
    using StateType = typename T::StateType;
    using SymbolType = typename T::SymbolType;
 
    // 1a
    ext::deque<ext::set<StateType>> Qi;
    Qi.push_back( ext::set<StateType>( ) );
 
    int i = 0;
 
    // 1bc
    do {
        i = i + 1;
 
        Qi.push_back( Qi.at( i - 1) );
 
        for( const auto & transition : afza.getTransitions ( ) ) {
            if ( transition.first.template is < SymbolType > ( ) ) {
                Qi.at( i ).insert ( transition.second );
            } else if ( transition.first.template is < ext::pair < StateType, StateType > > ( ) ) {
                const auto& [q1, q2] = transition.first.template get < ext::pair < StateType, StateType > > ( );
                if ( Qi.at ( i - 1 ).contains ( q1 ) && Qi.at ( i - 1 ).contains ( q2 ) ) {
                    Qi.at( i ).insert ( transition.second );
                }
            }
        }
    } while ( Qi.at( i ) != Qi.at( i - 1 ) );
 
    return Qi.at( i );
}
 
} /* namespace properties */
 
} /* namespace automaton */