Skip to main content

On Well-formedness Analysis: The Case of Deterministic Systems of Sequential Processes

  • Conference paper
Book cover Structures in Concurrency Theory

Part of the book series: Workshops in Computing ((WORKSHOPS COMP.))

Abstract

New results on structural analysis of well-formedness, that is, structural boundedness and structural liveness, of Place/Transition net systems, based on the rank of the incidence matrix, are introduced and related to previously known ones.

These results are a general sufficient condition, that follows from the Rank Theorem for Equal Conflict systems, and a polynomial-time characterisation of well-formedness for an enlarged version of the structured class of Deterministic Systems of Sequential Processes.

This work has been partially supported by the projects CICYT TIC-94-0242 BRA Project 7269 (QMIPS), and Esprit W.G. 6067 (CALIBAN).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. E. Teruel and M. Silva. Well-formedness of Equal Conflict systems. In R. Valette, editor, Application and Theory of Petri Nets 1994, volume 815 of Lecture Notes in Computer Science, pages 491–510. Springer Verlag, 1994.

    Google Scholar 

  2. J. Desel. Regular marked Petri nets. In J. Leeuwen, editor, WG’ 93: 19th Int. Workshop on Graph-Theoretic Concepts in Computer Science, volume 790 of Lecture Notes in Computer Science, pages 264–275. Springer Verlag, 1993.

    Google Scholar 

  3. W. Reisig. Deterministic buffer synchronization of sequential processes. Acta Informatica, 18: 117–134, 1982.

    Article  MATH  MathSciNet  Google Scholar 

  4. G. Berthelot, G. Memmi, and W. Reisig. A control structure for sequential processes synchronized by buffers. In Proc. 4th European Workshop on Application and Theory of Petri Nets, pages 43–58, 1983.

    Google Scholar 

  5. Y. Souissi and N. Beldiceanu. Deterministic systems of sequential processes: Theory and tools. In Concurrency 88, volume 335 of Lecture Notes in Computer Science, pages 380–400. Springer Verlag, 1988.

    Google Scholar 

  6. Y. Souissi. Deterministic systems of sequential processes: A class of structured Petri nets. In G. Rozenberg, editor, Advances in Petri Nets 1993, volume 674 of Lecture Notes in Computer Science, pages 406–426. Springer Verlag, 1993.

    Google Scholar 

  7. J. Campos, J. M. Colom, M. Silva, and E. Teruel. Functional and performance analysis of cooperating sequential processes. In O. J. Boxma and G. M. Koole, editors, Performance Evaluation of Parallel and Distributed Systems. Solution Methods, volume 106 of CWI Tracts, pages 233–251. CWI, 1994.

    Google Scholar 

  8. T. Murata. Petri nets: Properties, analysis and applications. Proceedings of the IEEE, 77 (4): 541–580, 1989.

    Article  Google Scholar 

  9. E. Teruel. Structure Theory of Weighted Place/Transition Net Systems: The Equal Conflict Hiatus. PhD thesis, DIEI. Univ. Zaragoza, June 1994.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1995 British Computer Society

About this paper

Cite this paper

Recalde, L., Teruel, E., Silva, M. (1995). On Well-formedness Analysis: The Case of Deterministic Systems of Sequential Processes. In: Desel, J. (eds) Structures in Concurrency Theory. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3078-9_19

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-3078-9_19

  • Publisher Name: Springer, London

  • Print ISBN: 978-3-540-19982-3

  • Online ISBN: 978-1-4471-3078-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics