alarsyo/spot
1
0
Fork 0
Code Issues Pull requests Projects Releases Wiki Activity

rabin_to_buchi_if_realizable: new function

Browse source 
* spot/twaalgos/remfin.cc, spot/twaalgos/remfin.hh: Implement it.
* tests/python/tra2tba.py: Test it.
* NEWS: Mention it.
This commit is contained in:
Alexandre Duret-Lutz 2020-02-05 17:41:52 +01:00
parent bf4a0ccffd
commit febbe5c2e3
4 changed files with 118 additions and 10 deletions
Download patch file Download diff file Expand all files Collapse all files

37
spot/twaalgos/remfin.hh
View file

@ -1,5 +1,5 @@
// -*- coding: utf-8 -*-
// Copyright (C) 2015, 2017, 2018 Laboratoire de Recherche et
// Copyright (C) 2015, 2017, 2018, 2020 Laboratoire de Recherche et
// Développement de l'Epita.
//
// This file is part of Spot, a model checking library.
@ -24,15 +24,37 @@
namespace spot
{
/// \ingroup twa_acc_transform
/// \brief Check if \aut is Büchi-realizable. This is inspired
/// from rabin_to_buchi_maybe()'s algorithm. The main difference is that
/// here, no automaton is built.
/// \brief Check if \a aut is Rablin-like and Büchi-realizable.
///
/// This is inspired from rabin_to_buchi_maybe()'s algorithm. The
/// main difference is that here, no automaton is built.
///
/// If the input is non-deterministic, this algorithm may fail
/// to detect Büchi-realizability (false-negative).
SPOT_API bool
rabin_is_buchi_realizable(const const_twa_graph_ptr& aut);
/// \ingroup twa_acc_transform
/// \brief Convert a Rabin automaton to Büchi automaton, preserving
/// determinism when possible.
/// \brief Convert a Rabin-like automaton into a Büchi automaton only
/// when it can be done without changing the automaton structure.
///
/// If \a aut is a Rabin-like automaton that is not Büchi-realizable,
/// this returns a Büchi automaton equivalent to \a aut that use
/// exactly the same transition structure (the order of edges is
/// even preserved). In particular, determinism is preserved.
///
/// If \a aut is not a Rabin-like automaton or is not
/// Büchi-realizable, return `nullptr`.
///
/// If the input is non-deterministic, this algorithm may fail
/// to detect Büchi-realizability (false-negative).
SPOT_API twa_graph_ptr
rabin_to_buchi_if_realizable(const const_twa_graph_ptr& aut);
/// \ingroup twa_acc_transform
///
/// \brief Convert a Rabin-like automaton into a Büchi automaton,
/// preserving determinism when possible.
///
/// Return nullptr if the input is not a Rabin (or Rabin-like)
/// automaton.
@ -43,7 +65,8 @@ namespace spot
///
/// Unless you know what you are doing, you are probably better off
/// calling remove_fin() instead, as this will call more specialized
/// algorithms (e.g., for weak automata) when appropriate.
/// algorithms (e.g., for weak automata) when appropriate, and will
/// deal with more than just Rabin-like automata.
SPOT_API twa_graph_ptr
rabin_to_buchi_maybe(const const_twa_graph_ptr& aut);