001/* Copyright (C) 2013 TU Dortmund 002 * This file is part of AutomataLib, http://www.automatalib.net/. 003 * 004 * AutomataLib is free software; you can redistribute it and/or 005 * modify it under the terms of the GNU Lesser General Public 006 * License version 3.0 as published by the Free Software Foundation. 007 * 008 * AutomataLib is distributed in the hope that it will be useful, 009 * but WITHOUT ANY WARRANTY; without even the implied warranty of 010 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU 011 * Lesser General Public License for more details. 012 * 013 * You should have received a copy of the GNU Lesser General Public 014 * License along with AutomataLib; if not, see 015 * http://www.gnu.de/documents/lgpl.en.html. 016 */ 017package net.automatalib.graphs; 018 019/** 020 * A finite LTS is an {@link IndefiniteLTS} with a finite number of nodes. 021 * 022 * @author Malte Isberner <malte.isberner@gmail.com> 023 * 024 * @param <N> node class 025 * @param <E> edge class 026 * @param <L> label class 027 */ 028public interface FiniteLTS<N, E, L> extends Graph<N,E>, IndefiniteLTS<N,E,L> { 029 030}