Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Fundamentals of Computation Theory

FCT 1995: Fundamentals of Computation Theory pp 393–403Cite as

On the synchronization of semi-traces

  • Communications
  • Conference paper
  • First Online:

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

Abstract

The synchronization of two or more semi-traces describes the possible evaluation of a concurrent system, which consists of two or more concurrent subsystems in a modular way, where communication between the subsystems restricts the order of the actions. In this paper we give criteria, which tell us for given semi-traces in given semi-commutation systems, whether they are synchronizable and whether the synchronization is again a semi-trace; and criteria, which tell us for given semi-commutation systems, whether all semi-traces have this property. We prove that deciding these criteria is NLOGSPACE-complete for given semi-traces. The same holds for the synchronizability of all semi-traces for given semi-commutation systems. On the other hand the question, whether for given semi-commutation systems the synchronization of synchronizable semi-traces is a semi-trace is co-NP-complete. Furthermore we give a co-NP-complete condition for being able to decide synchronizability locally in TC0.

this research has been supported by the EBRA working group No. 3166 ASMICS.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. C. Àlvarez and J. Gabarró. The parallel complexity of two problems on concurrency. Information Processing Letters, 38:61–70, 1991.

    Google Scholar 

  2. IJ. J. Aalbersberg and H. J. Hoogeboom. Characterizations of the decidability of some problems for regular trace languages. Mathematical Systems Theory, 22:1–19, 1989.

    Google Scholar 

  3. J. L. Balcázar, J. Díaz, and J. Gabarró. Structural Complexity I. Number 11 in EATCS Monographs on Theoretical Computer Science. Springer, Berlin-Heidelberg-New York, 1988.

    Google Scholar 

  4. D.M. Barrington, N. Immerman, and H. Straubing. On uniformity within NC1. J. of Comp. and Syst. Sciences, 41:274–306, 1990.

    Google Scholar 

  5. M. Clerbout, D. Gonzalez, M. Latteux, E. Ochmanski, Y. Roos, and P.A. Wacrenier. Recognizable morphisms on semi commutations. Tech. Rep. LIFL I.T.-238, Université des Sciences et Technologies de Lille (France), 1992.

    Google Scholar 

  6. M. Clerbout and M. Latteux. Semi-Commutations. Information and Computation, 73:59–74, 1987.

    Article  Google Scholar 

  7. M. Clerbout. Commutations Partielles et Familles de Langages. Thèse, Université des Sciences et Technologies de Lille (France), 1984.

    Google Scholar 

  8. V. Diekert. A partial trace semantics for Petri nets. Theoretical Computer Science, 134:87–105, 1994. Special issue of ICWLC 92, Kyoto (Japan).

    Google Scholar 

  9. V. Diekert, E. Ochmański, and K. Reinhardt. On confluent semi-commutation systems — decidability and complexity results. Information and Computation, 110:164–182, 1994. A preliminary version was presented at ICALP'91, Lecture Notes in Computer Science 510 (1991).

    Google Scholar 

  10. V. Diekert and G. Rozenberg, editors. The Book of Traces. World Scientific, Singapore, 1995.

    Google Scholar 

  11. V. Diekert and W. Vogler. On the synchronization of traces. Mathematical Systems Theory, 22:161–175, 1989. A preliminary extended abstract appeared at MFCS 88, Lecture Notes in Computer Science 324 (1988) 271–279.

    Google Scholar 

  12. D. V. Hung and E. Knuth. Semi-commutations and Petri nets. Theoretical Computer Science, 64:67–81, 1989.

    Article  Google Scholar 

  13. N. Immerman. Nondeterministic space is closed under complement. SIAM Journal on Computing, 17(5):935–938, 1988.

    Article  Google Scholar 

  14. D. S. Johnson. A catalog of complexity classes. In J. van Leeuwen, editor, Algorithms and Complexity, volume A of Handbook of Theoretical Computer Science, chapter 2, pages 67–161. Elsevier, 1990.

    Google Scholar 

  15. A. Mazurkiewicz. Trace theory. In W. Brauer et al., editors, Petri Nets, Applications and Relationship to other Models of Concurrency, number 255 in Lecture Notes in Computer Science, pages 279–324, Berlin-Heidelberg-New York, 1987. Springer.

    Google Scholar 

  16. E. Ochmański. Semi-Commutation and Petri Nets. In V. Diekert, editor, Proceedings of the ASMICS workshop Free Partially Commutative Monoids, Kochel am See 1989, Report TUM-I9002, Technical University of Munich, pages 151–166, 1990.

    Google Scholar 

  17. E. Ochmański. Modelling concurrency with semi-commutations. In I. M. Havel and V. Koubek, editors, Proceedings of the 17th Symposium on Mathematical Foundations of Computer Science (MFCS'92), Prague, (Czechoslovakia), 1992, number 629 in Lecture Notes in Computer Science, pages 412–420, Berlin-Heidelberg-New York, 1992. Springer.

    Google Scholar 

  18. E. Ochmański and P. A. Wacrenier. On regular compatibility of semi-commutations. In Andrzej Lingas, Rolf Karlsson, and Svante Carlsson, editors, Proceedings of the 20th International Colloquium on Automata, Languages and Programming (ICALP'93), Lund (Sweden) 1993, number 700 in Lecture Notes in Computer Science, pages 445–456, Berlin-Heidelberg-New York, 1993. Springer.

    Google Scholar 

  19. Ian Parberry. A primer on the complexity theory of neural networks. In R.B. Banerji, editor, Formal Techniques in Artificial Intelligence, Amsterdam, 1990. North-Holland.

    Google Scholar 

  20. K. Reinhardt. Prioritätszählerautomaten und die Synchronisation von Halbspursprachen. Dissertation, Institut für Informatik, Universität Stuttgart, 1994.

    Google Scholar 

  21. W. L. Ruzzo. On uniform circuit complexity. Journal of Computer and System Sciences, 22:365–383, 1981.

    Article  Google Scholar 

  22. Y. Roos and P. A. Wacrenier. Composition of two semi commutations. In A. Tarlecki, editor, Proceedings of the 16th Symposium on Mathematical Foundations of Computer Science (MFCS'91), Kazimierz Dolny (Poland) 1991, number 520 in Lecture Notes in Computer Science, pages 406–414, Berlin-Heidelberg-New York, 1991. Springer.

    Google Scholar 

  23. L. J. Stockmeyer. The polynomial time hierarchy. Theoret. Comput. Sci., 3:1–22, 1977.

    Google Scholar 

  24. R. Szelepcsényi. The method of forced enumeration for nondeterministic automata. Acta Informatica, 26:279–284, 1988.

    Google Scholar 

  25. C. Wrathall. Complete sets and the polynomial hierarchie. Theoret. Comput. Sci., 3:23–33, 1977.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Wilhelm-Schickhard Institut für Informatik, Universität Tübingen, Sand 13, D-72076, Tübingen, Germany

    Klaus Reinhardt

Authors
  1. Klaus Reinhardt
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Horst Reichel

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Reinhardt, K. (1995). On the synchronization of semi-traces. In: Reichel, H. (eds) Fundamentals of Computation Theory. FCT 1995. Lecture Notes in Computer Science, vol 965. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60249-6_71

Download citation

  • DOI: https://doi.org/10.1007/3-540-60249-6_71

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60249-1

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation