Include file:
#include "mcrl2/pbes/constelm.h
mcrl2::pbes_system::
pbes_constelm_algorithm
¶Algorithm class for the constelm algorithm.
mcrl2::pbes_system::pbes_constelm_algorithm::
constraint_map
¶typedef for std::map< data::variable, data::data_expression >
A map with constraints on the vertices of the graph.
mcrl2::pbes_system::pbes_constelm_algorithm::
edge_map
¶typedef for std::map< core::identifier_string, std::vector< edge > >
The storage type for edges.
mcrl2::pbes_system::pbes_constelm_algorithm::
qvar_list
¶typedef for std::list< detail::quantified_variable >
mcrl2::pbes_system::pbes_constelm_algorithm::
vertex_map
¶typedef for std::map< core::identifier_string, vertex >
The storage type for vertices.
mcrl2::pbes_system::pbes_constelm_algorithm::
m_data_rewriter
¶Compares data expressions for equality.
mcrl2::pbes_system::pbes_constelm_algorithm::
m_edges
¶The edges of the dependency graph. They are stored in a map, to easily access all out-edges corresponding to a particular vertex.
mcrl2::pbes_system::pbes_constelm_algorithm::
m_pbes_rewriter
¶Compares data expressions for equality.
mcrl2::pbes_system::pbes_constelm_algorithm::
m_redundant_parameters
¶The redundant parameters.
mcrl2::pbes_system::pbes_constelm_algorithm::
m_vertices
¶The vertices of the dependency graph. They are stored in a map, to support searching for a vertex.
concat
(const std::list<E> a, const std::list<E> b)¶print_condition
(const edge &e, const vertex &u, const pbes_expression &value)¶print_edges
()¶Logs the edges of the dependency graph.
print_todo_list
(const std::deque<propositional_variable> &todo)¶print_vertices
() constLogs the vertices of the dependency graph.
pbes_constelm_algorithm
(const DataRewriter &datar, const PbesRewriter &pbesr)¶Constructor.
Parameters:
redundant_parameters
() const¶Returns the parameters that have been removed by the constelm algorithm.
Returns: The removed parameters