Skip to main content
SpringerLink
Log in
Book cover

International Conference on Developments in Language Theory

DLT 2008: Developments in Language Theory pp 516–528Cite as

MSO Logic for Unambiguous Shared-Memory Systems

  • Conference paper

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

Abstract

Shared-memory systems appear as a generalization of asynchronous cellular automata. In this paper we relate the partial-order semantics of shared-memory systems to Mazurkiewicz trace languages by means of a new refinement construction. We show that a set of labeled partial orders is recognized by some unambiguous shared-memory system if and only if it is definable in monadic second-order logic and media-bounded.

Supported by the ANR project SOAPDC.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alur, R., Grosu, R.: Shared Variables Interaction Diagrams. In: 16th IEEE Int. Conf. on Automated Software Engineering, pp. 281–288. IEEE Computer Society, Los Alamitos (2001)

    Google Scholar 

  2. Arnold, A.: Rational ω-languages are non-ambiguous. TCS 26, 221–223 (1983)

    Article  MATH  Google Scholar 

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

    MATH  Google Scholar 

  4. 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 

  5. Bollig, B., Leucker, M.: Message-passing automata are expressively equivalent to EMSO logic. TCS 358, 150–172 (2006)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  7. Carton, O., Michel, M.: Unambiguous Büchi automata. TCS 297, 37–81 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  8. Cori, R., Métivier, Y., Zielonka, W.: Asynchronous mappings and asynchronous cellular automata. I&C 106, 159–202 (1993)

    MATH  Google Scholar 

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

    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. Droste, M., Gastin, P., Kuske, D.: Asynchronous cellular automata for pomsets. TCS 247, 1–38 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  12. Henriksen, J.G., Mukund, M., Narayan Kumar, K., Sohoni, M., Thiagarajan, P.S.: A Theory of Regular MSC Languages. I&C 202, 1–38 (2005)

    MATH  MathSciNet  Google Scholar 

  13. Husson, J.-F., Morin, R.: On Recognizable Stable Trace Languages. In: Tiuryn, J. (ed.) FOSSACS 2000. LNCS, vol. 1784, pp. 177–191. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  14. Kuske, D.: Regular sets of infinite message sequence charts. I&C 187, 80–109 (2003)

    MATH  MathSciNet  Google Scholar 

  15. 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 

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

    Article  MATH  Google Scholar 

  17. 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 

  18. Morin, R.: Concurrent Automata vs. Asynchronous Systems. In: Jedrzejowicz, J., Szepietowski, A. (eds.) MFCS 2005. LNCS, vol. 3618, pp. 686–698. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

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

    Chapter  Google Scholar 

  20. Nielsen, M., Plotkin, G., Winskel, G.: Petri nets, events structures and domains, part 1. TCS 13, 85–108 (1981)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  22. Szpilrajn, E.: Sur l’extension de l’ordre partiel. Fund. Math. 16, 386–389 (1930)

    MATH  Google Scholar 

  23. Thomas, W.: On logical definability of trace languages Technical University of Munich, report. TUM-I9002, 172–182 (1990)

    Google Scholar 

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

    MATH  MathSciNet  Google Scholar 

  25. Zielonka, W.: Safe executions of recognizable trace languages by asynchronous automata. In: Meyer, A.R., Taitslin, M.A. (eds.) Logic at Botik 1989. LNCS, vol. 363, pp. 278–289. Springer, Heidelberg (1989)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire d’Informatique Fondamentale de Marseille, Aix-Marseille université — UMR 6166 — CNRS, 163, avenue de Luminy, F-13288, Marseille Cedex 9, 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

Masami Ito Masafumi Toyama

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Morin, R. (2008). MSO Logic for Unambiguous Shared-Memory Systems. In: Ito, M., Toyama, M. (eds) Developments in Language Theory. DLT 2008. Lecture Notes in Computer Science, vol 5257. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85780-8_41

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-85780-8_41

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-85780-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation