Advertisement

Improving the linearly based characterization of P/T nets

  • J. M. Colom
  • M. Silva
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 483)

Abstract

The state equation is a linear description of the reachable markings and firing count vectors of a P/T net. It has the disadvantage that its solution space, in general, includes additional integer unreachable or/and unfirable vectors. As a result, the analysis of properties using this linear characterization, usually leads to necessary or sufficient conditions for satisfying it, but not both. The appearance of these spurious solutions is due to the fact that the state equation does not take into account the order in which transitions fire.

The existence of methods which a priori eliminate spurious solutions of the direct state equation would bring structural verification methods closer to behavioural methods. Two elimination methods are presented here. Both are based on adding to the state equation linear restrictions which (partially) check the transition firing rule.

The first consists of checking that every marking which is a solution of the state equation has a sequence of predecessor markings, and that the transition firing rule holds in that sequence. The second is based on the addition of implicit places to the net [SILV 85] which are linearly non-redundant in the state equation. Some of these places are associated to initially marked traps, and the elimination of unreachable markings they perform is based on a well-known fact: initially marked traps remain always marked. The reasoning on structural deadlocks leads to the complementary fact: initially unmarked deadlocks remains always unmarked. In this case the linear restrictions are based on the annullation of marking variables belonging to places in the deadlock. Last but not least, another important point is the characterization by means of one single Linear Programming Problem (LPP) of those implicit places which are structurally implicit. The interesting fact here is that the theoretical complexity to solve a LPP is polynomial and the practical complexity is linear [SAKA 84].

Keywords

Linear descriptions of P/T nets Structural analysis of P/T nets Linear state equation Spurious solutions Implicit place Structurally implicit place Cutting implicit place Deadlocks and Traps Linear Programming 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [BERT 87]
    BERTHELOT G.: Transformations and Decompositions of Nets. Petri Nets: Central Models and their Properties. Advances in Petri Nets 1986, Proceedings of an Advanced Course, Bad Honnef, September 1986. LNCS 254, Springer Verlag, Berlin, pp.359–376.Google Scholar
  2. [BEST 85]
    BEST E., FERNANDEZ C.: Notations and Terminology on Petri Net Theory. Newsletter 20, May 1985, pp. 1–15.Google Scholar
  3. [COLO 89]
    COLOM J.M.: Análisis estructural de Redes de Petri, Programación Lineal y Geometría Convexa. Ph. D. Thesis, Depto. Ingeniería Eléctrica e Informática, Universidad de Zaragoza, June.Google Scholar
  4. [ESPA 89]
    ESPARZA J., SILVA M.: A Polynomial-time Algorithm to Decide Liveness of Bounded Free Choice Nets, Internal Report, Dept. de Ingeniería Eléctrica e Informática, Universidad de Zaragoza.Google Scholar
  5. [HACK 72]
    HACK M.H.T.: Analysis of Production Schemata by Petri Nets. M.S. thesis, TR-94, Project MAC, MIT, Cambridge, Mass.Google Scholar
  6. [JOHN 87]
    JOHNEN C.: SUJET: Analyse Algorithmique des Reseaux de Petri: Verification d'Espace d'Accueil, Systemes de Reecriture. These Doctoral, Université de Paris-Sud, Decembre 1987.Google Scholar
  7. [LUEN 72]
    LUENBERGER D.G.: Introduction to Linear and Non Linear Programming. Addison-Wesley Publishing Company, Reading, Massachssets.Google Scholar
  8. [MART 84]
    MARTINEZ J.: Contribución al Análisis y Modelado de Sistemas Concurrentes mediante Redes de Petri. Tesis Doctoral. Universidad de Zaragoza, Octubre 1984.Google Scholar
  9. [SAKA 84]
    SAKAROVITCH M.: Optimisation Combinatoire. Méthodes Mathématiques et Algorithmiques. Hermann, Paris.Google Scholar
  10. [SILV 80]
    SILVA M.: Simplification des Reseaux de Petri par Elimination des Places Implicites. Digital Processes 6, pp. 245–256.Google Scholar
  11. [SILV 85]
    SILVA M.: Las Redes de Petri en la Automática y la Informática. Editorial AC, Madrid.Google Scholar
  12. [SILV 87]
    SILVA M., COLOM J.M.: On the Computation of Structural Synchronic Invariants in P/T nets, Procs. of the Eighth European Workshop on Application and Theory of Petri Nets, Zaragoza, June 1987, pp. 237–258. Also in Advances in Petri Nets 88, LNCS 340, Springer Verlag, 1989, pp. 387–417.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • J. M. Colom
    • 1
  • M. Silva
    • 1
  1. 1.Dpto. Ingeniería Eléctrica e InformáticaUniversidad de ZaragozaZARAGOZASpain

Personalised recommendations