Skip to main content

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 5796))

Included in the following conference series:

Abstract

The theory of traces was originated by A. Mazurkiewicz to model non-sequential behaviour of a distributed system. The normal form of a trace shows us an optimal way to execute a process occurred on the system. Nevertheless, the independence of actions in many systems is not static and depends on the history of the systems. To describe this fact, D. Kuske and R. Morin proposed a notion of local independence. Basing on the local independence, we introduce a notion of semi-trace, analyze its structure and the relationship between traces and semi-traces. Furthermore, we investigate some applications of semi-traces in concurrency control problem.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Aalbersbeg, J.I., Rozenberg, G.: Theory of Traces. Theoretical Computer Science 60, 1–82 (1988)

    Article  MathSciNet  Google Scholar 

  2. Kuske, D., Morin, R.: Pomsets for Local Trace Languages. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol. 1877, pp. 426–441. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  3. Mazurkiewicz, A.: Concurrent Program Schemes and Their Interpretations, Aarhus Unviversity Publication, DAIMI PB-78 (1977)

    Google Scholar 

  4. Thanh, H.C.: Algorithms for finding the normal form of traces and synchronous traces. Journal of Computer Science and Cybernetics 17(1), 72–77 (2001)

    Google Scholar 

  5. Thanh, H.C.: Transforming sequential processes of a net system into concurrent ones. International Journal of Knowledge-based and Intelligent Engineering Systems 11(6), 391–397 (2007)

    Article  Google Scholar 

  6. Thiagarajan, P.S.: Some behavioural aspects of net theory. Theoretical Computer Science 71, 133–153 (1990)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Thanh, H.C. (2009). Semi-traces and Their Application in Concurrency Control Problem. In: Nguyen, N.T., Kowalczyk, R., Chen, SM. (eds) Computational Collective Intelligence. Semantic Web, Social Networks and Multiagent Systems. ICCCI 2009. Lecture Notes in Computer Science(), vol 5796. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04441-0_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-04441-0_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-04440-3

  • Online ISBN: 978-3-642-04441-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics