Skip to main content

A language theoretic approach to serialization problem in concurrent systems

  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 1985)

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

Included in the following conference series:

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. E. Best and K. Voss: Free-choice systems have home states, Acta Informatica 21, 89–100 (1984).

    Google Scholar 

  2. P.A. Bernstein and N. Goodman: Concurrency Control in Distributed Data Base Systems, Computing Surveys 13, no 2, 185–222 (1981).

    Google Scholar 

  3. K.P. Eswaran, J.N. Gray, R.A. Lorie and J.L. Traiger: The notions of Consistency and Predicate Locks in Data base Systems, Comm. ACM 19 (11) 624–633 (1976)

    Google Scholar 

  4. M.P. Flé and G. Roucairol: On Serializability of Iterated Transactions, ACM SIGACT-SIGOPS Symp. on Principles of Distributed Computing, Ottawa, Canada, 194–200 (1982).

    Google Scholar 

  5. M.P. Flé and G. Roucairol: On Fair Serializability of Iterated Transactions using FIFO nets, Advances in Petri Nets 1984, Rozenberg ed. lect. Notes in Computer Science 188, 154–168 (1985). Springer-Verlag.

    Google Scholar 

  6. M.P. Flé and G. Roucairol, Multiserialization of Iterated Transactions, Information Processing Letters 18, 243–247 (1984).

    Google Scholar 

  7. M.P. Flé and G. Roucairol: Maximal Serializability of Iterated Transactions (to appear in Theoretical Computer Science).

    Google Scholar 

  8. M.P. Flé, G. Roucairol: Free-serializability of Iterated Transactions, Rapport de Recherche LRI, no 181 (Novembre 1984).

    Google Scholar 

  9. Y. Kwong: On the absence of Livelocks in Parallel Programs. Semantics of concurrent Computations. Proceedings, Evian, France, Lect. Notes Computer Science 70, 172–190 (1979). Springer-Verlag.

    Google Scholar 

  10. R.M. Karp and R.E. Miller, Parallel Program Schemata, JCSS 3, 147–195 (1969).

    Google Scholar 

  11. R.M. Keller: Parallel Program Schemata and Maximal Parallelism, J.Assoc. Comp. Mach. 20, no 3, 514–537 (1973).

    Google Scholar 

  12. C.H. Papadimitriou, P.A. Bernstein and J.B. Rothnie: Some Computational problems related to Data Base Concurrency Control, Proc. Conf. on Theoretical Computer Science, Waterloo, Ontario, Canada, 275–282 (1977).

    Google Scholar 

  13. M.W. Shields: On the non-sequential Behaviour of Systems Possessing a Generalized Free Choice Property. Technical Report CRS-92-81, University of Edinburgh, Department of Computer Science, September 1981.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Lothar Budach

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Flé, M.P., Roucairol, G. (1985). A language theoretic approach to serialization problem in concurrent systems. In: Budach, L. (eds) Fundamentals of Computation Theory. FCT 1985. Lecture Notes in Computer Science, vol 199. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028798

Download citation

  • DOI: https://doi.org/10.1007/BFb0028798

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-15689-5

  • Online ISBN: 978-3-540-39636-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics