a3753e608b
* spot/twaalgos/remprop.cc, spot/twaalgos/remprop.hh (to_finite): New function. * bin/autfilt.cc (--to-finite): Add it. * doc/org/tut12.org: Update to use it. * spot/twa/twagraph.cc (purge_dead_states): Also remove false edges. * spot/parseaut/parseaut.yy: Do not ignore false self-loops, and add false self-loop on accepting states without successors. * NEWS: List the above changes. * tests/core/ltlf.test: New file. * tests/Makefile.am: Add it. * tests/core/complete.test: Adjust expected output.
58 lines
1.8 KiB
C++
58 lines
1.8 KiB
C++
// -*- coding: utf-8 -*-
|
|
// Copyright (C) 2015, 2022 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 <vector>
|
|
#include <spot/tl/formula.hh>
|
|
#include <spot/twa/twagraph.hh>
|
|
|
|
namespace spot
|
|
{
|
|
class SPOT_API remove_ap
|
|
{
|
|
std::set<formula> props_exist;
|
|
std::set<formula> props_pos;
|
|
std::set<formula> props_neg;
|
|
public:
|
|
void add_ap(const char* ap_csv);
|
|
|
|
bool empty() const
|
|
{
|
|
return props_exist.empty() && props_pos.empty() && props_neg.empty();
|
|
}
|
|
|
|
twa_graph_ptr strip(const_twa_graph_ptr aut) const;
|
|
};
|
|
|
|
/// \brief Interpret the "live" part of an automaton as finite automaton.
|
|
///
|
|
/// This functions assumes that there is a property "alive" is
|
|
/// that either true or false on all transitions, and that can only
|
|
/// switch from true to false.
|
|
///
|
|
/// Because Spot does not support finite automata, this creates a
|
|
/// state-based Büchi automaton where any states with a !alive
|
|
/// outgoing transition in the original automaton is accepting, and
|
|
/// all alive/!alive occurrences are removed.
|
|
SPOT_API twa_graph_ptr
|
|
to_finite(const_twa_graph_ptr aut, const char* alive = "alive");
|
|
|
|
|
|
}
|