12#ifndef MCRL2_LPS_EXPLORER_OPTIONS_H
13#define MCRL2_LPS_EXPLORER_OPTIONS_H
15#include "mcrl2/core/detail/print_utility.h"
16#include "mcrl2/data/rewrite_strategy.h"
17#include "mcrl2/lps/multi_action.h"
18#include "mcrl2/lps/exploration_strategy.h"
25 data::rewrite_strategy rewrite_strategy =
data::rewrite_strategy::jitty;
34#ifdef MCRL2_USE_CONTROL_FLOW
66 : rewrite_strategy(rewr_strat)
77 out <<
"rewrite-strategy = " << options.rewrite_strategy << std::endl;
78 out <<
"search-strategy = " << options.search_strategy << std::endl;
79 out <<
"cached = " << std::boolalpha << options.cached << std::endl;
80 out <<
"global-cache = " << std::boolalpha << options.global_cache << std::endl;
81 out <<
"confluence = " << std::boolalpha << options.confluence << std::endl;
82 out <<
"confluence-action = " << options.confluence_action << std::endl;
83 out <<
"use-projections = " << std::boolalpha << options.use_projections << std::endl;
84#ifdef MCRL2_USE_CONTROL_FLOW
85 out <<
"use-control-flow = " << std::boolalpha << options.use_control_flow << std::endl;
87 out <<
"one-point-rule-rewrite = " << std::boolalpha << options.one_point_rule_rewrite << std::endl;
88 out <<
"replace-constants-by-variables = " << std::boolalpha << options.replace_constants_by_variables << std::endl;
89 out <<
"remove-unused-rewrite-rules = " << std::boolalpha << options.remove_unused_rewrite_rules << std::endl;
90 out <<
"check-probabilities = " << std::boolalpha << options.check_probabilities << std::endl;
91 out <<
"detect-deadlock = " << std::boolalpha << options.detect_deadlock << std::endl;
92 out <<
"detect-nondeterminism = " << std::boolalpha << options.detect_nondeterminism << std::endl;
93 out <<
"detect-divergence = " << std::boolalpha << options.detect_divergence << std::endl;
94 out <<
"detect-action = " << std::boolalpha << options.detect_action << std::endl;
95 out <<
"discard-lts-state-labels = " << std::boolalpha << options.discard_lts_state_labels << std::endl;
96 out <<
"save-error-trace = " << std::boolalpha << options.save_error_trace << std::endl;
97 out <<
"generate-traces = " << std::boolalpha << options.generate_traces << std::endl;
98 out <<
"suppress-progress-messages = " << std::boolalpha << options.suppress_progress_messages << std::endl;
99 out <<
"save-aut-at-end = " << std::boolalpha << options.save_at_end << std::endl;
100 out <<
"dfs-recursive = " << std::boolalpha << options.dfs_recursive << std::endl;
101 out <<
"max-states = " << options.max_states << std::endl;
102 out <<
"max-traces = " << options.max_traces << std::endl;
103 out <<
"todo-max = " << options.highway_todo_max << std::endl;
104 out <<
"threads = " << options.number_of_threads << std::endl;
105 out <<
"trace-prefix = " << options.trace_prefix << std::endl;
106 out <<
"trace-actions = " << core::detail::print_set(options.trace_actions) << std::endl;
107 out <<
"trace-multiactions = " << core::detail::print_set(options.trace_multiactions) << std::endl;
108 out <<
"actions-internal-for-divergencies = " << core::detail::print_set(options.actions_internal_for_divergencies) << std::endl;
A unordered_map class in which aterms can be stored.
const variable_list & variables() const
data_expression & operator=(data_expression &&) noexcept=default
existential quantification.
universal quantification.
Rewriter that operates on data expressions.
data_expression operator()(const data_expression &d) const
Rewrites a data expression.
std::vector< data::variable > m_process_parameters
void make_timed_state(state &result, const state &s, const data::data_expression &t) const
data::enumerator_algorithm m_global_enumerator
void abort() override
Abort the state space generation.
lps::multi_action rewrite_action(const lps::multi_action &a, data::mutable_indexed_substitution<> &sigma, data::rewriter &rewr) const
Rewrite action a, and put it back in place.
std::vector< state > generate_successors(const state &s0, const SummandSequence &summands, data::mutable_indexed_substitution<> &sigma, data::rewriter &rewr, data::enumerator_algorithm<> &enumerator, data::enumerator_identifier_generator &id_generator, const SummandSequence &confluent_summands=SummandSequence())
std::condition_variable m_signal_global_todo_buffer_filled
void compute_stochastic_state(stochastic_state &result, const stochastic_distribution &distribution, const DataExpressionSequence &next_state) const
const state_type & make_state(const stochastic_state &s) const
void generate_state_space(bool recursive, const StateType &s0, const SummandSequence ®ular_summands, const SummandSequence &confluent_summands, indexed_set_for_states_type &discovered, DiscoverState discover_state=DiscoverState(), ExamineTransition examine_transition=ExamineTransition(), StartState start_state=StartState(), FinishState finish_state=FinishState(), DiscoverInitialState discover_initial_state=DiscoverInitialState())
const indexed_set_for_states_type & state_map() const
Returns a mapping containing all discovered states.
bool less_equal(const data::data_expression &t0, const data::data_expression &t1, data::mutable_indexed_substitution<> &sigma, data::rewriter &rewr) const
const std::vector< data::variable > & process_parameters() const
const std::vector< explorer_summand > & confluent_summands() const
void set_process_parameter_values(const data::data_expression_list &values, data::mutable_indexed_substitution<> &sigma)
void set_process_parameter_values(const data::data_expression_list &values)
~explorer() override=default
std::set< data::function_symbol > add_real_operators(std::set< data::function_symbol > s) const
data::enumerator_identifier_generator m_global_id_generator
explorer(const Specification &lpsspec, const explorer_options &options_, const data::rewriter &rewr)
void enumerate_solutions(const explorer_summand &summand, data::mutable_indexed_substitution<> &sigma, data::rewriter &rewr, data::data_expression &condition, data::enumerator_algorithm<> &enumerator, EmitSolution emit_solution)
Specification m_global_lpsspec
data::data_expression_list process_parameter_values() const
Process parameter values for use in a single thread.
void generate_transitions(const explorer_summand &summand, const SummandSequence &confluent_summands, data::mutable_indexed_substitution<> &sigma, data::rewriter &rewr, data::data_expression &condition, state_type &s1, atermpp::aterm key, data::enumerator_algorithm<> &enumerator, data::enumerator_identifier_generator &id_generator, ReportTransition report_transition=ReportTransition())
void generate_state_space_dfs_recursive(bool recursive, DiscoverState discover_state=DiscoverState(), ExamineTransition examine_transition=ExamineTransition(), TreeEdge tree_edge=TreeEdge(), BackEdge back_edge=BackEdge(), ForwardOrCrossEdge forward_or_cross_edge=ForwardOrCrossEdge(), FinishState finish_state=FinishState())
static constexpr bool is_timed
const data::data_expression_list & initial_state() const
void generate_state_space_thread(std::unique_ptr< todo_set > &todo, std::size_t thread_index, std::atomic< std::size_t > &number_of_active_processes, const SummandSequence ®ular_summands, const SummandSequence &confluent_summands, indexed_set_for_states_type &discovered, DiscoverState discover_state, ExamineTransition examine_transition, StartState start_state, FinishState finish_state, data::rewriter thread_rewr, data::mutable_indexed_substitution<> thread_sigma)
void generate_state_space(bool recursive, DiscoverState discover_state=DiscoverState(), ExamineTransition examine_transition=ExamineTransition(), StartState start_state=StartState(), FinishState finish_state=FinishState(), DiscoverInitialState discover_initial_state=DiscoverInitialState())
Generates the state space, and reports all discovered states and transitions by means of callback fun...
indexed_set_for_states_type m_discovered
state find_representative(state &u0, const SummandSequence &summands, data::mutable_indexed_substitution<> &sigma, data::rewriter &rewr, data::enumerator_algorithm<> &enumerator, data::enumerator_identifier_generator &id_generator)
std::vector< explorer_summand > m_regular_summands
const explorer_options m_options
summand_cache_map global_cache
const data::rewriter & get_rewriter() const
data::data_expression_list m_initial_state
std::mutex m_exclusive_state_access
data::mutable_indexed_substitution m_global_sigma
data::data_expression_list process_parameter_values(data::mutable_indexed_substitution<> &sigma) const
state_type make_state(const state &s) const
lps::stochastic_distribution m_initial_distribution
void compute_projected_state(lps::state &result, const DataExpressionSequence &next_state, const IndexSequence &I_w, data::mutable_indexed_substitution<> &sigma, const data::rewriter &rewr) const
void compute_state(state &result, const DataExpressionSequence &v, data::mutable_indexed_substitution<> &sigma, const data::rewriter &rewr) const
std::vector< explorer_summand > m_confluent_summands
void compute_initial_stochastic_state(stochastic_state &result) const
volatile std::atomic< bool > m_must_abort
data::rewriter m_global_rewr
void generate_state_space_dfs_iterative(const state &s0, std::unordered_set< state > &discovered, const SummandSequence ®ular_summands, const SummandSequence &confluent_summands, DiscoverState discover_state=DiscoverState(), ExamineTransition examine_transition=ExamineTransition(), TreeEdge tree_edge=TreeEdge(), BackEdge back_edge=BackEdge(), ForwardOrCrossEdge forward_or_cross_edge=ForwardOrCrossEdge(), FinishState finish_state=FinishState())
void check_enumerator_solution(const data::data_expression &p_expression, const explorer_summand &summand, data::mutable_indexed_substitution<> &sigma, data::rewriter &rewr) const
void compute_stochastic_state(stochastic_state &result, const stochastic_distribution &distribution, const DataExpressionSequence &next_state, data::mutable_indexed_substitution<> &sigma, const data::rewriter &rewr, const data::enumerator_algorithm<> &enumerator) const
const std::vector< explorer_summand > & regular_summands() const
std::unique_ptr< todo_set > make_todo_set(const state &init)
std::mutex m_global_todo_buffer_mutex
std::unique_ptr< todo_set > make_todo_set(ForwardIterator first, ForwardIterator last)
std::list< transition > out_edges(const state &s)
std::vector< data::data_expression > timed_state
void project(lps::state &result, const std::vector< std::size_t > &I_r, const data::mutable_indexed_substitution<> &sigma)
std::list< transition > out_edges(const state &s, const SummandSequence ®ular_summands, const SummandSequence &confluent_summands, data::mutable_indexed_substitution<> &sigma, data::rewriter &rewr, data::enumerator_algorithm<> &enumerator, data::enumerator_identifier_generator &id_generator)
Specification preprocess(const Specification &lpsspec)
std::list< transition > out_edges(const state &s, const std::size_t summand_index)
bool is_confluent_tau(const multi_action &a)
static constexpr bool is_stochastic
void generate_state_space_dfs_iterative(bool recursive, DiscoverState discover_state=DiscoverState(), ExamineTransition examine_transition=ExamineTransition(), TreeEdge tree_edge=TreeEdge(), BackEdge back_edge=BackEdge(), ForwardOrCrossEdge forward_or_cross_edge=ForwardOrCrossEdge(), FinishState finish_state=FinishState())
void compute_stochastic_projected_state(stochastic_state &result, const stochastic_distribution &distribution, const DataExpressionSequence &next_state, const IndexSequence &I_w, data::mutable_indexed_substitution<> &sigma, const data::rewriter &rewr, data::enumerator_algorithm<> &enumerator) const
\brief A timed multi-action
const process::action_list & actions() const
const data::data_expression & time() const
void enable_auto_select_probability(bool enable)
If enabled, automatically a probabilistic state is chosen using its intrinsic probability.
void select_transition(std::size_t transition_number)
Choose outgoing transition indexed by transition_number and add its state to the state vector.
void add_new_state(const lps::stochastic_state &s)
std::uniform_int_distribution< std::size_t > m_distrib
std::deque< simulator_state_t > m_full_trace
void randomly_select_state()
Randomly choose one state among a sequence of probabilistic states.
bool m_auto_select_probabilistic_state
void select_state(std::size_t state_number)
Choose one state among a sequence of probabilistic states.
simulation(const stochastic_specification &specification, data::rewrite_strategy strategy=data::rewrite_strategy())
Constructor.
void randomly_select_transition()
Randomly choose an outgoing transition and add its state to the state vector.
std::vector< transition_type > transitions(const lps::state &source_state)
bool match_trace_transition(lts::trace &trace)
void environment(std::vector< std::string > values)
Goto the state indicated by the environment, which is given by a vector of strings.
virtual ~simulation()=default
bool match_trace_probabilistic_state(lts::trace &trace)
data::rewriter m_rewriter
void save(const std::string &filename) const
Save the trace to a file.
bool probabilistic_state_must_be_selected(const std::size_t state_index) const
Indicate whether a probabilistic state has been selected.
const std::deque< simulator_state_t > & trace() const
Returns the current annotated state vector.
stochastic_specification m_specification
void truncate(std::size_t state_number, bool probabilistic)
Remove states from the end of the simulation, making state_number the last state.
void load(const std::string &filename)
Load a trace from a file.
\brief A stochastic distribution
bool is_defined() const
Returns true if the distribution is defined, i.e. it contains a valid distribution....
Linear process specification.
This class contains a trace consisting of a sequence of (timed) actions possibly with intermediate st...
#define mCRL2log(LEVEL)
mCRL2log(LEVEL) provides the stream used to log.
Namespace for system defined sort bool_.
const function_symbol & true_()
Constructor for function symbol true.
Namespace for system defined sort real_.
data_expression & real_one()
data_expression & real_zero()
std::set< variable > find_quantifier_variables(const data_expression &x)
bool is_false(const data_expression &x)
Test if x is false.
void add_assignments(data::mutable_indexed_substitution<> &sigma, const VariableSequence &v, const DataExpressionSequence &e)
Adds assignments [v := e] to the substitution sigma for each variable in v.
void remove_assignments(data::mutable_indexed_substitution<> &sigma, const VariableSequence &v)
Removes assignments to variables in v from the substitution sigma.
application greater_equal(const data_expression &arg0, const data_expression &arg1)
Application of function symbol >=.
A class that takes a linear process specification and checks all tau-summands of that LPS for conflue...
The main namespace for the LPS library.
void check_stochastic_state(const stochastic_state &s, const data::rewriter &rewr)
void check_probability(const data::data_expression &x, const data::rewriter &rewr)
std::ostream & operator<<(std::ostream &out, const explorer_options &options)
std::string print_probability(const data::data_expression &x)
The main namespace for the Process library.
Visitor for collecting the quantifier variables that occur in a pbes expression.
std::set< data::variable > result
void enter(const exists &x)
void enter(const forall &x)
transition(lps::multi_action action_, const state_type &state_)
bool detect_nondeterminism
std::set< core::identifier_string > actions_internal_for_divergencies
bool replace_constants_by_variables
std::set< core::identifier_string > trace_actions
explorer_options(data::rewrite_strategy rewr_strat)
exploration_strategy search_strategy
std::string confluence_action
bool remove_unused_rewrite_rules
bool discard_lts_state_labels
explorer_options()=default
explorer_options & operator=(const explorer_options &other)=default
std::set< lps::multi_action > trace_multiactions
explorer_options(const explorer_options &other)=default
bool one_point_rule_rewrite
std::size_t number_of_threads
std::size_t highway_todo_max
bool suppress_progress_messages
std::vector< transition_type > transitions
std::size_t transition_number
lps::stochastic_state source_state
stochastic_state(const state &s)
stochastic_state()=default
void push_back(const data::data_expression &probability, const state &s)
std::vector< data::data_expression > probabilities
std::vector< state > states