Skip to main content
SpringerLink
Log in

Modelling with Partial Orders — Why and Why Not?

Extended Abstract

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2076))

Included in the following conference series:

  • 1343 Accesses

Abstract

Labelled partial orders in concurrency are a natural and powerful modelling formalism. Recently, there has been a renewed focus on such models arising in various areas of applications. We survey some results on interesting problems for partial order based models, focussing on decidability issues.

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 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. ACM Strategic Directions in Computing Research, Concurrency Group Report, http://www.acm.org/surveys/sdcr, 1997.

  2. R. Alur, D. Peled. Undecidability of Partial Order Logics. Information Processing Letters 69, 137–143, 1999.

    Article  MathSciNet  Google Scholar 

  3. R. Alur, M. Yannakakis. Model checking of message sequence charts. In Proceedings of CONCUR’99, Lecture Notes in Computer Science 1664, Springer-Verlag, 114–129, 1999.

    Google Scholar 

  4. I. Cervesato, N. A. Durgin, P. D. Lincoln, J. C. Mitchell, and A. Scedrov. A meta-notation for protocol analysis. In proceedings of 12-th IEEE Computer Security Foundations Workshop, 55–69, 1999.

    Google Scholar 

  5. F. J. T. Fabrega, J. C. Herzog, J. D. Guttman. Strand Spaces: Why is a security protocol correct? In Proceedings of 1998 IEEE Symposium on Security and Privacy, 160–171, 1998.

    Google Scholar 

  6. F. Crazzolara, G. Winskel. Events in security protocols. BRICS Report Series RS-01-13, University of Aarhus, Denmark, 2001.

    Google Scholar 

  7. J. G. Henriksen, M. Mukund, K. Narayan Kumar, and P. S. Thiagarajan. On Message Sequence Graphs and finitely generated regular MSC languages. In Proceedings of ICALP’00, Lecture Notes in Computer Science 1853, Springer-Verlag, 675–686, 2000.

    Google Scholar 

  8. M. Jurdcinski, M. Nielsen. Hereditary history preserving bisimulation is undecidable. In Proceedings of STACS’00, Lecture Notes in Computer Science 1770, Springer-Verlag, 358–369, 2000.

    Google Scholar 

  9. T. Meincke, A. Hemani, S. Kumar, P. Ellervee, J. Berg, D. Lindqvist, H. Tenhunen, A. Postula. Evaluating benefits of globally asynchronous locally synchronous VLSI architecture. In Proc. 16th Norchip, 50–57, 1998.

    Google Scholar 

  10. ITU-TS Recommendation Z.120: Message Sequence Chart (MSC). ITU-TS, Geneva, 1997.

    Google Scholar 

  11. M. Nielsen, V. Sassone, J. Srba. Towards a notion of distributed time in Petri nets. To appear in Proceedings of International Conference on Application and Theory of Petri Nets 2001, Lecture Notes in Computer Science, Springer-Verlag, 2001.

    Google Scholar 

  12. V. R. Pratt. Modelling concurrency with partial orders. International Journal of Parallel programming, 15(1), 33–71, 1986

    Article  MATH  MathSciNet  Google Scholar 

  13. G. Winskel, M. Nielsen Models for Concurrency In Handbook of Logic in Computer Science, vol 4, eds. S. Abramsky, D. M. Gabbay, T. S. E. Maibaum, Oxford University Press, 1–148, 1995.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. BRICS, Dept. of Computer Science, University of Aarhus, Denmark

    Mogens Nielsen

Authors
  1. Mogens Nielsen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Departament de Llenguatges i Sistemes Informátics, Univ. Politècnica de Catalunya, C/Jordi Girona Salgado 1-3, 08034, Barcelona, Spain

    Fernando Orejas

  2. Computer Technology Institute (CTI), University of Patras, 61 Riga Feraiou street, 26221, Patras, Greece

    Paul G. Spirakis

  3. Institute of Information and Computing Sciences, Utrecht University, Padualaan 14, 3584, CH, Utrecht, The Netherlands

    Jan van Leeuwen

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Nielsen, M. (2001). Modelling with Partial Orders — Why and Why Not?. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds) Automata, Languages and Programming. ICALP 2001. Lecture Notes in Computer Science, vol 2076. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48224-5_5

Download citation

  • DOI: https://doi.org/10.1007/3-540-48224-5_5

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42287-7

  • Online ISBN: 978-3-540-48224-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation