1a0fa3b722
This introduce some section for acceptance transformation, and add more comments in a few places. * spot/taalgos/emptinessta.hh, spot/twa/twa.hh, spot/twa/twagraph.hh, spot/twaalgos/bfssteps.hh, spot/twaalgos/cleanacc.hh, spot/twaalgos/degen.hh, spot/twaalgos/dualize.hh, spot/twaalgos/parity.hh, spot/twaalgos/rabin2parity.hh, spot/twaalgos/remfin.hh, spot/twaalgos/sccinfo.hh, spot/twaalgos/sepsets.hh, spot/twaalgos/split.hh, spot/twaalgos/totgba.hh: More doxygen. * spot/twa/twagraph.cc: Typos in comments.
59 lines
2.4 KiB
C++
59 lines
2.4 KiB
C++
// -*- coding: utf-8 -*-
|
|
// Copyright (C) 2017, 2018 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 <http://www.gnu.org/licenses/>.
|
|
|
|
#pragma once
|
|
|
|
#include <spot/misc/common.hh>
|
|
#include <spot/twa/fwd.hh>
|
|
|
|
namespace spot
|
|
{
|
|
/// \ingroup twa_misc
|
|
/// \brief Complement an automaton by dualizing it.
|
|
///
|
|
/// Given an automaton \a aut of any type, produces the dual as output. The
|
|
/// automaton will be completed if it isn't already. If it is deterministic
|
|
/// and complete, complementing the automaton can be done by just
|
|
/// complementing the acceptance condition.
|
|
///
|
|
/// In particular, this implies that an input that use generalized Büchi will
|
|
/// be output as generalized co-Büchi.
|
|
///
|
|
/// Functions like to_generalized_buchi() or remove_fin() are frequently
|
|
/// called on existential automata after dualize() to obtain an easier
|
|
/// acceptance condition, but maybe at the cost of losing determinism.
|
|
///
|
|
/// If the input automaton is deterministic, the output will be deterministic.
|
|
/// If the input automaton is existential, the output will be universal.
|
|
/// If the input automaton is universal, the output will be existential.
|
|
/// Finally, if the input automaton is alternating, the result is alternating.
|
|
/// More can be found on page 22 (Definition 1.6) of:
|
|
/** \verbatim
|
|
@mastersthesis{loding.98.methodsfor
|
|
author = {Christof Löding}
|
|
title = {Methods for the Transformation of ω-Automata: Complexity
|
|
and Connection to Second Order Logic}
|
|
school = {Institute of Computer Science and Applied Mathematics
|
|
Christian-Albrechts-University of Kiel}
|
|
year = {1998}
|
|
}
|
|
\endverbatim */
|
|
SPOT_API twa_graph_ptr
|
|
dualize(const const_twa_graph_ptr& aut);
|
|
}
|