19995144613

Committed 06 Dec 2025 10:24PM UTC coverage: 92.834% (+0.04%) from 92.796%

Build # 19995144613

Build Type

push

github

Committed by

mtf90

Commit Message

simplify procedural implementations

since the output semantics now better handle partial systems, get rid of explicit sink management

Run Details

42 of 45 new or added lines in 5 files covered. (93.33%)

4 existing lines in 4 files now uncovered.

17191 of 18518 relevant lines covered (92.83%)

1.72 hits per line

Source File
Press 'n' to go to next uncovered line, 'b' for previous

87.5

/api/src/main/java/net/automatalib/ts/acceptor/AcceptorTS.java

/* Copyright (C) 2013-2025 TU Dortmund University
 * This file is part of AutomataLib <https://automatalib.net>.
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 *     http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */
package net.automatalib.ts.acceptor;

import java.util.Collection;

import net.automatalib.automaton.concept.SuffixOutput;
import net.automatalib.ts.AcceptorPowersetViewTS;
import net.automatalib.ts.UniversalTransitionSystem;
import net.automatalib.ts.concept.OutputTS;
import net.automatalib.ts.powerset.AcceptorPowersetView;

/**
 * A transition system whose semantics are defined by whether a state is "accepting" or not.
 *
 * @param <S>
 *         state class
 * @param <I>
 *         input symbol class
 */
public interface AcceptorTS<S, I> extends UniversalTransitionSystem<S, I, S, Boolean, Void>,
                                          OutputTS<S, I, S, Boolean>,
                                          SuffixOutput<I, Boolean> {

    /**
     * Determines whether the given input word is accepted by this acceptor.
     *
     * @param input
     *         the input word.
     *
     * @return {@code true} if the input word is accepted, {@code false} otherwise.
     */
    default boolean accepts(Iterable<? extends I> input) {
        Collection<S> states = getStates(input);

        return isAccepting(states);
    }

    /**
     * Checks whether the given state is accepting.
     *
     * @param state
     *         the state
     *
     * @return {@code true} if the state is accepting, {@code false} otherwise.
     */
    boolean isAccepting(S state);

    boolean isAccepting(Collection<? extends S> states);

    @Override
    default Boolean computeOutput(Iterable<? extends I> input) {
        return accepts(input);
    }

    @Override
    default Boolean computeSuffixOutput(Iterable<? extends I> prefix, Iterable<? extends I> suffix) {
        return isAccepting(getSuccessors(getStates(prefix), suffix));
    }

    @Override
    default Boolean getStateProperty(S state) {
        return isAccepting(state);
    }

    @Override
    default Void getTransitionProperty(S transition) {
        return null;
    }

    @Override
    default S getSuccessor(S transition) {
        return transition;
    }

    @Override
    default AcceptorPowersetViewTS<?, I, S> powersetView() {
        return new AcceptorPowersetView<>(this);
    }
}

1	/* Copyright (C) 2013-2025 TU Dortmund University
2	* This file is part of AutomataLib <https://automatalib.net>.
3	*
4	* Licensed under the Apache License, Version 2.0 (the "License");
5	* you may not use this file except in compliance with the License.
6	* You may obtain a copy of the License at
7	*
8	* http://www.apache.org/licenses/LICENSE-2.0
9	*
10	* Unless required by applicable law or agreed to in writing, software
11	* distributed under the License is distributed on an "AS IS" BASIS,
12	* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
13	* See the License for the specific language governing permissions and
14	* limitations under the License.
15	*/
16	package net.automatalib.ts.acceptor;
17
18	import java.util.Collection;
19
20	import net.automatalib.automaton.concept.SuffixOutput;
21	import net.automatalib.ts.AcceptorPowersetViewTS;
22	import net.automatalib.ts.UniversalTransitionSystem;
23	import net.automatalib.ts.concept.OutputTS;
24	import net.automatalib.ts.powerset.AcceptorPowersetView;
25
26	/**
27	* A transition system whose semantics are defined by whether a state is "accepting" or not.
28	*
29	* @param <S>
30	* state class
31	* @param <I>
32	* input symbol class
33	*/
34	public interface AcceptorTS<S, I> extends UniversalTransitionSystem<S, I, S, Boolean, Void>,
35	OutputTS<S, I, S, Boolean>,
36	SuffixOutput<I, Boolean> {
37
38	/**
39	* Determines whether the given input word is accepted by this acceptor.
40	*
41	* @param input
42	* the input word.
43	*
44	* @return {@code true} if the input word is accepted, {@code false} otherwise.
45	*/
46	default boolean accepts(Iterable<? extends I> input) {
47	Collection<S> states = getStates(input);	1✔
48
49	return isAccepting(states);	1✔
50	}
51
52	/**
53	* Checks whether the given state is accepting.
54	*
55	* @param state
56	* the state
57	*
58	* @return {@code true} if the state is accepting, {@code false} otherwise.
59	*/
60	boolean isAccepting(S state);
61
62	boolean isAccepting(Collection<? extends S> states);
63
64	@Override
65	default Boolean computeOutput(Iterable<? extends I> input) {
66	return accepts(input);	1✔
67	}
68
69	@Override
70	default Boolean computeSuffixOutput(Iterable<? extends I> prefix, Iterable<? extends I> suffix) {
71	return isAccepting(getSuccessors(getStates(prefix), suffix));	1✔
72	}
73
74	@Override
75	default Boolean getStateProperty(S state) {
76	return isAccepting(state);	1✔
77	}
78
79	@Override
80	default Void getTransitionProperty(S transition) {
81	return null;	1✔
82	}
83
84	@Override
85	default S getSuccessor(S transition) {
86	return transition;	1✔
87	}
88
89	@Override
90	default AcceptorPowersetViewTS<?, I, S> powersetView() {
UNCOV 91	return new AcceptorPowersetView<>(this);	×
92	}
93	}

LearnLib / automatalib / 19995144613

Source File Press 'n' to go to next uncovered line, 'b' for previous

Source File
Press 'n' to go to next uncovered line, 'b' for previous