Skip to main content
SpringerLink
Log in

Concurrency-Preserving Minimal Process Representation

  • Conference paper
  • First Online:
Relational and Algebraic Methods in Computer Science (RAMICS 2017)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10226))

  • 359 Accesses

Abstract

We propose a method for reducing a partially ordered set, in such a way that the lattice derived from a closure operator based on concurrency is changed as little as possible. In fact, we characterize in which cases it remains unchanged, and prove minimality of the resulting reduced poset. In these cases, we can complete this poset so as to obtain a causal net on which the closure operator will lead to the same lattice.

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

Access this chapter

Log in via an institution
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 EPUB and 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

References

  1. Bernardinello, L., Ferigato, C., Haar, S., Pomello, L.: Closed sets in occurrence nets with conflicts. Fund. Inform. 133(4), 323–344 (2014)

    MathSciNet  MATH  Google Scholar 

  2. Bernardinello, L., Pomello, L., Rombolà, S.: Closure operators and lattices derived from concurrency in posets and occurrence nets. Fund. Inform. 105, 211–235 (2010)

    MathSciNet  MATH  Google Scholar 

  3. Bernardinello, L., Pomello, L., Rombolà, S.: Orthomodular algebraic lattices related to combinatorial posets. In: Proceedings of the 15th Italian Conference on Theoretical Computer Science, Perugia, Italy, 17–19 September 2014, pp. 241–245 (2014)

    Google Scholar 

  4. Best, E., Fernandez, C.: Nonsequential Processes-A Petri Net View. Monographs in Theoretical Computer Science. An EATCS Series, vol. 13. Springer, Heidelberg (1988)

    Book  MATH  Google Scholar 

  5. Birkhoff, G.: Lattice Theory, 3rd edn. American Mathematical Society, Providence (1979)

    MATH  Google Scholar 

  6. Davey, B.A., Priestley, H.A.: Introduction to Lattices and Order. Cambridge University Press, Cambridge (1990)

    MATH  Google Scholar 

  7. Dushnik, B., Miller, E.W.: Partially ordered sets. Am. J. Math. 63(3), 600–610 (1941)

    Article  MathSciNet  MATH  Google Scholar 

  8. Kalmbach, G.: Orthomodular Lattices. Academic Press, New York (1983)

    MATH  Google Scholar 

  9. Mazurkiewicz, A.: Trace theory. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) ACPN 1986. LNCS, vol. 255, pp. 278–324. Springer, Heidelberg (1987). doi:10.1007/3-540-17906-2_30

    Chapter  Google Scholar 

  10. Möhring, R.H.: Algorithmic aspects of comparability graphs, interval graphs. In: Rival, I. (ed.) Graphs, Order: The Role of Graphs in the Theory of Ordered Sets and Its Applications, pp. 41–101. Springer Netherlands, Dordrecht (1985)

    Chapter  Google Scholar 

  11. Nielsen, M., Plotkin, G.D., Winskel, G.: Petri nets, event structures and domains, part I. Theor. Comput. Sci. 13, 85–108 (1981)

    Article  MATH  Google Scholar 

  12. Petri, C.A., Smith, E.: Concurrency and continuity. In: Rozenberg, G. (ed.) APN 1986. LNCS, vol. 266, pp. 273–292. Springer, Heidelberg (1987). doi:10.1007/3-540-18086-9_30

    Chapter  Google Scholar 

  13. Smith, E.: Carl Adam Petri: Life and Science. Springer, Heidelberg (2015)

    Book  MATH  Google Scholar 

  14. Winskel, G.: Event structures. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) ACPN 1986. LNCS, vol. 255, pp. 325–392. Springer, Heidelberg (1987). doi:10.1007/3-540-17906-2_31

    Chapter  Google Scholar 

Download references

Acknowledgments

Work partially supported by MIUR.

Author information

Authors and Affiliations

  1. Dipartimento di Informatica Sistemistica e Comunicazione, Università degli Studi di Milano-Bicocca, Milan, Italy

    Adrián Puerto

Authors
  1. Adrián Puerto
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Adrián Puerto .

Editor information

Editors and Affiliations

  1. Data61, CSIRO, Sydney, New South Wales, Australia

    Peter Höfner

  2. CNRS, Lyon, France

    Damien Pous

  3. University of Sheffield, Sheffield, United Kingdom

    Georg Struth

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Puerto, A. (2017). Concurrency-Preserving Minimal Process Representation. In: Höfner, P., Pous, D., Struth, G. (eds) Relational and Algebraic Methods in Computer Science. RAMICS 2017. Lecture Notes in Computer Science(), vol 10226. Springer, Cham. https://doi.org/10.1007/978-3-319-57418-9_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-57418-9_15

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-57417-2

  • Online ISBN: 978-3-319-57418-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation