sum.hh 2.93 KB
Newer Older
 Thomas Medioni committed Mar 09, 2017 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 ``````// -*- coding: utf-8 -*- // Copyright (C) 2017 Laboratoire de Recherche et // Développement de l'Epita (LRDE). // // This file is part of Spot, a model checking library. // // Spot is free software; you can redistribute it and/or modify it // under the terms of the GNU General Public License as published by // the Free Software Foundation; either version 3 of the License, or // (at your option) any later version. // // Spot is distributed in the hope that it will be useful, but WITHOUT // ANY WARRANTY; without even the implied warranty of MERCHANTABILITY // or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public // License for more details. // // You should have received a copy of the GNU General Public License // along with this program. If not, see . #pragma once #include #include namespace spot { /// \brief Sum two twa into a new twa, performing the union of the two input /// automatons. /// /// \param left Left term of the sum. /// \param right Right term of the sum. /// \return A spot::twa_graph containing the sum of \a left and \a right SPOT_API twa_graph_ptr sum(const const_twa_graph_ptr& left, const const_twa_graph_ptr& right); /// \brief Sum two twa into a new twa, performing the union of the two input /// automatons. /// /// \param left Left term of the sum. /// \param right Right term of the sum. /// \param left_state Initial state of the left term of the sum. /// \param right_state Initial state of the right term of the sum. /// \return A spot::twa_graph containing the sum of \a left and \a right SPOT_API twa_graph_ptr sum(const const_twa_graph_ptr& left, const const_twa_graph_ptr& right, unsigned left_state, unsigned right_state); `````` Alexandre Duret-Lutz committed Mar 30, 2017 51 `````` /// \brief Sum two twa into a new twa, using a universal initial transition, `````` Thomas Medioni committed Mar 09, 2017 52 53 54 55 56 57 58 59 60 `````` /// performing the intersection of the two languages of the input automatons. /// /// \param left Left term of the sum. /// \param right Right term of the sum. /// \return A spot::twa_graph containing the sum of \a left and \a right SPOT_API twa_graph_ptr sum_and(const const_twa_graph_ptr& left, const const_twa_graph_ptr& right); `````` Alexandre Duret-Lutz committed Mar 30, 2017 61 `````` /// \brief Sum two twa into a new twa, using a universal initial transition, `````` Thomas Medioni committed Mar 09, 2017 62 63 64 65 66 67 68 69 70 71 72 73 74 `````` /// performing the intersection of the two languages of the input automatons. /// /// \param left Left term of the sum. /// \param right Right term of the sum. /// \param left_state Initial state of the left term of the sum. /// \param right_state Initial state of the right term of the sum. /// \return A spot::twa_graph containing the sum of \a left and \a right SPOT_API twa_graph_ptr sum_and(const const_twa_graph_ptr& left, const const_twa_graph_ptr& right, unsigned left_state, unsigned right_state); }``````