All Downloads are FREE. Search and download functionalities are using the official Maven repository.

de.uni.freiburg.iig.telematik.sepia.petrinet.abstr.AbstractTransition Maven / Gradle / Ivy

Go to download

SEPIA provides implementations for various types of Petri nets. Along Place/Transition-nets, it supports Petri nets with distinguishable token colors and defines coloured workflow nets, where coloured tokens are interpreted as data elements used during process execution. To support information flow analysis of processes, SEPIA defines so-called IF-Nets, tailored for security-oriented workflow modeling which enable users to assign security-levels (HIGH, LOW) to transitions, data elements and persons/agents participating in the process execution.

The newest version!
/* 
 * Copyright (c) 2015, IIG Telematics, Uni Freiburg
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted (subject to the limitations in the disclaimer
 * below) 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 IIG Telematics, Uni Freiburg nor the names of its
 *   contributors may be used to endorse or promote products derived from this
 *   software without specific prior written permission.
 *
 * NO EXPRESS OR IMPLIED LICENSES TO ANY PARTY'S PATENT RIGHTS ARE GRANTED BY
 * THIS LICENSE. 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 HOLDER OR
 * CONTRIBUTORS BELIABLE 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 de.uni.freiburg.iig.telematik.sepia.petrinet.abstr;

import java.io.Serializable;

import de.invation.code.toval.validate.ParameterException;
import de.uni.freiburg.iig.telematik.sepia.event.TransitionEvent;
import de.uni.freiburg.iig.telematik.sepia.event.TransitionListener;
import de.uni.freiburg.iig.telematik.sepia.event.TransitionListenerSupport;
import de.uni.freiburg.iig.telematik.sepia.exception.PNException;
import de.uni.freiburg.iig.telematik.sepia.exception.PNValidationException;

/**
 * 
 * Abstract class that defines general properties for Petri net transitions.
* This class inherits basic Petri net node properties from {@link AbstractPNNode}
* and defines additional properties:
*
    *
  • Enabled state: Based on the state of connectet places,
    * transitions can be enabled. Enabled transitions can fire,
    * which means that they remove tokens from incoming places and put tokens in outgoing places.
  • *
  • Silent state: In some cases, Petri nets are modeled with additional
    * non-functional transitions to reach a more compact net shape.
    * To distinguish such transitions from regular net transitions, they can be set silent.
  • *
*
* A transition allows {@link TransitionListener}s to register so that they can be notified on state changes,
* i.e. enabling/disabling/firing. * * @author Thomas Stocker * * @param The type of flow relations connected to the transition. * @param */ public abstract class AbstractTransition< E extends AbstractFlowRelation, ? extends AbstractTransition, S>, S extends Object> extends AbstractPNNode implements Serializable{ private static final long serialVersionUID = 6881631518539919772L; /** * Support class for {@link TransitionListener} handling. */ protected TransitionListenerSupport> listenerSupport = new TransitionListenerSupport<>(); /** * Indicates the silent-state of the transition.
* If true, the transition is treated as silent transition. */ protected boolean isSilent = false; /** * Indicates the enabled-state of the transition
* If true, the transition can fire. */ protected boolean enabled = true; //------- Constructors ---------------------------------------------------------------------------- // protected AbstractTransition(){ // super(PNNodeType.TRANSITION); // } /** * Creates a new transition with the given name. * @param name The name for the new Transition. * @throws ParameterException If the given name is null. */ public AbstractTransition(String name){ super(PNNodeType.TRANSITION, name); } /** * Creates a new transition with the given name and label. * @param name The name for the new transition. * @param label The label for the new transition. * @throws ParameterException If some parameters are null. */ public AbstractTransition(String name, String label){ super(PNNodeType.TRANSITION, name, label); } /** * Creates a new transition with the given name and silent-state. * @param name The name for the new transition. * @param isSilent The silent-state for the new transition. * @throws ParameterException If the given name is null. */ public AbstractTransition(String name, boolean isSilent){ this(name); this.isSilent = isSilent; } /** * Creates a new transition with the given name, label and silent-state. * @param name The name for the new transition. * @param label The label for the new transition. * @param isSilent The silent-state for the new transition. * @throws ParameterException If some parameters are null. */ public AbstractTransition(String name, String label, boolean isSilent){ this(name, label); this.isSilent = isSilent; } //------- Basic properties ----------------------------------------------------------------------- @Override protected boolean addIncomingRelation(E relation) { if (super.addIncomingRelation(relation)) { checkState(); return true; } return false; } @Override protected boolean addOutgoingRelation(E relation) { if (super.addOutgoingRelation(relation)) { checkState(); return true; } return false; } @Override protected boolean removeIncomingRelation(E relation) { if (super.removeIncomingRelation(relation)) { checkState(); return true; } return false; } @Override protected boolean removeOutgoingRelation(E relation) { if (super.removeOutgoingRelation(relation)) { checkState(); return true; } return false; } /** * Indicates if the transition is silent.
* @return true if the transition is silent;
* false otherwise. */ public boolean isSilent(){ return isSilent; } /** * Sets the silent-state of the transition. * @param isSilent Desired silent-state of the transition. */ public void setSilent(boolean isSilent){ this.isSilent = isSilent; } /** * Indicates the enabled-state of the transition. * @return true if the transition is enabled;
* false otherwise. */ public boolean isEnabled() { return enabled; } // @Override // protected void setName(String name){ // Validate.notNull(name); // if(!listenerSupport.requestNameChangePermission(this, name)) // throw new ParameterException(ErrorCode.INCONSISTENCY, "A connected Petri net already contains a node with this name.\n Cancel renaming to avoid name clash."); // this.name = name; // } public int outDegree(){ return getOutgoingRelations().size(); } public int inDegree(){ return getIncomingRelations().size(); } /** * Checks if the Petri net transition is valid.
* Subclasses may define the validity of a net transition e.g. in terms of specific constraints * and must throw PNValidationExceptions in case any constraint is violated. * * @throws PNValidationException */ public void checkValidity() throws PNValidationException{} //------- Functionality -------------------------------------------------------------------------- /** * Checks the enabled-state of the transition based on the state of connected places.
* It checks if the input places contain the required tokens and the output places have enough capacity to consume produced tokens.
* Depending on the state representation of places this may require different check routines,
* which have to be implemented by subclasses.
*
* If the transition gets enabled or disabled, the transition notifies all transition listeners. * * @see AbstractTransition#enoughTokensInInputPlaces() * @see AbstractTransition#enoughSpaceInOutputPlaces() */ public void checkState() { boolean oldEnabledState = isEnabled(); enabled = true; if(!enoughTokensInInputPlaces()){ enabled = false; } if(!enoughSpaceInOutputPlaces()){ enabled = false; } if(enabled && !oldEnabledState){ listenerSupport.notifyEnabling(new TransitionEvent<>(this)); } else if(!enabled && oldEnabledState){ listenerSupport.notifyDisabling(new TransitionEvent<>(this)); } } /** * Checks, if the input places connected to the transition contain enough tokens,
* i.e. satisfy the token constraints of the corresponding incoming relations. * * @return true if all token constraints are satisfied;
* false otherwise. */ protected abstract boolean enoughTokensInInputPlaces(); /** * Checks if the output places connected to the transition can consume all produced tokens, i.e. have enough capacity. * * @return true if all tokens can be consumed;
* false otherwise. */ protected abstract boolean enoughSpaceInOutputPlaces(); /** * Fires the transition.
* On firing, the transition removes tokens from incoming places and puts tokens in outgoing places.
* Depending on the state representation of places this may require different check routines,
* which have to be implemented by subclasses. * * @throws PNException If transition is not enabled or not in a valid state. */ public void fire() throws PNException{ if(!isEnabled()) throw new PNException("Cannot fire transition "+this+": not enabled"); try{ checkValidity(); } catch(PNValidationException e){ throw new PNException("Cannot fire transition "+this+": not in valid state ["+e.getMessage()+"]"); } for (E r : incomingRelations.values()) { r.getPlace().removeTokens(r.getConstraint()); } for (E r : outgoingRelations.values()) { r.getPlace().addTokens(r.getConstraint()); } notifyFiring(); } protected void notifyFiring(){ listenerSupport.notifyFiring(new TransitionEvent<>(this)); } //------- Listener support ------------------------------------------------------------------------ /** * Adds a transition listener. * @param listener The transition listener to add. * @throws ParameterException If the listener reference is null. */ public void addTransitionListener(TransitionListener> listener){ listenerSupport.addListener(listener); } /** * Removes a transition listener. * @param l The transition listener to remove. * @throws ParameterException If the listener reference is null. */ public void removeTransitionListener(TransitionListener> l){ listenerSupport.removeListener(l); } @Override protected abstract AbstractTransition newInstance(String name); //------- hashCode and equals -------------------------------------------------------------------- @Override public int hashCode() { final int prime = 31; int result = super.hashCode(); result = prime * result + (isSilent ? 1231 : 1237); return result; } @Override public boolean equals(Object obj) { if (this == obj) { return true; } if (!super.equals(obj)) { return false; } if (getClass() != obj.getClass()) { return false; } @SuppressWarnings("unchecked") AbstractTransition other = (AbstractTransition) obj; if (isSilent != other.isSilent) { return false; } return true; } //------- clone ---------------------------------------------------------------------------------- @Override public AbstractTransition clone() { @SuppressWarnings("unchecked") AbstractTransition result = (AbstractTransition) super.clone(); result.setSilent(isSilent()); return result; } }




© 2015 - 2025 Weber Informatics LLC | Privacy Policy