Skip to main content
SpringerLink
Log in

The Synthesis Problem of Netcharts

  • Conference paper
Petri Nets and Other Models of Concurrency - ICATPN 2006 (ICATPN 2006)

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

Included in the following conference series:

Abstract

A netchart is basically a Petri net whose places are located at some process and whose transitions are labeled by message sequence charts (MSCs). Two recent papers showed independently that any globally-cooperative high-level MSC corresponds to the behaviors of some communicating finite-state machine — or equivalently a netchart. These difficult results rely either on Thomas’ graph acceptors or Zielonka’s construction of asynchronous automata. In this paper we give a direct and self-contained synthesis of netcharts from globally-cooperative high-level MSCs by means of a simpler unfolding procedure.

Supported by the ANR project SOAPDC.

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

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. In: Baeten, J.C.M., Mauw, S. (eds.) CONCUR 1999. LNCS, vol. 1664, pp. 114–129. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  2. Baudru, N., Morin, R.: Safe Implementability of Regular Message Sequence Charts Specifications. In: Proc. of the ACIS 4th Int. Conf. SNDP, pp. 210–217 (2003)

    Google Scholar 

  3. Baudru, N., Morin, R.: The Pros and Cons of Netcharts. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol. 3170, pp. 99–114. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  4. Baudru, N., Morin, R.: Unfolding Synthesis of Asynchronous Automata. In: Grigoriev, D., Harrison, J., Hirsch, E.A. (eds.) CSR 2006. LNCS, vol. 3967, pp. 46–57. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  5. Bollig, B., Leucker, M.: Message-Passing Automata are expressively equivalent to EMSO Logic. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol. 3170, pp. 146–160. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  6. Caillaud, B., Darondeau, P., Hëlouët, L., Lesventes, G.: HMSCs as partial specifications.. with pNs as completions. In: Cassez, F., Jard, C., Rozoy, B., Dermot, M. (eds.) MOVEP 2000. LNCS, vol. 2067, p. 125. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

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

    Book  Google Scholar 

  8. Genest, B., Muscholl, A., Seidl, H., Zeitoun, M.: Infinite-Node High-Level MSCs: Model-Checking and Realizability. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 657–668. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  9. Genest, B., Muscholl, A., Kuske, D.: A Kleene Theorem for a Class of Communicating Automata with Effective Algorithms. In: Calude, C.S., Calude, E., Dinneen, M.J. (eds.) DLT 2004. LNCS, vol. 3340, pp. 30–48. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  10. Henriksen, J.G., Mukund, M., Narayan Kumar, K., Sohoni, M., Thiagarajan, P.S.: A theory of regular MSC languages. Information and computation 202, 1–38 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  11. Holzmann, G.J.: Early Fault Detection. In: Margaria, T., Steffen, B. (eds.) TACAS 1996. LNCS, vol. 1055, pp. 1–13. Springer, Heidelberg (1996)

    Google Scholar 

  12. ITU-TS Recommendation Z.120: Message Sequence Charts Geneva (1996)

    Google Scholar 

  13. Lamport, L.: Time, Clocks and the Ordering of Events in a Distributed System. Communications of the ACM 21(7), 558–565 (1978)

    Article  MATH  Google Scholar 

  14. Métivier, Y.: On Recognizable Subsets of Free Partially Commutative Monoids. Theor. Comput. Sci. 58, 201–208 (1988)

    Article  MATH  Google Scholar 

  15. Morin, R.: On Regular Message Sequence Chart Languages and Relationships to Mazurkiewicz Trace Theory. In: Honsell, F., Miculan, M. (eds.) FOSSACS 2001. LNCS, vol. 2030, pp. 332–346. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  16. Morin, R.: Recognizable Sets of Message Sequence Charts. In: Alt, H., Ferreira, A. (eds.) STACS 2002. LNCS, vol. 2285, pp. 523–534. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  17. Mukund, M., Narayan Kumar, K., Thiagarajan, P.S.: Netcharts: Bridging the Gap between HMSCs and Executable Specifications. In: Amadio, R., Lugiez, D. (eds.) CONCUR 2003. LNCS, vol. 2761, pp. 296–310. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  18. Muscholl, A., Peled, D.: Message sequence graphs and decision problems on Mazurkiewicz traces. In: Kutyłowski, M., Wierzbicki, T., Pacholski, L. (eds.) MFCS 1999. LNCS, vol. 1672, pp. 81–91. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  19. Ochmański, E.: Regular behaviour of concurrent systems. Bulletin of the EATCS 27, 56–67 (1985)

    Google Scholar 

  20. Pratt, V.: Modelling concurrency with partial orders. International Journal of Parallel Programming 15, 33–71 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  21. Thomas, W.: On Logics, Tilings, and Automata. In: Leach Albert, J., Monien, B., Rodríguez-Artalejo, M. (eds.) ICALP 1991. LNCS, vol. 510, pp. 441–454. Springer, Heidelberg (1991)

    Google Scholar 

  22. Zielonka, W.: Notes on finite asynchronous automata. RAIRO, Theoretical Informatics and Applications 21, 99–135 (1987)

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire d’Informatique Fondamentale de Marseille, Université de Provence, 39 rue Joliot-Curie, F-13453 cedex 13, Marseille, France

    Nicolas Baudru & Rémi Morin

Authors
  1. Nicolas Baudru
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rémi Morin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dipartimento di Informatica, Università di Torino, 10149, Torino, Italy

    Susanna Donatelli

  2. School of Computing, National University of Singapore,  

    P. S. Thiagarajan

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Baudru, N., Morin, R. (2006). The Synthesis Problem of Netcharts. In: Donatelli, S., Thiagarajan, P.S. (eds) Petri Nets and Other Models of Concurrency - ICATPN 2006. ICATPN 2006. Lecture Notes in Computer Science, vol 4024. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11767589_6

Download citation

  • DOI: https://doi.org/10.1007/11767589_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-34699-9

  • Online ISBN: 978-3-540-34700-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation