hu.bme.mit.theta.frontend.petrinet.analysis.PtNetTransitionNextStateDescriptor Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of theta-petrinet-analysis Show documentation
Show all versions of theta-petrinet-analysis Show documentation
Petrinet Analysis subproject in the Theta model checking framework
/*
* Copyright 2024 Budapest University of Technology and Economics
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package hu.bme.mit.theta.frontend.petrinet.analysis;
import hu.bme.mit.delta.collections.IntObjCursor;
import hu.bme.mit.delta.collections.IntObjMapView;
import hu.bme.mit.theta.analysis.algorithm.mdd.ansd.AbstractNextStateDescriptor;
import hu.bme.mit.theta.analysis.algorithm.mdd.ansd.StateSpaceInfo;
import hu.bme.mit.theta.frontend.petrinet.model.Place;
import hu.bme.mit.theta.frontend.petrinet.model.Transition;
import java.util.NoSuchElementException;
public final class PtNetTransitionNextStateDescriptor implements AbstractNextStateDescriptor {
private Transition representedTransition;
private Place affectedPlace;
private int takes;
private int inhibits = Integer.MAX_VALUE;
private int puts;
private AbstractNextStateDescriptor continuation;
private int hashCode = 0;
public PtNetTransitionNextStateDescriptor(
final Transition representedTransition,
final Place affectedPlace,
final int takes,
final int inhibits,
final int puts,
final AbstractNextStateDescriptor continuation
) {
this.representedTransition = representedTransition;
this.affectedPlace = affectedPlace;
this.takes = takes;
this.inhibits = inhibits;
this.puts = puts;
this.continuation = continuation;
}
@Override
public IntObjMapView getDiagonal(final StateSpaceInfo localStateSpace) {
if (localStateSpace.getTraceInfo() == affectedPlace) {
return new IntObjMapView() {
@Override
public boolean isEmpty() {
// diagonal is empty if edge is not test or never enabled
return takes != puts || takes >= inhibits;
}
@Override
public boolean isProcedural() {
return true;
}
@Override
public boolean containsKey(final int key) {
return !isEmpty() && key >= takes && key < inhibits;
}
@Override
public AbstractNextStateDescriptor get(final int key) {
if (containsKey(key)) {
return continuation;
} else {
return defaultValue();
}
}
@Override
public AbstractNextStateDescriptor defaultValue() {
return AbstractNextStateDescriptor.terminalEmpty();
}
@Override
public IntObjCursor cursor() {
return new IntObjCursor() {
int current = takes - 1;
@Override
public int key() {
if (!containsKey(current)) {
throw new NoSuchElementException();
}
return current;
}
@Override
public AbstractNextStateDescriptor value() {
if (!containsKey(current)) {
throw new NoSuchElementException();
}
return continuation;
}
@Override
public boolean moveNext() {
return ++current < inhibits;
}
};
}
@Override
public int size() {
return (inhibits == Integer.MAX_VALUE) ? -1 : inhibits - takes;
}
};
} else {
return IntObjMapView.empty(this);
}
}
@Override
public IntObjMapView> getOffDiagonal(final StateSpaceInfo localStateSpace) {
if (localStateSpace.getTraceInfo() == affectedPlace) {
return new IntObjMapView>() {
@Override
public boolean isEmpty() {
// diagonal is empty if edge is not test or never enabled
return takes == puts || takes >= inhibits;
}
@Override
public boolean isProcedural() {
return true;
}
@Override
public boolean containsKey(final int key) {
return !isEmpty() && key >= takes && key < inhibits;
}
@Override
public IntObjMapView get(final int from) {
if (containsKey(from)) {
return new IntObjMapView() {
@Override
public boolean isEmpty() {
return false;
}
@Override
public boolean isProcedural() {
return false;
}
@Override
public boolean containsKey(final int to) {
return to == from - takes + puts;
}
@Override
public AbstractNextStateDescriptor get(final int to) {
if (containsKey(to)) {
return continuation;
} else {
return defaultValue();
}
}
@Override
public AbstractNextStateDescriptor defaultValue() {
return AbstractNextStateDescriptor.terminalEmpty();
}
@Override
public IntObjCursor cursor() {
return new IntObjCursor() {
int current = from - takes + puts - 1;
@Override
public int key() {
if (!containsKey(current)) {
throw new NoSuchElementException();
}
return current;
}
@Override
public AbstractNextStateDescriptor value() {
if (!containsKey(current)) {
throw new NoSuchElementException();
}
return continuation;
}
@Override
public boolean moveNext() {
return ++current <= from - takes + puts;
}
};
}
@Override
public int size() {
return 1;
}
};
} else {
return defaultValue();
}
}
@Override
public IntObjMapView defaultValue() {
return IntObjMapView.empty();
}
@Override
public IntObjCursor> cursor() {
return new IntObjCursor>() {
int current = takes - 1;
@Override
public int key() {
if (!containsKey(current)) {
throw new NoSuchElementException();
}
return current;
}
@Override
public IntObjMapView value() {
if (!containsKey(current)) {
throw new NoSuchElementException();
}
return get(current);
}
@Override
public boolean moveNext() {
return ++current < inhibits;
}
};
}
@Override
public int size() {
return (inhibits == Integer.MAX_VALUE) ? -1 : inhibits - takes;
}
};
} else {
return IntObjMapView.empty(IntObjMapView.empty(AbstractNextStateDescriptor.terminalEmpty()));
}
}
@Override
public boolean equals(final Object o) {
if (this == o) return true;
if (!(o instanceof PtNetTransitionNextStateDescriptor)) return false;
final PtNetTransitionNextStateDescriptor that = (PtNetTransitionNextStateDescriptor) o;
if (takes != that.takes) return false;
if (inhibits != that.inhibits) return false;
if (puts != that.puts) return false;
if (affectedPlace != null ? !affectedPlace.equals(that.affectedPlace) : that.affectedPlace != null)
return false;
return continuation != null ? continuation.equals(that.continuation) : that.continuation == null;
}
@Override
public int hashCode() {
if (hashCode != 0) {
return hashCode;
}
hashCode = affectedPlace != null ? affectedPlace.hashCode() : 0;
hashCode = 31 * hashCode + takes;
hashCode = 31 * hashCode + inhibits;
hashCode = 31 * hashCode + puts;
hashCode = 31 * hashCode + (continuation != null ? continuation.hashCode() : 0);
return hashCode;
}
@Override
public String toString() {
return representedTransition.toString();
}
}