• Home
• net.automatalib
• automata-util
• 0.3.1
• source code
• Covers.java

×

Project download

Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance.
Project price only 1 $

You can buy this project and download/modify it how often you want.

net.automatalib.util.automata.Covers Maven / Gradle / Ivy

/* Copyright (C) 2013 TU Dortmund
 * This file is part of AutomataLib, http://www.automatalib.net/.
 * 
 * AutomataLib is free software; you can redistribute it and/or
 * modify it under the terms of the GNU Lesser General Public
 * License version 3.0 as published by the Free Software Foundation.
 * 
 * AutomataLib 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
 * Lesser General Public License for more details.
 * 
 * You should have received a copy of the GNU Lesser General Public
 * License along with AutomataLib; if not, see
 * http://www.gnu.de/documents/lgpl.en.html.
 */
package net.automatalib.util.automata;

import java.util.ArrayDeque;
import java.util.Collection;
import java.util.Queue;

import net.automatalib.automata.DeterministicAutomaton;
import net.automatalib.commons.util.mappings.MutableMapping;
import net.automatalib.words.Word;

class Covers {
	
	public static  void cover(DeterministicAutomaton automaton,
			Collection inputs, Collection> states, Collection> transitions) {
		
		MutableMapping> reach = automaton.createStaticStateMapping();
		
		Queue bfsQueue = new ArrayDeque();
		
		S init = automaton.getInitialState();
		
		reach.put(init, Word.epsilon());
		bfsQueue.offer(init);
		if(states != null)
			states.add(Word.epsilon());
		
		S curr;
		
		while((curr = bfsQueue.poll()) != null) {
			Word as = reach.get(curr);
			
			for(I in : inputs) {
				S succ = automaton.getSuccessor(curr, in);
				if(succ == null)
					continue;
				
				if(reach.get(succ) == null) {
					Word succAs = as.append(in);
					reach.put(succ, succAs);
					if(states != null)
						states.add(succAs);
					bfsQueue.offer(succ);
				}
				else if(transitions != null)
					transitions.add(as.append(in));
			}
		}
	}

}