Skip to main content
SpringerLink
Log in

HMSCs as Partial Specifications...with PNs as Completions

  • Chapter
  • First Online:
Modeling and Verification of Parallel Processes (MOVEP 2000)

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

Included in the following conference series:

Abstract

The paper presents ongoing work aiming at understanding the nature of specifications given by High Level Message Sequence Charts and the ways in which they can be put into effective use. Contrarily to some authors, we do not set finite state restrictions on HMSCs as we feel such restrictions do not fit in with the type of distributed systems encountered today in the field of telecommunications. The talk presents first a series of undecidability results about general HMSCs following from corresponding undecidability results on rational sets in product monoids. These negative results which with one exception do not appear yet in the literature on HMSCs do indicate that the sole way in which general HMSCs may be usefully handed as behavioural specifications is to interpret their linear extensions as minimal languages, to be approximated from above in any realization. The problem is then to investigate frameworks in which these incomplete specifications may be given a meaning by a closure operation. The second part of the paper presents a closure operation relative to Petri net languages. This closure operation is an effective procedure that relies on semilinear properties of HMSCs languages. We finally present some decidability results for the distribution and verification of HMSCs transformed into Petri nets.

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 52.95
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. Alur, R., Yannakakis, M.: Model Checking of Message Sequence Charts. Proc. Concur, LNCS 1664 (1999) 114–129

    Google Scholar 

  2. Badouel, E., Caillaud, B., Darondeau, Ph.: Distributing Finite Automata through Petri Net Synthesis. (draft available from the authors)

    Google Scholar 

  3. Berstel, J.: Transductions and Context-Free Languages. Teubner Studienbücher, Stuttgart (1979)

    Google Scholar 

  4. Caillaud, B.: Bounded Petri Net Synthesis Techniques and their Applications to the Distribution of Reactive Automata. JESA 9-10 no.33 (1999) 925–942

    Google Scholar 

  5. Damm, W., Harel, D.: LCSs: Breathing Life into Message Sequence Charts. Report CS98/09, Weizmann Institute of Technology (1998)

    Google Scholar 

  6. Darondeau, Ph.: Deriving Unbounded Petri Nets from Formal Languages. Proc. Concur, LNCS 1466 (1998) 533–548

    Google Scholar 

  7. Darondeau, Ph.: Region Based Synthesis of P/T-Nets and its Potential Applications. Proc. ICATPN, LNCS 1825 (2000) 16–23

    Google Scholar 

  8. Diekert, V., Métivier, Y.: Partial Commutation and Traces. Research report 1996/02, Universität Stuttgart Fakultät Informatik (1996)

    Google Scholar 

  9. Diekert, V., Rozenberg, G. (editors): The Book of Traces. World Scientific, Singapore (1995)

    Google Scholar 

  10. Eilenberg, S., Schützenberger, M.: Rational Sets in Commutative Monoids. Journal of Algebra 13 (1969) 173–191

    Article  MATH  MathSciNet  Google Scholar 

  11. Esparza, J.: On the Decidability of Model-checking for several mu-calculi and Petri Nets. Proc. Caap, LNCS 787 (1994) 115–129

    Google Scholar 

  12. Fischer, P.C., Rosenberg, A.L.: Multitape One-Way Nonwriting Automata. JCSS 2 (1968) 88–101

    Google Scholar 

  13. Harel, D., Kugler, H.: Synthesizing State-Based Object Systems from LSC Specifications. Report MCS99/20, Weizmann Institute of Technology (1999)

    Google Scholar 

  14. Henriksen, J.G., Mukund, M., Narayan Kumar, K., Thiagarajan, P.S.: On Message Sequence Graphs and Finitely Generated Regular MSC Languages. Proc. Icalp, LNCS 1853 (2000) 675–686

    Google Scholar 

  15. Henriksen, J.G., Mukund, M., Narayan Kumar, K., Thiagarajan, P.S.: Regular Collections of Message Sequence Charts. Proc. MFCS, LNCS 1893 (2000) 405–414

    Google Scholar 

  16. TU-TS Recommendation Z.120: Message Sequence Chart 1996 (MSC96). Technical Report, ITU-TS, Geneva (1996)

    Google Scholar 

  17. Jancar, P., Moeller, F.: Checking Regular Properties of Petri Nets, Proc. Concur, LNCS 962 (1995) 348–362

    Google Scholar 

  18. Mauw, S., Reniers, M.A., High-Level Message Sequence Charts. Proc. Eighth SDL Forum, Elsevier Science Publishers B.V. (1997) 291–306

    Google Scholar 

  19. Mayr, E.: An Algorithm for the General Petri Net Reachability Problem. SIAM Journal on Computing 13 (1984) 441–460

    Article  MATH  MathSciNet  Google Scholar 

  20. Mukund, M., Narayan Kumar, K., Sohoni, M.: Synthesizing distributed finite-state systems from MSCs. Proc. Concur, LNCS 1877 (2000) 521–535

    Google Scholar 

  21. Muscholl, A., Peled, D., Su, Z.: Deciding Properties for Message Sequence Charts. Proc. Fossacs, LNCS 1378 (1998) 226–242

    Google Scholar 

  22. Pelz, E.: Closure Properties of Deterministic Petri Nets. Proc. Stacs, LNCS 247 (1987) 373–382

    Google Scholar 

  23. Peterson, J.L.: Computation Sequence Sets. JCSS 13 (1976) 1–24

    MATH  Google Scholar 

  24. van Glabbeek, R.J., Weijland, W.P.: Branching Time and Abstraction in Bisimulation Semantics. Proc. IFIP Congress, North Holland / IFIP (1989) 613–618

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IRISA, campus de Beaulieu, F35042, Rennes Cedex, France

    Benoit Caillaud, Philippe Darondeau, Loïc Hélouët & Gilles Lesventes

Authors
  1. Benoit Caillaud
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Philippe Darondeau
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Loïc Hélouët
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Gilles Lesventes
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. IRCCyN, CNRS, 1 rue de la Noe, 44321, Nantes Cedex 3, France

    Franck Cassez

  2. IRISA, CNRS, Campus de Beaulieu, 35042, Rennes, France

    Claude Jard

  3. Laboratoire de Recherche en Informatique, Université de Paris XI, Bâtiment 490, 91405, Orsay Cedex, France

    Brigitte Rozoy

  4. School of Computer Science, University of Birmingham, Edgbaston, Birmingham, B15 2TT, UK

    Mark Dermot Ryan

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Caillaud, B., Darondeau, P., Hélouët, L., Lesventes, G. (2001). HMSCs as Partial Specifications...with PNs as Completions. In: Cassez, F., Jard, C., Rozoy, B., Ryan, M.D. (eds) Modeling and Verification of Parallel Processes. MOVEP 2000. Lecture Notes in Computer Science, vol 2067. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45510-8_5

Download citation

  • DOI: https://doi.org/10.1007/3-540-45510-8_5

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42787-2

  • Online ISBN: 978-3-540-45510-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation