Search Results for "graphs"

A real time inference engine for temporal logical specifications, which is able to acquire, process and generate any binary or real signal through POSIX IPC, files or UNIX sockets. Specifications of signals and dynamic systems are represented as special graphs and executed in real time, with a predictable sampling time of few milliseconds. Real time signal processing, dynamic system control, state machine modeling and logical property verification are some fields of application of this software. The accepted language provides timed logic and mathematical operators, conditional operators, interval operators, bounded quantifiers and parametrization of signals.

...Originally meant only to display module dependencies of NetBeans Rich Client Platform applications, thanks to the platform itself, it can display dependencies of "plain" and Maven-based Java projects. To display the dependencies, a new action is made available in the 'Source' menu and in the toolbar. The generated graphs can be saved as images or exported in PlantUML or Gephi formats.

A tool to generate state machine graphs based on specially formatted comments in C and C++ code. The generated output is a Graphviz dot input file.

PHPCallGraph generates static call graphs for PHP source code using the CodeAnalyzer of the InstantSVC project and the DOT tool. The graphs can be leveraged to gain a better understanding of large software systems or even to debunk design flaws in them.

Plugin for the CASE tool Fujaba. It enables the use of Velocity templates in activity graphs. Primary usage: Code generation in model transformations in association with the plugin SPin.

Java objects that share parts of immutable graphs. Reused subgraphs have directly or indirectly recursive Elements. Selected components get replaced by new counterparts in Context of Mirrors - translation tables. Deep copies are not involved.

A minimalistic CASE tool that will allow end-users to analyze their graphs (plain-old graphs, UML diagrams, ERDs, etc.) by applying various graph theory functions to them (such as a shortest path algorithm or a spanning tree algorithm.)