Project: bml_realizer License: BSD Dependencies: bml_msgs bml_srvs bml_lib rosjava Used by: None All Packages

bml_realizer/src/edu/wpi/hri/bml/net/Transition.java Go to the documentation of this file. /* * Software License Agreement (BSD License) * * Copyright (c) 2010, Worcester Polytechnic Institute * All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * * * Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * * Redistributions in binary form must reproduce the above * copyright notice, this list of conditions and the following * disclaimer in the documentation and/or other materials provided * with the distribution. * * Neither the name of Worcester Polytechnic Institute. nor the names * of its contributors may be used to endorse or promote products * derived from this software without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE * POSSIBILITY OF SUCH DAMAGE. */ package edu.wpi.hri.bml.net; import java.util.HashSet; import java.util.Hashtable; import java.util.List; import java.util.Set; import edu.wpi.hri.log.Logger; import edu.wpi.hri.log.Logger.LoggerLevel; public class Transition extends PetriPart { private Hashtable<Place, Boolean> inputs; private Set<Place> outputs; private final String name; public Transition(ThreadGroup group, Logger sublog, String name) { super(group, sublog, name); this.name = name; this.inputs = new Hashtable<Place, Boolean>(); this.outputs = new HashSet<Place>(); } public String getName() { return name; } @Override protected boolean checkRequirements() { if (inputs.size() > 0) for (Place p : inputs.keySet()) { Boolean b = inputs.get(p); logger.debug(LoggerLevel.ALL, "Transition checking [" + p.getName() + "] of " + b); if (!b) return false; } return true; } @Override protected void execute() throws PetriException { // Intentionally left blank, nothing to do } @Override protected void sendTokens() { sendTokensTo(outputs); } @Override protected void tokenFrom(PetriPart from) { if (from instanceof Place) { Place p = (Place) from; if (inputs.containsKey(p)) inputs.put(p, true); } } @Override public boolean existsCycle(List<PetriPart> beento) { if (beento.contains(this)) return true; beento.add(this); boolean cycle = false; for (Place p : outputs) cycle = cycle || p.existsCycle(beento); beento.remove(this); return cycle; } public boolean addInput(Place p) { if (inputs.containsKey(p)) return false; else { inputs.put(p, false); return true; } } public boolean addOutput(Place p) { return outputs.add(p); } public boolean mergeWith(Transition trans) { logger.debug(LoggerLevel.SCHEDULE, "Merging with Transition " + trans.name); // first check that the inputs can be moved from the places Set<Place> ins = new HashSet<Place>(); for (Place p : trans.inputs.keySet()) if (p.replaceOutput(trans, this)) ins.add(p); // Then if not all of them replaced, it didn't work if (ins.size() != trans.inputs.keySet().size()) { for (Place p : ins) p.replaceOutput(this, trans); logger.debug(LoggerLevel.SCHEDULE, "The inputs failed ..."); return false; } logger.debug(LoggerLevel.SCHEDULE, "The inputs can be moved properly ..."); // Second check that the outputs can be moved from the places Set<Place> outs = new HashSet<Place>(); for (Place p : trans.outputs) if (p.replaceInput(trans, this)) outs.add(p); // Then we know how many succeeded, and can ensure it all worked if (outs.size() == trans.outputs.size()) { logger.debug(LoggerLevel.SCHEDULE, "The outputs can be moved properly ..."); for (Place p : ins) this.inputs.put(p, false); for (Place p : outs) this.outputs.add(p); return true; } else { logger.debug(LoggerLevel.SCHEDULE, "The outputs failed ..."); // at least one of the replaces failed for (Place p : outs) p.replaceInput(this, trans); return false; } } public void end() { if(thread.isAlive()) { status = false; start(); } finish(); } }

---

bml_realizer
Author(s): Aaron Holroyd (aholroyd (at) wpi (dot) edu)
autogenerated on Fri Sep 9 10:44:12 2011