28013097648

Committed 23 Jun 2026 08:30AM UTC coverage: 92.876% (-0.1%) from 93.007%

Build # 28013097648

Build Type

Pull #103

github

Committed by

web-flow

Commit Message

Merge 1553bac46 into 87b9d660b

Pull Request Pull Request #103: Distinguish between structural and semantic interpretations of automata

Coverage Stats

268 of 313 new or added lines in 46 files covered. (85.62%)

5 existing lines in 2 files now uncovered.

17560 of 18907 relevant lines covered (92.88%)

1.72 hits per line

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

85.71

/core/src/main/java/net/automatalib/automaton/impl/UniversalCompactDetAutomaton.java

/* Copyright (C) 2013-2026 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.automaton.impl;

import net.automatalib.alphabet.Alphabet;
import net.automatalib.automaton.AutomatonCreator;
import net.automatalib.automaton.MutableDeterministic;
import net.automatalib.automaton.MutableDeterministic.FiniteSemantics;

/**
 * A refinement of {@link UniversalCompactDet} that additionally implements {@link MutableDeterministic.FiniteSemantics}
 * so that structural determinism and finiteness coincides with semantic determinism and finiteness.
 *
 * @param <I>
 *         input symbol type
 * @param <SP>
 *         state property type
 * @param <TP>
 *         transition property type
 */
public class UniversalCompactDetAutomaton<I, SP, TP> extends UniversalCompactDet<I, SP, TP>
        implements FiniteSemantics<Integer, I, CompactTransition<TP>, SP, TP> {

    public UniversalCompactDetAutomaton(Alphabet<I> alphabet) {
        super(alphabet);
    }

    public UniversalCompactDetAutomaton(Alphabet<I> alphabet, int stateCapacity) {
        super(alphabet, stateCapacity);
    }

    public static final class Creator<I, SP, TP>
            implements AutomatonCreator<UniversalCompactDetAutomaton<I, SP, TP>, I> {

        @Override
        public UniversalCompactDetAutomaton<I, SP, TP> createAutomaton(Alphabet<I> alphabet, int numStates) {
            return new UniversalCompactDetAutomaton<>(alphabet, numStates);
        }

        @Override
        public UniversalCompactDetAutomaton<I, SP, TP> createAutomaton(Alphabet<I> alphabet) {
            return new UniversalCompactDetAutomaton<>(alphabet);
        }
    }
}

1	/* Copyright (C) 2013-2026 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.automaton.impl;
17
18	import net.automatalib.alphabet.Alphabet;
19	import net.automatalib.automaton.AutomatonCreator;
20	import net.automatalib.automaton.MutableDeterministic;
21	import net.automatalib.automaton.MutableDeterministic.FiniteSemantics;
22
23	/**
24	* A refinement of {@link UniversalCompactDet} that additionally implements {@link MutableDeterministic.FiniteSemantics}
25	* so that structural determinism and finiteness coincides with semantic determinism and finiteness.
26	*
27	* @param <I>
28	* input symbol type
29	* @param <SP>
30	* state property type
31	* @param <TP>
32	* transition property type
33	*/
34	public class UniversalCompactDetAutomaton<I, SP, TP> extends UniversalCompactDet<I, SP, TP>
35	implements FiniteSemantics<Integer, I, CompactTransition<TP>, SP, TP> {
36
37	public UniversalCompactDetAutomaton(Alphabet<I> alphabet) {
38	super(alphabet);	2✔
39	}	2✔
40
41	public UniversalCompactDetAutomaton(Alphabet<I> alphabet, int stateCapacity) {
42	super(alphabet, stateCapacity);	2✔
43	}	2✔
44
45	public static final class Creator<I, SP, TP>	2✔
46	implements AutomatonCreator<UniversalCompactDetAutomaton<I, SP, TP>, I> {
47
48	@Override
49	public UniversalCompactDetAutomaton<I, SP, TP> createAutomaton(Alphabet<I> alphabet, int numStates) {
50	return new UniversalCompactDetAutomaton<>(alphabet, numStates);	2✔
51	}
52
53	@Override
54	public UniversalCompactDetAutomaton<I, SP, TP> createAutomaton(Alphabet<I> alphabet) {
NEW 55	return new UniversalCompactDetAutomaton<>(alphabet);	×
56	}
57	}
58	}

LearnLib / automatalib / 28013097648

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