SecSy is a tool for security-oriented log synthesis. Besides basic synthesis properties (cases per day, office hours, randomized activity duration, ...), its detailed parameter setting for simulating business processes also allows to specify data usage (objects and access modality), actors for process activities and access control constraints for task/object permissions. It is also capable of enforcing/violating specific security properties on process traces, such as SoD/BoD, Unauthorized Access, Corrupted log entries, Skipped Activities.

• Log synthesis (MXML format)
• PNML Import
• Security Features
• Multiple simulation runs per log file

SEPIA stands for ”Security-oriented Petri Net Framework” and provides implementations for various types of Petri nets. Along Place/Transition-Nets, it supports Petri nets with distinguishable token colors. To support information flow analysis of processes, SEPIA defines so-called IF-Nets, tailored for security-oriented workflow modelling, which enable users to assign security-levels (high, low) to transitions, data elements and persons/agents participating in the process execution.

• Implementation of P/T nets
• Implementation of Colored Petri nets
• Implementation of Colored Workflow nets
• Implementation of IF-Nets
• Petri net traversal
• Petri net refinement
• Reachability utils
• PNML Parsing

SEWOL provides support for the handling of workflow traces. It allows to specify the shape and content of process traces in terms of entries representing the execution of a specific workflow activity. Currently it supports plain text, Petrify, MXML and XES log file types.
In order to specify security-related context information, SEWOL provides access control models such as access control lists (ACL) and role-based access control models (RBAC).

• Workflow Log Support (log traces and entries)
• Export of log files to disk
• MXML, XES and Petrify log format support

The Java Graph Library (JAGAL) is a Java library for modelling directed graphs. It comes with implementations of various types of graphs and transition systems, as well as utilities for their modification and traversal.

• Implementation of directed graphs
• Implementation of directed weighted graphs
• Graph algorithms (Tarjan for SCCs)
• Graph visualization (Circle layout)
• Graph traversal (depth first, breadth first)
• Traversal utils (Predecessors, Siblings, Cycles, ...)
• Implementation of Transition Systems
• Implementation of Labelled Transition Systems

TOVAL comprises a set of java classes for common programming issues. It includes utils for arrays, lists, sets and collections for convenient handling and modification, but also support for mathematic definitions concerning logic (clauses and resolution) together with some algorithms for permutations, powersets and resolution. Additionally it contains a number of types for multisets, matrices with object keys and much more.

• Constraint Specification (numerical and string)
• Debugging features (rudimentary)
• File Handling
• Graphical Utils
• Graphical Statistical Diagrams
• Mathematical Utils (permutations, truth tables, binomial coeff., logic, ...)
• Time Utils (intervals, time scale and conversion)
• Parameter validation
• Random value generation
• Utils for collections, arrays, lists, sets, strings