Linear time analysis of properties of conflict-free and general Petri nets

We introduce the notion of a T-path within Petri nets, and propose to adopt the model of directed hypergraphs in order to determine properties of nets; in particular, we study the relationships between T-paths and firable sequences of transitions. Let us consider a Petri net P=〈P,T,A,M0〉 and the set...

Descripción completa

Guardado en:
Detalles Bibliográficos
Publicado: 2011
Materias:
Boundedness
Conflict-free Petri nets
Coverability
Directed hypergraphs
Incremental algorithms
Liveness
Marked graphs
Petri nets
Conflict free
Incremental algorithm
Algorithms
Graph theory
Teaching
Problem solving
Acceso en línea:https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_03043975_v412_n4-5_p320_Alimonti
http://hdl.handle.net/20.500.12110/paper_03043975_v412_n4-5_p320_Alimonti
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

Ejemplares similares

Ejemplares similares