automaton::properties::ForwardBisimulation Class Reference

#include <ForwardBisimulation.h>

Static Public Member Functions
template<class SymbolType , class StateType >
static ext::set< ext::pair< StateType, StateType > >	forwardBisimulation (const automaton::DFA< SymbolType, StateType > &fta)
template<class SymbolType , class StateType >
static ext::set< ext::pair< StateType, StateType > >	forwardBisimulation (const automaton::NFA< SymbolType, StateType > &fta)
template<class SymbolType , class StateType >
static ext::set< ext::pair< StateType, StateType > >	forwardBisimulation (const automaton::ArcFactoredDeterministicZAutomaton< SymbolType, StateType > &afdza)
template<class SymbolType , class StateType >
static ext::set< ext::pair< StateType, StateType > >	forwardBisimulation (const automaton::ArcFactoredNondeterministicZAutomaton< SymbolType, StateType > &afnza)
template<class SymbolType , class StateType >
static ext::set< ext::pair< StateType, StateType > >	forwardBisimulation (const automaton::DFTA< SymbolType, StateType > &fta)
template<class SymbolType , class StateType >
static ext::set< ext::pair< StateType, StateType > >	forwardBisimulation (const automaton::NFTA< SymbolType, StateType > &fta)
template<class SymbolType , class StateType >
static ext::set< ext::pair< StateType, StateType > >	forwardBisimulation (const automaton::UnorderedDFTA< SymbolType, StateType > &fta)
template<class SymbolType , class StateType >
static ext::set< ext::pair< StateType, StateType > >	forwardBisimulation (const automaton::UnorderedNFTA< SymbolType, StateType > &fta)

Detailed Description

Find all forwardBisimulation pairs of states of DFA. Implements table-filling algorithm, Hopcroft 2nd edition, 4.4.1

Member Function Documentation

forwardBisimulation() [1/8]

template<class SymbolType , class StateType >

ext::set< ext::pair< StateType, StateType > > automaton::properties::ForwardBisimulation::forwardBisimulation ( const automaton::ArcFactoredDeterministicZAutomaton< SymbolType, StateType > &  afdza )

static

Here is the call graph for this function:

forwardBisimulation() [2/8]

template<class SymbolType , class StateType >

ext::set< ext::pair< StateType, StateType > > automaton::properties::ForwardBisimulation::forwardBisimulation ( const automaton::ArcFactoredNondeterministicZAutomaton< SymbolType, StateType > &  afnza )

static

Here is the call graph for this function:

forwardBisimulation() [3/8]

template<class SymbolType , class StateType >

ext::set< ext::pair< StateType, StateType > > automaton::properties::ForwardBisimulation::forwardBisimulation ( const automaton::DFA< SymbolType, StateType > &  fta )

static

Computes a relation on states of the DFA satisfying the forward bisimulation definition.

Parameters

fta	the examined automaton

Returns

set of pairs of states of the fta that are the forward bisimulation.

Here is the call graph for this function:

Here is the caller graph for this function:

forwardBisimulation() [4/8]

template<class SymbolType , class StateType >

ext::set< ext::pair< StateType, StateType > > automaton::properties::ForwardBisimulation::forwardBisimulation ( const automaton::DFTA< SymbolType, StateType > &  fta )

static

Computes a relation on states of the DFTA satisfying the forward bisimulation definition.

Parameters

fta	the examined automaton

Returns

set of pairs of states of the fta that are the forward bisimulation.

Here is the call graph for this function:

forwardBisimulation() [5/8]

template<class SymbolType , class StateType >

ext::set< ext::pair< StateType, StateType > > automaton::properties::ForwardBisimulation::forwardBisimulation ( const automaton::NFA< SymbolType, StateType > &  fta )

static

Computes a relation on states of the NFA satisfying the forward bisimulation definition.

Parameters

fta	the examined automaton

Returns

set of pairs of states of the fta that are the forward bisimulation.

Here is the call graph for this function:

forwardBisimulation() [6/8]

template<class SymbolType , class StateType >

ext::set< ext::pair< StateType, StateType > > automaton::properties::ForwardBisimulation::forwardBisimulation ( const automaton::NFTA< SymbolType, StateType > &  fta )

static

Computes a relation on states of the NFTA satisfying the forward bisimulation definition.

Parameters

fta	the examined automaton

Returns

set of pairs of states of the fta that are the forward bisimulation.

Here is the call graph for this function:

forwardBisimulation() [7/8]

template<class SymbolType , class StateType >

ext::set< ext::pair< StateType, StateType > > automaton::properties::ForwardBisimulation::forwardBisimulation ( const automaton::UnorderedDFTA< SymbolType, StateType > &  fta )

static

Computes a relation on states of the DFTA satisfying the forward bisimulation definition.

Parameters

fta	the examined automaton

Returns

set of pairs of states of the fta that are the forward bisimulation.

Here is the call graph for this function:

forwardBisimulation() [8/8]

template<class SymbolType , class StateType >

ext::set< ext::pair< StateType, StateType > > automaton::properties::ForwardBisimulation::forwardBisimulation ( const automaton::UnorderedNFTA< SymbolType, StateType > &  fta )

static

Computes a relation on states of the NFTA satisfying the forward bisimulation definition.

Parameters

fta	the examined automaton

Returns

set of pairs of states of the fta that are the forward bisimulation.

Here is the call graph for this function:

---

The documentation for this class was generated from the following file:

• alib2algo/src/automaton/properties/ForwardBisimulation.h