Loading...
Loading...

Go to the content (press return)

Amending C-net discovery algorithms

Author
Sole, M.; Carmona, J.
Type of activity
Presentation of work at congresses
Name of edition
28th ACM Symposium On Applied Computing
Date of publication
2013
Presentation's date
2013-03
Book of congress proceedings
SAC '13: Proceedings of the 28th Annual ACM Symposium on Applied Computing Universidad ORT Uruguay – Campus Centro Montevideo, Uruguay
First page
1418
Last page
1425
DOI
https://doi.org/10.1145/2480362.2480628 Open in new window
Project funding
Minería de procesos: descubriendo métodos formales para el diseño de sistemas concurrentes
Abstract
As the complexity of information systems evolves, there is a growing interest in defining suitable process models than can overcome the limitations of traditional formalisms like Petri nets or related. Causal nets may be one of such process models, since their declarative semantics and simple graph structure deviates from existing formalisms. Due to their novelty, few discovery algorithms exist for Causal nets. Moreover, the existing ones offer poor guarantees regarding the produced outcome. We ...
Keywords
Algorithms, Petri nets, Semantics
Group of research
ALBCOM - Algorithms, Computational Biology, Complexity and Formal Methods

Participants