Linear Time Analysis of Properties of Conflict-Free and General Petri nets
Year of publication: |
2010
|
---|---|
Authors: | Alimonti, Paola ; Feuerstein, Esteban ; Laura, Luigi ; Nanni, Umberto |
Institutions: | Dipartimento di Ingegneria Informatica, Automatica e Gestionale "Antonio Ruberti", Facoltà di Ingegneria dell'Informazione Informatica e Statistica |
Subject: | Petri nets | conflict-free Petri nets | Marked Graphs | coverability | liveness | bound-edness | directed hypergraphs | incremental algorithms |
Extent: | application/pdf |
---|---|
Series: | DIS Technical Reports. - ISSN 2035-5750. |
Type of publication: | Book / Working Paper |
Notes: | Number 2010-09 |
Source: |
-
An incremental least squares algorithm for large scale linear classification
Cassioli, A., (2013)
-
On solving the Lagrangian dual of integer programs via an incremental approach
Gaudioso, Manlio, (2009)
-
Finding hypernetworks in directed hypergraphs
Pretolani, Daniele, (2013)
- More ...
-
Classification and Traversal Algorithmic Techniques for Optimization Problems on Directed Hyperpaths
Ausiello, Giorgio, (2010)
-
Minimizing worst-case and average-case makespan over scenarios
Feuerstein, Esteban, (2017)
-
De Marco, Marco, (2021)
- More ...