spot 2.12.2
automata.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/misc/common.hh>
22#include <spot/twa/fwd.hh>
23#include <spot/twa/bdddict.hh>
24
25namespace spot
26{
27 namespace gen
28 {
33
36 AUT_BEGIN = 256,
45 AUT_KS_NCA = AUT_BEGIN,
120 AUT_END
121 };
122
132 SPOT_API twa_graph_ptr
134 spot::bdd_dict_ptr dict = make_bdd_dict());
135
140 SPOT_API const char* aut_pattern_name(aut_pattern_id pattern);
141
144 }
145}
aut_pattern_id
Identifiers for automaton patterns.
Definition: automata.hh:35
const char * aut_pattern_name(aut_pattern_id pattern)
convert an aut_pattern_it value into a name
twa_graph_ptr aut_pattern(aut_pattern_id pattern, int n, spot::bdd_dict_ptr dict=make_bdd_dict())
generate an automaton from a known pattern
@ AUT_CYCLE_ONEHOT_NBA
cycles of n letters repeated n times
Definition: automata.hh:119
@ AUT_CYCLE_LOG_NBA
cycles of n letters repeated n times
Definition: automata.hh:108
@ AUT_CYCLIST_PROOF_DBA
A DBA with (n+2) states derived from a Cyclic test case.
Definition: automata.hh:98
@ AUT_KS_NCA
A family of co-Büchi automata.
Definition: automata.hh:45
@ AUT_CYCLIST_TRACE_NBA
An NBA with (n+2) states derived from a Cyclic test case.
Definition: automata.hh:89
@ AUT_M_NBA
An NBA with (n+1) states whose complement needs ≥n! states.
Definition: automata.hh:80
@ AUT_L_NBA
Hard-to-complement non-deterministic Büchi automata.
Definition: automata.hh:57
@ AUT_L_DSA
DSA hard to convert to DRA.
Definition: automata.hh:69
Definition: automata.hh:26

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.4