linear_process.h

Go to the documentation of this file.

// Author(s): Wieger Wesselink
// Copyright: see the accompanying file COPYING or copy at
// https://github.com/mCRL2org/mCRL2/blob/master/COPYING
//
// Distributed under the Boost Software License, Version 1.0.
// (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
//
 
#ifndef MCRL2_LPS_LINEAR_PROCESS_H
#define MCRL2_LPS_LINEAR_PROCESS_H
 
#include "mcrl2/lps/action_summand.h"
#include "mcrl2/lps/deadlock_summand.h"
// #include "mcrl2/lps/process_initializer.h" Is not used in this file. 
 
namespace mcrl2
{
 
namespace lps
{
 
namespace detail
{
 
// helper function for linear_process_base::linear_process_base(const atermpp::aterm& lps)
template <typename Summand>
Summand make_action_summand(const data::variable_list&,
                            const data::data_expression&,
                            const multi_action&,
                            const data::assignment_list&,
                            const stochastic_distribution&
                           )
{
  throw mcrl2::runtime_error("make_action_summand is not defined!");
}
 
template <>
inline
action_summand make_action_summand<action_summand>(const data::variable_list& summation_variables,
                                                   const data::data_expression& condition,
                                                   const multi_action& a,
                                                   const data::assignment_list& assignments,
                                                   const stochastic_distribution& distribution
                                                  )
{
  (void)distribution;  // Suppress an unused variable warning. 
  assert(!distribution.is_defined());
  return action_summand(summation_variables, condition, a, assignments);
}
 
} // namespace detail
 
class linear_process; // prototype declaration
bool check_well_typedness(const linear_process& x);
 
class stochastic_linear_process; // prototype declaration
bool check_well_typedness(const stochastic_linear_process& x);
 
template <typename ActionSummand>
class linear_process_base
{
  protected:
    data::variable_list m_process_parameters;
 
    deadlock_summand_vector m_deadlock_summands;
 
    std::vector<ActionSummand> m_action_summands;
 
  public:
    typedef ActionSummand action_summand_type;
 
    linear_process_base() = default;
 
    linear_process_base(const data::variable_list& process_parameters,
                        const deadlock_summand_vector& deadlock_summands,
                        const std::vector<ActionSummand>& action_summands
                       )
       :
      m_process_parameters(process_parameters),
      m_deadlock_summands(deadlock_summands),
      m_action_summands(action_summands)
    { }
 
    explicit linear_process_base(const atermpp::aterm& lps, bool stochastic_distributions_allowed = true)
    {
      using atermpp::down_cast;
      assert(core::detail::check_term_LinearProcess(lps));
      m_process_parameters = down_cast<data::variable_list>(lps[0]);
      const auto& summands = atermpp::down_cast<atermpp::aterm_list>(lps[1]);
      for (const atermpp::aterm& summand: summands)
      {
        assert(core::detail::check_rule_LinearProcessSummand(summand));
        const atermpp::aterm& t = summand;
 
        const auto& summation_variables = down_cast<data::variable_list>(t[0]);
        const auto& condition = down_cast<data::data_expression>(t[1]);
        const auto& time = down_cast<data::data_expression>(t[3]);
        const auto& assignments = down_cast<data::assignment_list>(t[4]);
        const auto& distribution = down_cast<stochastic_distribution>(t[5]);
        if (!stochastic_distributions_allowed && distribution.is_defined())
        {
          throw mcrl2::runtime_error("Summand with stochastic distribution encountered, while this tool is not yet able to deal with stochastic distributions.");
        }
        if ((t[2]).function() == core::detail::function_symbols::Delta)
        {
          m_deadlock_summands.push_back(deadlock_summand(summation_variables, condition, deadlock(time)));
        }
        else
        {
          assert(lps::is_multi_action(t[2]));
          const auto& actions = down_cast<process::action_list>(t[2][0]);
          m_action_summands.push_back(detail::make_action_summand<ActionSummand>(summation_variables, condition, multi_action(actions, time), assignments, distribution));
        }
      }
    }
 
    std::size_t summand_count() const
    {
      return m_deadlock_summands.size() + m_action_summands.size();
    }
 
    const std::vector<ActionSummand>& action_summands() const
    {
      return m_action_summands;
    }
 
    std::vector<ActionSummand>& action_summands()
    {
      return m_action_summands;
    }
 
    const deadlock_summand_vector& deadlock_summands() const
    {
      return m_deadlock_summands;
    }
 
    deadlock_summand_vector& deadlock_summands()
    {
      return m_deadlock_summands;
    }
 
    const data::variable_list& process_parameters() const
    {
      return m_process_parameters;
    }
 
    data::variable_list& process_parameters()
    {
      return m_process_parameters;
    }
 
    bool has_time() const
    {
      for (auto i = m_action_summands.begin(); i != m_action_summands.end(); ++i)
      {
        if (i->has_time())
        {
          return true;
        }
      }
      for (auto i = m_deadlock_summands.begin(); i != m_deadlock_summands.end(); ++i)
      {
        if (i->deadlock().has_time())
        {
          return true;
        }
      }
      return false;
    }
};
 
class linear_process: public linear_process_base<action_summand>
{
  typedef linear_process_base<action_summand> super;
 
  public:
    linear_process() = default;
 
    linear_process(const data::variable_list& process_parameters,
                   const deadlock_summand_vector& deadlock_summands,
                   const action_summand_vector& action_summands
                  )
      : super(process_parameters, deadlock_summands, action_summands)
    { }
 
    explicit linear_process(const atermpp::aterm& lps, bool = false)
      : super(lps, false)
    { }
};
 
template <typename ActionSummand>
atermpp::aterm linear_process_to_aterm(const linear_process_base<ActionSummand>& p)
{
  atermpp::term_list<atermpp::aterm> summands;
  for (auto i = p.deadlock_summands().rbegin(); i != p.deadlock_summands().rend(); ++i)
  {
    atermpp::aterm s = deadlock_summand_to_aterm(*i);
    summands.push_front(s);
  }
  for (auto i = p.action_summands().rbegin(); i != p.action_summands().rend(); ++i)
  {
    atermpp::aterm s = action_summand_to_aterm(*i);
    summands.push_front(s);
  }
 
  return atermpp::aterm(core::detail::function_symbol_LinearProcess(),
           p.process_parameters(),
           summands
         );
}
 
//--- start generated class linear_process ---//
// prototype declaration
std::string pp(const linear_process& x);
 
inline
std::ostream& operator<<(std::ostream& out, const linear_process& x)
{
  return out << lps::pp(x);
}
//--- end generated class linear_process ---//
 
inline
bool is_linear_process(const atermpp::aterm& x)
{
  return x.function() == core::detail::function_symbols::LinearProcess;
}
 
// template function overloads
std::set<data::variable> find_all_variables(const lps::linear_process& x);
std::set<data::variable> find_free_variables(const lps::linear_process& x);
std::set<process::action_label> find_action_labels(const lps::linear_process& x);
 
} // namespace lps
 
} // namespace mcrl2
 
#endif // MCRL2_LPS_LINEAR_PROCESS_H