spot  2.12
mealy_machine.hh
1 // -*- coding: utf-8 -*-
2 // Copyright (C) by the Spot authors, see the AUTHORS file for details.
3 //
4 // This file is part of Spot, a model checking library.
5 //
6 // Spot is free software; you can redistribute it and/or modify it
7 // under the terms of the GNU General Public License as published by
8 // the Free Software Foundation; either version 3 of the License, or
9 // (at your option) any later version.
10 //
11 // Spot is distributed in the hope that it will be useful, but WITHOUT
12 // ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
13 // or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public
14 // License for more details.
15 //
16 // You should have received a copy of the GNU General Public License
17 // along with this program. If not, see <http://www.gnu.org/licenses/>.
18 
19 #pragma once
20 
21 #include <spot/twa/twagraph.hh>
22 
25 
26 namespace spot
27 {
28  // Forward decl
29  struct synthesis_info;
30 
42  SPOT_API bool
43  is_mealy(const const_twa_graph_ptr& m);
44 
56  SPOT_API bool
57  is_separated_mealy(const const_twa_graph_ptr& m);
58 
73  SPOT_API bool
74  is_split_mealy(const const_twa_graph_ptr& m);
75 
86  SPOT_API bool
87  is_input_deterministic_mealy(const const_twa_graph_ptr& m);
88 
89 
102  SPOT_API twa_graph_ptr
103  split_separated_mealy(const const_twa_graph_ptr& m);
104 
105  SPOT_API void
106  split_separated_mealy_here(const twa_graph_ptr& m);
108 
117  SPOT_API twa_graph_ptr
118  unsplit_mealy(const const_twa_graph_ptr& m);
119 
135  SPOT_API twa_graph_ptr
136  reduce_mealy(const const_twa_graph_ptr& mm,
137  bool output_assignment = true);
138 
139  SPOT_API void
140  reduce_mealy_here(twa_graph_ptr& mm,
141  bool output_assignment = true);
143 
158  SPOT_API twa_graph_ptr
159  minimize_mealy(const const_twa_graph_ptr& mm, int premin = -1);
160 
177 
178  SPOT_API twa_graph_ptr
179  minimize_mealy(const const_twa_graph_ptr& mm,
180  synthesis_info& si);
181 
182 
190  SPOT_API bool
191  is_split_mealy_specialization(const_twa_graph_ptr left,
192  const_twa_graph_ptr right,
193  bool verbose = false);
194 
201  SPOT_API twa_graph_ptr
202  mealy_product(const const_twa_graph_ptr& left,
203  const const_twa_graph_ptr& right);
204 
219  SPOT_API void
220  simplify_mealy_here(twa_graph_ptr& m, int minimize_lvl,
221  bool split_out);
222 
223  SPOT_API void
224  simplify_mealy_here(twa_graph_ptr& m, synthesis_info& si,
225  bool split_out);
227 }
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 an (in)completely specified mealy machine.
twa_graph_ptr mealy_product(const const_twa_graph_ptr &left, const const_twa_graph_ptr &right)
Product between two mealy machines left and right.
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 the automaton is a mealy machine.
bool is_separated_mealy(const const_twa_graph_ptr &m)
Checks whether the automaton is a separated mealy machine.
void simplify_mealy_here(twa_graph_ptr &m, int minimize_lvl, bool split_out)
Convenience function to call minimize_mealy or reduce_mealy. Uses the same convention as ltlsynt for ...
twa_graph_ptr split_separated_mealy(const const_twa_graph_ptr &m)
split a separated mealy machine
twa_graph_ptr reduce_mealy(const const_twa_graph_ptr &mm, bool output_assignment=true)
reduce an (in)completely specified mealy machine
void split_separated_mealy_here(const twa_graph_ptr &m)
split a separated mealy machine
void reduce_mealy_here(twa_graph_ptr &mm, bool output_assignment=true)
reduce an (in)completely specified mealy machine
twa_graph_ptr unsplit_mealy(const const_twa_graph_ptr &m)
the inverse of split_separated_mealy
Definition: automata.hh:26
bool is_input_deterministic_mealy(const const_twa_graph_ptr &m)
Checks whether a mealy machine is input deterministic.
Benchmarking data and options for synthesis.
Definition: synthesis.hh:81

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