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

Mostrar todas las versiones(3)

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
Autores principales: Alimonti, P., Feuerstein, E., Laura, L., Nanni, U.
Formato: Artículo publishedVersion
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:http://hdl.handle.net/20.500.12110/paper_03043975_v412_n4-5_p320_Alimonti
https://repositoriouba.sisbi.uba.ar/gsdl/cgi-bin/library.cgi?a=d&c=artiaex&d=paper_03043975_v412_n4-5_p320_Alimonti_oai
Aporte de:
Repositorio Digital de la Universidad de Buenos Aires (UBA) de Universidad de Buenos Aires

Ejemplares similares

Ejemplares similares