/*
* Copyright (C) 2013-2015 Matthias Heizmann (heizmann@informatik.uni-freiburg.de)
* Copyright (C) 2009-2015 University of Freiburg
*
* This file is part of the ULTIMATE Automata Library.
*
* The ULTIMATE Automata Library is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License as published
* by the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* The ULTIMATE Automata Library 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 the ULTIMATE Automata Library. If not, see .
*
* Additional permission under GNU GPL version 3 section 7:
* If you modify the ULTIMATE Automata Library, or any covered work, by linking
* or combining it with Eclipse RCP (or a modified version of Eclipse RCP),
* containing parts covered by the terms of the Eclipse Public License, the
* licensors of the ULTIMATE Automata Library grant you additional permission
* to convey the resulting work.
*/
package de.uni_freiburg.informatik.ultimate.automata.petrinet.operations;
import de.uni_freiburg.informatik.ultimate.automata.AutomataLibraryException;
import de.uni_freiburg.informatik.ultimate.automata.AutomataLibraryServices;
import de.uni_freiburg.informatik.ultimate.automata.nestedword.INestedWordAutomaton;
import de.uni_freiburg.informatik.ultimate.automata.nestedword.INwaOutgoingLetterAndTransitionProvider;
import de.uni_freiburg.informatik.ultimate.automata.nestedword.UnaryNwaOperation;
import de.uni_freiburg.informatik.ultimate.automata.petrinet.IPetriNet;
import de.uni_freiburg.informatik.ultimate.automata.petrinet.IPetriNetAndAutomataInclusionStateFactory;
import de.uni_freiburg.informatik.ultimate.automata.petrinet.netdatastructures.BoundedPetriNet;
/**
* Transforms an {@link INestedWordAutomaton} to a {@link BoundedPetriNet}.
*
* @author Matthias Heizmann (heizmann@informatik.uni-freiburg.de)
* @param
* letter type
* @param
* state/place type
*/
public final class Automaton2Net
extends UnaryNwaOperation> {
private final INestedWordAutomaton mOperand;
private final BoundedPetriNet mNet;
/**
* Constructor.
*
* @param services
* Ultimate services
* @param operand
* operand
* @throws AutomataLibraryException
* if construction fails
*/
public Automaton2Net(final AutomataLibraryServices services, final INestedWordAutomaton operand)
throws AutomataLibraryException {
super(services);
mOperand = operand;
if (mLogger.isInfoEnabled()) {
mLogger.info(startMessage());
}
mNet = new BoundedPetriNet<>(mServices, mOperand);
if (mLogger.isInfoEnabled()) {
mLogger.info(exitMessage());
}
}
@Override
protected INwaOutgoingLetterAndTransitionProvider getOperand() {
return mOperand;
}
@Override
public IPetriNet getResult() {
return mNet;
}
@Override
public String exitMessage() {
return "Finished " + getOperationName() + ". PetriNet " + mNet.sizeInformation();
}
@Override
public boolean checkResult(final IPetriNetAndAutomataInclusionStateFactory stateFactory)
throws AutomataLibraryException {
if (mLogger.isInfoEnabled()) {
mLogger.info("Testing correctness of constructor" + mNet.getClass().getSimpleName());
}
final boolean correct = new IsEquivalent<>(mServices, stateFactory, mNet, mOperand).getResult();
if (mLogger.isInfoEnabled()) {
mLogger.info("Finished testing correctness of constructor " + mNet.getClass().getSimpleName());
}
return correct;
}
}