spot  2.11.6
mealy_machine.hh
1 // -*- coding: utf-8 -*-
2 // Copyright (C) 2021-2022 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 
26 
27 namespace spot
28 {
29  // Forward decl
30  struct synthesis_info;
31 
43  SPOT_API bool
44  is_mealy(const const_twa_graph_ptr& m);
45 
57  SPOT_API bool
58  is_separated_mealy(const const_twa_graph_ptr& m);
59 
74  SPOT_API bool
75  is_split_mealy(const const_twa_graph_ptr& m);
76 
87  SPOT_API bool
88  is_input_deterministic_mealy(const const_twa_graph_ptr& m);
89 
90 
103  SPOT_API twa_graph_ptr
104  split_separated_mealy(const const_twa_graph_ptr& m);
105 
106  SPOT_API void
107  split_separated_mealy_here(const twa_graph_ptr& m);
109 
118  SPOT_API twa_graph_ptr
119  unsplit_mealy(const const_twa_graph_ptr& m);
120 
136  SPOT_API twa_graph_ptr
137  reduce_mealy(const const_twa_graph_ptr& mm,
138  bool output_assignment = true);
139 
140  SPOT_API void
141  reduce_mealy_here(twa_graph_ptr& mm,
142  bool output_assignment = true);
144 
159  SPOT_API twa_graph_ptr
160  minimize_mealy(const const_twa_graph_ptr& mm, int premin = -1);
161 
178 
179  SPOT_API twa_graph_ptr
180  minimize_mealy(const const_twa_graph_ptr& mm,
181  synthesis_info& si);
182 
183 
191  SPOT_API bool
192  is_split_mealy_specialization(const_twa_graph_ptr left,
193  const_twa_graph_ptr right,
194  bool verbose = false);
195 
202  SPOT_API twa_graph_ptr
203  mealy_product(const const_twa_graph_ptr& left,
204  const const_twa_graph_ptr& right);
205 
220  SPOT_API void
221  simplify_mealy_here(twa_graph_ptr& m, int minimize_lvl,
222  bool split_out);
223 
224  SPOT_API void
225  simplify_mealy_here(twa_graph_ptr& m, synthesis_info& si,
226  bool split_out);
228 }
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:27
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