Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
APN
2010
Springer
11 years 9 months ago
Learning Workflow Petri Nets
Workflow mining is the task of automatically producing a workflow model from a set of event logs recording sequences of workflow events; each sequence corresponds to a use case or ...
Javier Esparza, Martin Leucker, Maximilian Schlund
APN
2010
Springer
11 years 11 months ago
Forward Analysis for Petri Nets with Name Creation
Pure names are identifiers with no relation between them, except equality and inequality. In previous works we have extended P/T nets with the capability of creating and managing p...
Fernando Rosa Velardo, David de Frutos-Escrig
APN
2010
Springer
12 years 3 months ago
GreatSPN Enhanced with Decision Diagram Data Structures
Decision diagrams (DDs) have made their way into Petri net (PN) tools either in the form of new tools (usually designed from scratch to use DDs) or as enhancements to existing tool...
Junaid Babar, Marco Beccuti, Susanna Donatelli, An...
APN
2010
Springer
12 years 3 months ago
AlPiNA: A Symbolic Model Checker
AlPiNA is a symbolic model checker for High Level Petri nets. It is comprised of two independent modules: a GUI plugin for Eclipse and an underlying model checking engine. AlPiNAā€...
Didier Buchs, Steve Hostettler, Alexis Marechal, M...
APN
2010
Springer
12 years 4 months ago
Wendy: A Tool to Synthesize Partners for Services
Service-oriented computing proposes services as building blocks which can be composed to complex systems. To reason about the correctness of a service, its communication protocol n...
Niels Lohmann, Daniela Weinberg
APN
2010
Springer
12 years 4 months ago
Factorization Properties of Symbolic Unfoldings of Colored Petri Nets
The unfolding technique is an eļ¬ƒcient tool to explore the runs of a Petri net in a true concurrency semantics, i.e. without constructing all the interleavings of concurrent actio...
Thomas Chatain, Eric Fabre
APN
2010
Springer
12 years 4 months ago
Separability in Persistent Petri Nets
We prove that plain, bounded, reversible and persistent Petri nets are weakly and strongly separable.
Eike Best, Philippe Darondeau
books