#include <solve_structure_graph.h>
|
| | lps_solve_structure_graph_algorithm ()=default |
| |
| std::pair< bool, lps::specification > | solve_with_counter_example (structure_graph &G, const lps::specification &lpsspec, const pbes &p, const pbes_equation_index &p_index) |
| | Solve a pbes for some equation, while constructing a counter example or wittness based on the accompanying linear process.
|
| |
| std::pair< vertex_set, vertex_set > | solve_recursive (structure_graph &G, const vertex_set &A, std::size_t &calculation_steps) |
| |
| | solve_structure_graph_algorithm (bool check_strategy_=false, bool use_toms_optimization_=false) |
| |
| bool | solve (structure_graph &G, std::size_t &calculation_steps) |
| | Returns the winning player (alpha)
|
| |
| bool | solve (structure_graph &G) |
| |
| std::pair< vertex_set, vertex_set > | solve_partitions (structure_graph &G, std::size_t &calculation_steps) |
| | Returns the winning partition.
|
| |
Definition at line 504 of file solve_structure_graph.h.
◆ lps_solve_structure_graph_algorithm()
| mcrl2::pbes_system::lps_solve_structure_graph_algorithm::lps_solve_structure_graph_algorithm |
( |
| ) |
|
|
default |
◆ create_counter_example_lps()
◆ solve_with_counter_example()
Solve a pbes for some equation, while constructing a counter example or wittness based on the accompanying linear process.
- Parameters
-
| G | A structure graph. |
| lpsspec | The original LPS that was used to create the PBES. |
| p | The pbes to be solved. |
| p_index | The index of the pbes equation to be solved. |
- Returns
- A boolean indicating the solution and a linear process that represents the counter example.
Definition at line 561 of file solve_structure_graph.h.
The documentation for this class was generated from the following file: