Package org.bigraphs.framework.core.reactivesystem
package org.bigraphs.framework.core.reactivesystem
-
ClassDescriptionThis base class represents an immutable data structure for all kinds of reaction rules.Abstract class of a "nice and simple" bigraphical reactive system (BRS).AbstractSimpleReactiveSystem.TransitionSystemBoundSimpleReactiveSystem<B extends Bigraph<? extends Signature<?>>>A bigraphical reactive system (BRS) bounded to a reaction graph.Abstract base class representing the minimal data structure for all concrete transition system implementations.This interface represents a result of a bigraph matching and is used by the
BigraphMatchingEngine
in the simulation module.Generic interface for bigraph rewriting matching results.Concrete implementation of a ground reaction rule.Marker interface that indicates the object has a label.Marker interface that indicates the object has a label.An instantiation map for a parametric reaction rule.Concrete implementation of a parametric reaction rule.This data structure represents a "reaction graph", analogous to a labeled transition system.This class represents a "collapsed", "reduced" reaction graph, possibly consolidated by a minimization algorithm (e.g., bisim minimization).Common interface for reaction rules.ReactionRuleComposer<R extends ReactionRule<?>>Base interface for bigraphical reactive systems.Predicate interface for the reaction graph.Tracking map for reaction rules.A transition of a labelled transition system is a triple containing the source and target and the label (i.e., the arrow itself which is a bigraph as well).