Skip to main content
SpringerLink
Log in

Shared-Memory Systems and Charts

  • Conference paper
Computer Science – Theory and Applications (CSR 2011)

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

Included in the following conference series:

  • 768 Accesses

Abstract

In this paper we extend several results from Mazurkiewicz trace theory to the framework of cut-bounded languages. First the expressive power of shared-memory systems in terms of recognized sets of labeled partial orders is characterized by means of the notion of cut-bound plus the condition to be regular, or equivalently MSO-definable. Next weakly unambiguous systems with deterministic rules are proved to be as expressive as any system, contrary to deterministic or strongly unambiguous systems considered previously. Finally we extend the rational description of regular trace languages by loop-connected specifications within a new algebraic framework called shared-memory charts. In that way we present also several generalizations of results from the theory of regular sets of message sequence charts.

This work is partly supported by project ECSPER (ANR-09-JCJC-0069).

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. Arnold, A.: Rational ω-languages are non-ambiguous. Theoretical Computer Science 26, 221–223 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  3. Arnold, A.: An extension of the notion of traces and asynchronous automata. RAIRO, Theoretical Informatics and Applications 25, 355–393 (1991)

    MathSciNet  MATH  Google Scholar 

  4. Ben-Abdallah, H., Leue, S.: Syntactic Detection of Process Divergence and Non-local Choice in Message Sequence Charts. In: Brinksma, E. (ed.) TACAS 1997. LNCS, vol. 1217, pp. 259–274. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  5. Bernstein, A.J.: Analysis of programs for parallel processing. IEEE Trans. Comp. EC-15(5), 757–762 (1966)

    Article  MATH  Google Scholar 

  6. Bracho, F., Droste, M., Kuske, D.: Representations of computations in concurrent automata by dependence orders. Theoretical Computer Science 174, 67–96 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  7. Büchi, J.R.: Weak second-order arithmetic and finite automata. Z. Math. Logik Grundlagen Math. 6, 66–92 (1960)

    Article  MathSciNet  MATH  Google Scholar 

  8. Carton, O., Michel, M.: Unambiguous Büchi automata. Theoretical Computer Science 297, 37–81 (2003)

    Article  MathSciNet  MATH  Google Scholar 

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

    Book  Google Scholar 

  10. Diekert, V., Métivier, Y.: Partial Commutation and Traces. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. 3, pp. 457–534 (1997)

    Google Scholar 

  11. Dilworth, R.P.: A decomposition theorem for partially ordered sets. Ann. of Math. 51(2), 161–166 (1950)

    Article  MathSciNet  MATH  Google Scholar 

  12. Droste, M., Gastin, P., Kuske, D.: Asynchronous cellular automata for pomsets. Theoretical Computer Science 247, 1–38 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  13. Droste, M., Kuske, D.: Automata with concurrency relations - a survey. In: Advances in Logic, Artificial Intelligence and Robotics, pp. 152–172. IOS Press, Amsterdam (2002)

    Google Scholar 

  14. Fanchon, J., Morin, R.: Regular Sets of Pomsets with Autoconcurrency. In: Brim, L., Jančar, P., Křetínský, M., Kučera, A. (eds.) CONCUR 2002. LNCS, vol. 2421, pp. 402–417. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  15. Genest, B., Muscholl, A., Seidl, H., Zeitoun, M.: Infinite-State High-Level MSCs: Model-Checking and Realizability. J. of Comp. and System Sciences 72, 617–647 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  16. 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  MathSciNet  MATH  Google Scholar 

  17. Kuske, D.: Asynchronous cellular automata and asynchronous automata for pomsets. In: Sangiorgi, D., de Simone, R. (eds.) CONCUR 1998. LNCS, vol. 1466, pp. 517–532. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  18. Métivier, Y.: On Recognizable Subsets of Free Partially Commutative Monoids. Theoretical Computer Science 58, 201–208 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  19. Morin, R.: Semantics of Deterministic Shared-Memory Systems. In: van Breugel, F., Chechik, M. (eds.) CONCUR 2008. LNCS, vol. 5201, pp. 36–51. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  20. Morin, R.: Unambiguous Shared-Memory Systems. International Journal of Foundations of Computer Science 21(4), 665–685 (2010)

    Article  MathSciNet  MATH  Google Scholar 

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

    Google Scholar 

  22. Thomas, W.: Languages, automata and logic. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. 3, pp. 389–455 (1997)

    Google Scholar 

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

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire d’Informatique Fondamentale de Marseille;, LIF; CNRS; UMR 6166, France

    Rémi Morin

  2. Aix-Marseille Université, 163, avenue de Luminy, F-13288, Marseille, France

    Rémi Morin

Authors
  1. Rémi Morin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Steklov Institute of Mathematics at St. Petersburg, 27 Fontanka, 191023, St.Petersburg, Russia

    Alexander Kulikov

  2. Department of Mathematical Logic and Theory of Algorithms, Moscow State University, Leninskie gory, 119991, Moscow, Russia

    Nikolay Vereshchagin

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Morin, R. (2011). Shared-Memory Systems and Charts. In: Kulikov, A., Vereshchagin, N. (eds) Computer Science – Theory and Applications. CSR 2011. Lecture Notes in Computer Science, vol 6651. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20712-9_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-20712-9_25

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-20711-2

  • Online ISBN: 978-3-642-20712-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation