All Classes and Interfaces

Class
Description
AbstractBigraphMatcher<B extends Bigraph<? extends Signature<?>>>
This class is responsible for executing bigraph matching.
An adapter for bigraphs used for the matching procedure.
Data structure to represent a pair
AndPredicate<B extends Bigraph<? extends Signature<?>>>
A composite predicate which concatenates all given predicates with the and operator.
This helper class creates a unique (canonical) label for a place graph of a bigraph such that two isomorphic place graphs have the same label.
 
 
BigraphHashFunction<B extends Bigraph<? extends Signature<?>>>
Base interface to implement hash functions for bigraphs.
BigraphIsoPredicate<B extends Bigraph<? extends Signature<?>>>
Predicate implementation that returns true if two bigraphs are isomorphic (i.e., structurally equivalent).
BigraphMatchingEngine<B extends Bigraph<? extends Signature<?>>>
Interface for implementing a matching algorithm for a concrete bigraph kind (e.g., pure bigraphs).
 
BigraphModelChecker<B extends Bigraph<? extends Signature<?>>>
A bigraph model checker that allows to simulate a BRS by reaction rules.
 
Enum-like class that holds all kind of simulations.
 
 
The algorithm implemented here is a variant of the BreadthFirstSimulationStrategy without cycle checking.
BreadthFirstStrategy<B extends Bigraph<? extends Signature<?>>>
The algorithm implemented here to synthesize the "reaction graph" is adopted from [1].
 
 
Default executor provider for the model checking task submission.
 
 
 
MatchIterable<T extends BigraphMatch<? extends Bigraph<?>>>
Custom iterable implementation for matches of type BigraphMatch.
 
This class represents the available options for the model checker BigraphModelChecker.
This class represents export-specific options regarding the generated artifacts when synthesizing the transition system.
 
 
 
Class that represents simulation-specific options.
Default values:
allow reducible classes: false
ModelCheckingStrategy<B extends Bigraph<? extends Signature<?>>>
Strategy pattern for implementing new model checking algorithms.
Base class for supporting model checking strategy implementations.
OrPredicate<B extends Bigraph<? extends Signature<?>>>
A composite predicate which concatenates all given predicates with the or operator.
 
PredicateChecker<B extends Bigraph<? extends Signature<?>>>
The task of the class is to evaluate a given set of predicates of class ReactiveSystemPredicate.
 
 
A matcher for PureBigraphs.
Matching algorithm for pure bigraphs (see PureBigraph).
An implementation of a BigraphModelChecker for model checking of BRS with pure bigraphs (see PureBigraph).
This class represents the result of a valid match.
 
The concrete strategy to compute the canonical string of a pure bigraph (PureBigraph).
 
Iterator implementation for bigraph matching.
An implementation of an AbstractSimpleReactiveSystem providing a simple BRS data structure for pure bigraphs (see PureBigraph) and possibly later also binding bigraphs, bigraphs with sharing etc.
 
 
ReactionRuleSupplier<B extends Bigraph<? extends Signature<?>>>
 
Simple predicate implementation that returns true if one bigraph is contained in another (subbigraph matching problem).