liblts_bisim.h File Reference

Go to the source code of this file.

Classes
class	mcrl2::lts::detail::bisim_partitioner< LTS_TYPE >
struct	mcrl2::lts::detail::bisim_partitioner< LTS_TYPE >::non_bottom_state
struct	mcrl2::lts::detail::bisim_partitioner< LTS_TYPE >::block

Namespaces
namespace	mcrl2
	A class that takes a linear process specification and checks all tau-summands of that LPS for confluence.
namespace	mcrl2::lts
	The main LTS namespace.
namespace	mcrl2::lts::detail
	A base class for the lts_dot labelled transition system.

Functions
template<class LTS_TYPE >
void	mcrl2::lts::detail::bisimulation_reduce (LTS_TYPE &l, const bool branching=false, const bool preserve_divergences=false)
	Reduce transition system l with respect to strong or (divergence preserving) branching bisimulation.
template<class LTS_TYPE >
bool	mcrl2::lts::detail::destructive_bisimulation_compare (LTS_TYPE &l1, LTS_TYPE &l2, const bool branching=false, const bool preserve_divergences=false, const bool generate_counter_examples=false, const std::string &counter_example_file="", const bool structured_output=false)
	Checks whether the two initial states of two lts's are strong or branching bisimilar.
template<class LTS_TYPE >
bool	mcrl2::lts::detail::bisimulation_compare (const LTS_TYPE &l1, const LTS_TYPE &l2, const bool branching=false, const bool preserve_divergences=false, const bool generate_counter_examples=false, const std::string &counter_example_file="", const bool structured_output=false)
	Checks whether the two initial states of two lts's are strong or branching bisimilar.