12#ifndef MCRL2_MODAL_FORMULA_ACTION_FORMULA_H
13#define MCRL2_MODAL_FORMULA_ACTION_FORMULA_H
15#include "mcrl2/lps/multi_action.h"
16#include "mcrl2/process/untyped_multi_action.h"
36 assert(
core::
detail::check_rule_ActFrm(*
this));
110 return out << action_formulas::pp(x);
134 assert(
core::
detail::check_term_ActTrue(*
this));
150 return x.function() == core::detail::function_symbols::ActTrue;
163 return out << action_formulas::pp(x);
187 assert(
core::
detail::check_term_ActFalse(*
this));
203 return x.function() == core::detail::function_symbols::ActFalse;
216 return out << action_formulas::pp(x);
240 assert(
core::
detail::check_term_ActNot(*
this));
256 return atermpp::down_cast<action_formula>((*
this)[0]);
262template <
class... ARGUMENTS>
265 atermpp::make_term_appl(t, core::detail::function_symbol_ActNot(), args...);
274 return x.function() == core::detail::function_symbols::ActNot;
287 return out << action_formulas::pp(x);
311 assert(
core::
detail::check_term_ActAnd(*
this));
327 return atermpp::down_cast<action_formula>((*
this)[0]);
332 return atermpp::down_cast<action_formula>((*
this)[1]);
338template <
class... ARGUMENTS>
341 atermpp::make_term_appl(t, core::detail::function_symbol_ActAnd(), args...);
350 return x.function() == core::detail::function_symbols::ActAnd;
363 return out << action_formulas::pp(x);
387 assert(
core::
detail::check_term_ActOr(*
this));
403 return atermpp::down_cast<action_formula>((*
this)[0]);
408 return atermpp::down_cast<action_formula>((*
this)[1]);
414template <
class... ARGUMENTS>
417 atermpp::make_term_appl(t, core::detail::function_symbol_ActOr(), args...);
426 return x.function() == core::detail::function_symbols::ActOr;
439 return out << action_formulas::pp(x);
463 assert(
core::
detail::check_term_ActImp(*
this));
479 return atermpp::down_cast<action_formula>((*
this)[0]);
484 return atermpp::down_cast<action_formula>((*
this)[1]);
490template <
class... ARGUMENTS>
493 atermpp::make_term_appl(t, core::detail::function_symbol_ActImp(), args...);
502 return x.function() == core::detail::function_symbols::ActImp;
515 return out << action_formulas::pp(x);
539 assert(
core::
detail::check_term_ActForall(*
this));
555 return atermpp::down_cast<data::variable_list>((*
this)[0]);
560 return atermpp::down_cast<action_formula>((*
this)[1]);
566template <
class... ARGUMENTS>
569 atermpp::make_term_appl(t, core::detail::function_symbol_ActForall(), args...);
578 return x.function() == core::detail::function_symbols::ActForall;
591 return out << action_formulas::pp(x);
615 assert(
core::
detail::check_term_ActExists(*
this));
631 return atermpp::down_cast<data::variable_list>((*
this)[0]);
636 return atermpp::down_cast<action_formula>((*
this)[1]);
642template <
class... ARGUMENTS>
645 atermpp::make_term_appl(t, core::detail::function_symbol_ActExists(), args...);
654 return x.function() == core::detail::function_symbols::ActExists;
667 return out << action_formulas::pp(x);
691 assert(
core::
detail::check_term_ActAt(*
this));
700 at(
const at&)
noexcept =
default;
707 return atermpp::down_cast<action_formula>((*
this)[0]);
712 return atermpp::down_cast<data::data_expression>((*
this)[1]);
718template <
class... ARGUMENTS>
721 atermpp::make_term_appl(t, core::detail::function_symbol_ActAt(), args...);
730 return x.function() == core::detail::function_symbols::ActAt;
743 return out << action_formulas::pp(x);
767 assert(
core::
detail::check_term_ActMultAct(*
this));
783 return atermpp::down_cast<process::action_list>((*
this)[0]);
789template <
class... ARGUMENTS>
792 atermpp::make_term_appl(t, core::detail::function_symbol_ActMultAct(), args...);
801 return x.function() == core::detail::function_symbols::ActMultAct;
814 return out << action_formulas::pp(x);
aterm(const aterm &other) noexcept=default
This class has user-declared copy constructor so declare default copy and move operators.
A unordered_map class in which aterms can be stored.
\brief An untyped parameter
\brief A timed multi-action
const process::action_list & actions() const
std::vector< bool > block_flags
state_type max_state_index
mcrl2::state_formulas::state_formula conjunction(std::set< mcrl2::state_formulas::state_formula > terms) const
conjunction Creates a conjunction of state formulas
regular_formulas::regular_formula create_regular_formula(const mcrl2::lts::action_label_string &a) const
create_regular_formula Creates a regular formula that represents action a
regular_formulas::regular_formula create_regular_formula(const mcrl2::lps::multi_action &a) const
create_regular_formula Creates a regular formula that represents action a
std::vector< bool > block_is_in_to_be_processed
std::vector< bool > state_flags
std::map< block_index_type, block_index_type > right_child
std::vector< block_index_type > BL
bool in_same_class(const std::size_t s, const std::size_t t) const
Returns whether two states are in the same bisimulation equivalence class.
mcrl2::state_formulas::state_formula until_formula(const mcrl2::state_formulas::state_formula &phi1, const label_type &a, const mcrl2::state_formulas::state_formula &phi2)
until_formula Creates a state formula that corresponds to the until operator phi1phi2 from HMLU
std::size_t get_eq_class(const std::size_t s) const
Gives the bisimulation equivalence class number of a state.
bisim_partitioner(LTS_TYPE &l, const bool branching=false, const bool preserve_divergence=false, const bool generate_counter_examples=false)
Creates a bisimulation partitioner for an LTS.
~bisim_partitioner()=default
Destroys this partitioner.
std::map< block_index_type, label_type > split_by_action
std::size_t num_eq_classes() const
Gives the number of bisimulation equivalence classes of the LTS.
mcrl2::state_formulas::state_formula counter_formula(std::size_t s, std::size_t t)
Creates a state formula that distinguishes state s from state t.
void order_recursively_on_tau_reachability(const state_type s, std::map< state_type, std::vector< state_type > > &inert_transition_map, std::vector< non_bottom_state > &new_non_bottom_states, std::set< state_type > &visited)
std::vector< block_index_type > to_be_processed
std::map< block_index_type, block_index_type > split_by_block
void refine_partion_with_respect_to_divergences()
void replace_transition_system(const bool branching, const bool preserve_divergences)
Replaces the transition relation of the current lts by the transitions of the bisimulation reduced tr...
std::vector< block > blocks
void order_on_tau_reachability(std::vector< non_bottom_state > &non_bottom_states)
void split_the_blocks_in_BL(bool &partition_is_unstable, const label_type splitter_label, const block_index_type splitter_block)
void refine_partition_until_it_becomes_stable(const bool branching, const bool preserve_divergence)
void create_initial_partition(const bool branching, const bool preserve_divergences)
std::vector< state_type > block_index_of_a_state
mcrl2::state_formulas::state_formula counter_formula_aux(const block_index_type B1, const block_index_type B2)
void check_internal_consistency_of_the_partitioning_data_structure(const bool branching, const bool preserve_divergence) const
outgoing_transitions_per_state_action_t outgoing_transitions
function object to compare two constln_t pointers based on their contents
A class that can be used to store counterexample trees and.
A class that contains a labelled transition system.
Class for computing the signature for strong bisimulation.
Class for computing the signature for branching bisimulation.
Class for computing the signature for divergence preserving branching bisimulation.
Signature based reductions for labelled transition systems.
\brief An untyped multi action or data application
#define mCRL2log(LEVEL)
mCRL2log(LEVEL) provides the stream used to log.
bool is_data_expression(const atermpp::aterm &x)
Test for a data_expression expression.
bool is_untyped_data_parameter(const atermpp::aterm &x)
The main namespace for the LPS library.
bool bisimulation_compare(const LTS_TYPE &l1, const LTS_TYPE &l2, bool branching=false, bool preserve_divergences=false, bool generate_counter_examples=false, const std::string &counter_example_file="", bool structured_output=false)
Checks whether the two initial states of two lts's are strong or branching bisimilar.
lts_type guess_format(std::string const &s, const bool be_verbose)
Determines the LTS format from a filename by its extension.
static const std::array< std::string, 5 > extension_strings
std::string supported_lts_formats_text(lts_type default_format, const std::set< lts_type > &supported)
Gives a textual list describing supported LTS formats.
std::string supported_lts_formats_text(const std::set< lts_type > &supported)
Gives a textual list describing supported LTS formats.
std::string string_for_type(const lts_type type)
Gives a string representation of an LTS format.
std::string mime_type_for_type(const lts_type type)
Gives the MIME type associated with an LTS format.
void get_trans(const outgoing_transitions_per_state_t &begin, tree_set_store &tss, std::ptrdiff_t d, std::vector< transition > &d_trans, LTS_TYPE &aut)
lts_type parse_format(std::string const &s)
Determines the LTS format from a format specification string.
static const std::array< std::string, 5 > type_strings
std::string extension_for_type(const lts_type type)
Gives the filename extension associated with an LTS format.
const std::set< lts_type > & supported_lts_formats()
Gives the set of all supported LTS formats.
std::string lts_extensions_as_string(const std::set< lts_type > &supported)
Gives a list of extensions for supported LTS formats.
std::string lts_extensions_as_string(const std::string &sep, const std::set< lts_type > &supported)
Gives a list of extensions for supported LTS formats.
bool destructive_bisimulation_compare(LTS_TYPE &l1, LTS_TYPE &l2, bool branching=false, bool preserve_divergences=false, bool generate_counter_examples=false, const std::string &counter_example_file="", bool structured_output=false)
Checks whether the two initial states of two lts's are strong or branching bisimilar.
void bisimulation_reduce(LTS_TYPE &l, bool branching=false, bool preserve_divergences=false)
Reduce transition system l with respect to strong or (divergence preserving) branching bisimulation.
bool lts_named_cmp(const std::array< std::string, Size > &N, T a, T b)
static const std::array< std::string, 5 > type_desc_strings
static const std::array< std::string, 5 > mime_type_strings
static const std::set< lts_type > & initialise_supported_lts_formats()
bool is_deterministic(const LTS_TYPE &l)
Checks whether this LTS is deterministic.
void determinise(LTS_TYPE &l)
Determinises this LTS.
void reduce(LTS_TYPE &l, lts_equivalence eq)
Applies a reduction algorithm to this LTS.
bool compare(const LTS_TYPE &l1, const LTS_TYPE &l2, lts_equivalence eq, bool generate_counter_examples=false, const std::string &counter_example_file="", bool structured_output=false)
Checks whether this LTS is equivalent to another LTS.
bool destructive_compare(LTS_TYPE &l1, LTS_TYPE &l2, const lts_equivalence eq, const bool generate_counter_examples=false, const std::string &counter_example_file=std::string(), const bool structured_output=false)
Checks whether this LTS is equivalent to another LTS.
bool destructive_compare(LTS_TYPE &l1, LTS_TYPE &l2, lts_preorder pre, bool generate_counter_example, const std::string &counter_example_file="", bool structured_output=false, lps::exploration_strategy strategy=lps::es_breadth, bool preprocess=true)
Checks whether this LTS is smaller than another LTS according to a preorder.
void merge(LTS_TYPE &l1, const LTS_TYPE &l2)
Merge the second lts into the first lts.
bool reachability_check(lts< SL, AL, BASE > &l, bool remove_unreachable=false)
Checks whether all states in this LTS are reachable from the initial state and remove unreachable sta...
bool reachability_check(probabilistic_lts< SL, AL, PROBABILISTIC_STATE, BASE > &l, bool remove_unreachable=false)
Checks whether all states in a probabilistic LTS are reachable from the initial state and remove unre...
bool compare(const LTS_TYPE &l1, const LTS_TYPE &l2, lts_preorder pre, bool generate_counter_example, const std::string &counter_example_file="", bool structured_output=false, lps::exploration_strategy strategy=lps::es_breadth, bool preprocess=true)
Checks whether this LTS is smaller than another LTS according to a preorder.
The main namespace for the Process library.
bool is_untyped_multi_action(const atermpp::aterm &x)
static const atermpp::aterm StateMay
static const atermpp::aterm StateOr
static const atermpp::aterm UntypedRegFrm
static const atermpp::aterm StateFrm
static const atermpp::aterm StateYaled
static const atermpp::aterm RegAlt
static const atermpp::aterm ActNot
static const atermpp::aterm ActImp
static const atermpp::aterm ActTrue
static const atermpp::aterm StateInfimum
static const atermpp::aterm StateAnd
static const atermpp::aterm StateExists
static const atermpp::aterm RegTrans
static const atermpp::aterm ActOr
static const atermpp::aterm StateConstantMultiplyAlt
static const atermpp::aterm ActFrm
static const atermpp::aterm ActForall
static const atermpp::aterm StateYaledTimed
static const atermpp::aterm ActFalse
static const atermpp::aterm StateFalse
static const atermpp::aterm RegFrm
static const atermpp::aterm StateDelay
static const atermpp::aterm StatePlus
static const atermpp::aterm StateMinus
static const atermpp::aterm StateNu
static const atermpp::aterm ActAnd
static const atermpp::aterm StateDelayTimed
static const atermpp::aterm StateSupremum
static const atermpp::aterm StateSum
static const atermpp::aterm ActAt
static const atermpp::aterm ActExists
static const atermpp::aterm StateMu
static const atermpp::aterm RegTransOrNil
static const atermpp::aterm StateVar
static const atermpp::aterm StateImp
static const atermpp::aterm RegSeq
static const atermpp::aterm StateTrue
static const atermpp::aterm StateForall
static const atermpp::aterm StateMust
static const atermpp::aterm StateNot
static const atermpp::aterm ActMultAct
static const atermpp::aterm StateConstantMultiply
std::vector< state_type > bottom_states
block_index_type parent_block_index
block_index_type block_index
void swap(block &b) noexcept
std::vector< transition > non_inert_transitions
std::vector< non_bottom_state > non_bottom_states
std::vector< state_type > inert_transitions
non_bottom_state(const state_type s, const std::vector< state_type > &it)
non_bottom_state(const state_type s)