A Simple Positive Flows Computation Algorithm for a Large Subclass of Colored Nets

Authors:
S. Evangelista;C. Pajault;J. F. Pradat-Peyre
Affiliations:
CEDRIC - CNAM Paris, 292, rue St Martin, 75003 Paris,;CEDRIC - CNAM Paris, 292, rue St Martin, 75003 Paris,;CEDRIC - CNAM Paris, 292, rue St Martin, 75003 Paris,
Venue:
FORTE '07 Proceedings of the 27th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Year:
2007

Citing 13
Cited 0

Computation of flows for unary-predicates/transitions-nets

Advances in Petri Nets 1984
Petri nets and algebraic specifications

Theoretical Computer Science
Convex geometry and semiflows in P/T nets: a comparative study of algorithms for computation of minimal P-semiflows

APN 90 Proceedings on Advances in Petri nets 1990
Calculation of Semi-Flows for Pr/T-Systems

PNPM '87 The Proceedings of the Second International Workshop on Petri Nets and Performance Models
Automatic Verification of Concurrent Ada Programs

Ada-Europe '99 Proceedings of the 1999 Ada-Europe International Conference on Reliable Software Technologies
A Class of Well Structured Petri Nets for Flexible Manufacturing Systems

ICATPN '98 Proceedings of the 19th International Conference on Application and Theory of Petri Nets
Checking properties of nets using transformation

Advances in Petri Nets 1985, covers the 6th European Workshop on Applications and Theory in Petri Nets-selected papers
Algebraic structure of flows of a regular coloured net

Advances in Petri Nets 1987, covers the 7th European Workshop on Applications and Theory of Petri Nets
Generative Families of Positive Invariants in Coloured Nets Sub-Classes

Papers from the 12th International Conference on Applications and Theory of Petri Nets: Advances in Petri Nets 1993
Implicit Places in Net Systems

PNPM '99 Proceedings of the The 8th International Workshop on Petri Nets and Performance Models
Distributed colored Petri net model-checking with CYCLADES

FMICS'06/PDMC'06 Proceedings of the 11th international workshop, FMICS 2006 and 5th international workshop, PDMC conference on Formal methods: Applications and technology
Dynamic tasks verification with QUASAR

Ada-Europe'05 Proceedings of the 10th Ada-Europe international conference on Reliable Software Technologies
PN standardisation: a survey

FORTE'06 Proceedings of the 26th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems

Quantified Score

Hi-index	0.01

Visualization

Abstract

Positive flows provide very useful informations that can be used to perform efficient analysis of a model. Although algorithms computing (a generative family of) positive flows in ordinary Petri nets are well known, computing a generative family of positive flows in colored net remains an open problem. We propose in this paper a pragmatic approach that allows us to define an algorithm that computes a generative family of particular but useful positive flows in a large subclass of colored nets: the simple well-formed nets.