spot  2.10.0.dev
mealy_machine.hh
1 // -*- coding: utf-8 -*-
2 // Copyright (C) 2021 Laboratoire de Recherche et Développement
3 // de l'Epita (LRDE).
4 //
5 // This file is part of Spot, a model checking library.
6 //
7 // Spot is free software; you can redistribute it and/or modify it
8 // under the terms of the GNU General Public License as published by
9 // the Free Software Foundation; either version 3 of the License, or
10 // (at your option) any later version.
11 //
12 // Spot is distributed in the hope that it will be useful, but WITHOUT
13 // ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
14 // or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public
15 // License for more details.
16 //
17 // You should have received a copy of the GNU General Public License
18 // along with this program. If not, see <http://www.gnu.org/licenses/>.
19 
20 #pragma once
21 
22 #include <spot/twa/twagraph.hh>
23 
24 namespace spot
25 {
28 
34  SPOT_API bool
35  is_mealy(const const_twa_graph_ptr& m);
36 
43  SPOT_API bool
44  is_separated_mealy(const const_twa_graph_ptr& m);
45 
54  SPOT_API bool
55  is_split_mealy(const const_twa_graph_ptr& m);
56 
65  SPOT_API bool
66  is_input_deterministic_mealy(const const_twa_graph_ptr& m);
67 
68 
75  SPOT_API twa_graph_ptr
76  split_separated_mealy(const const_twa_graph_ptr& m);
77 
78  SPOT_API void
79  split_separated_mealy_here(const twa_graph_ptr& m);
81 
83  SPOT_API twa_graph_ptr
84  unsplit_mealy(const const_twa_graph_ptr& m);
85 
98  SPOT_API twa_graph_ptr
99  reduce_mealy(const const_twa_graph_ptr& mm,
100  bool output_assignment = false);
101 
102  SPOT_API void
103  reduce_mealy_here(twa_graph_ptr& mm,
104  bool output_assignment = false);
106 
117  SPOT_API twa_graph_ptr
118  minimize_mealy(const const_twa_graph_ptr& mm, int premin = -1);
119 
120 
127  SPOT_API bool
128  is_split_mealy_specialization(const_twa_graph_ptr left,
129  const_twa_graph_ptr right,
130  bool verbose = false);
131 }
Definition: automata.hh:27
void reduce_mealy_here(twa_graph_ptr &mm, bool output_assignment=false)
reduce an (in)completely specified mealy machine Based on signature inclusion or equality....
twa_graph_ptr reduce_mealy(const const_twa_graph_ptr &mm, bool output_assignment=false)
reduce an (in)completely specified mealy machine Based on signature inclusion or equality....
bool is_split_mealy(const const_twa_graph_ptr &m)
Checks whether or not the automaton is a split mealy machine.
twa_graph_ptr minimize_mealy(const const_twa_graph_ptr &mm, int premin=-1)
Minimizes a split (in)completely specified mealy machine The approach is described in.
bool is_split_mealy_specialization(const_twa_graph_ptr left, const_twa_graph_ptr right, bool verbose=false)
Test if the split mealy machine right is a specialization of the split mealy machine left.
bool is_mealy(const const_twa_graph_ptr &m)
Checks whether or not the automaton is a mealy machine.
bool is_separated_mealy(const const_twa_graph_ptr &m)
Checks whether or not the automaton is a separated mealy machine.
twa_graph_ptr split_separated_mealy(const const_twa_graph_ptr &m)
make each transition in a separated mealy machine a 2-step transition.
bool is_input_deterministic_mealy(const const_twa_graph_ptr &m)
Checks whether or not a mealy machine is input deterministic.
void split_separated_mealy_here(const twa_graph_ptr &m)
make each transition in a separated mealy machine a 2-step transition.
twa_graph_ptr unsplit_mealy(const const_twa_graph_ptr &m)
the inverse of split_separated_mealy

Please direct any question, comment, or bug report to the Spot mailing list at spot@lrde.epita.fr.
Generated on Fri Feb 27 2015 10:00:07 for spot by doxygen 1.9.1