Skip to main content
SpringerLink
Log in

Some Properties of the Concurrent Grammars

  • Conference paper
  • First Online:
International Conference on Mathematical Sciences and Statistics 2013

Abstract

Petri nets are becoming one of the most important mathematical tools in Computer Science. In this paper, we study some mathematical properties of concurrent grammars which are controlled by Petri nets under parallel firing strategies, where transitions of Petri nets fire simultaneously in different modes. We propose a notion of concurrent context-free grammar which is a similar case of the context-free Petri nets under parallel firing strategy, where parallel firing modes of context-free Petri nets were converted to rule applications in context-free grammars and we investigate their properties.

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 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover 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

References

  1. Hans-Dieter, B. Ordered firing in Petri nets. Inf. Process. Cybern. 17(2/3) 71–86 (1989)

    Google Scholar 

  2. Dassow, J., Turaev, S.: k-Petri net controlled grammars. In: Hutchison, D., et al. (eds.) Language and Automata Theory and Applications. Lecture Notes in Computer Science, vol. 5196, pp. 209–220. Springer, Berlin (2008) (LATA 2008. Revised Papers)

    Google Scholar 

  3. Dassow, J., Turaev, S.: Grammars controlled by special Petri nets. In: Hutchison, D., et al. (eds.) Language and Automata Theory and Applications. Lecture Notes in Computer Science, vol. 5457, pp. 326–337. Springer, Berlin (2009) (Third International Conference, LATA 2009)

    Google Scholar 

  4. Dassow, J., Turaev, S.: Petri net controlled grammars: the power of labeling and final markings. Rom. J. Inf. Sci. Tech. 12(2), 191–207 (2009)

    Google Scholar 

  5. Dassow, J., Mavlankulov, G., Othman, M., Turaev, S., Selamat, M.H., Stiebe, R.: Grammars controlled by Petri nets. In: Pawlewski, P. (ed.) Petri Nets. Intech, Rijeka (2012) (ISBN 978-953-51-0700-2.)

    Google Scholar 

  6. Farwer, B., Jantzen, M., Kudlek, M., Rolke, H., Zetzsche, G.: Petri net controlled finite automata. Fund. Inform. 85(1–4), 111–121 (2008)

    MATH  MathSciNet  Google Scholar 

  7. Farwer, B., Kudlek, M., Rolke., H.: Concurrent Turing machines. Fund. Inform. 79(3–4), 303–317 (2007)

    MATH  MathSciNet  Google Scholar 

  8. Hack, M.: Petri net languages. MIT, Cambridge (1975) (Computation Structures Group Memo, Project MAC 124)

    Google Scholar 

  9. Jantzen, M., Zetzsche, G.: Labeled step sequences in Petri nets. In: van Hee Kees, M., Rüdiger, V. (eds.) Applications and Theory of Petri Nets. Lecture Notes in Computer Science, vol. 5062, pp. 270–283. Springer, Berlin (2008)

    Google Scholar 

  10. Peterson, J.L.: Petri net theory and modeling of systems. Prentice-Hall, Englewood Cliffs (1981)

    Google Scholar 

  11. Turaev, S.: Petri net controlled grammars. In: Matyska, L., et al. (eds.) Third Doctoral Workshop on Mathematical and Engineering Methods in Computer Science, MEMICS 2007, pp. 233–240, Prestige Hotel, Znojmo, Czechia, 26–28 Oct 2007 (ISBN 978-80-7355-077-6.)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Computer Science and Information Technology, Universiti Putra Malaysia, Seri Kembagan, Malaysia

    Gairatzhan Mavlankulov

  2. Faculty of Computer Science and Information Technology, Universiti Putra Malaysia, Seri Kembagan, Malaysia

    Mohamed Othman

  3. Faculty of Computer Science and Information Technology, Universiti Putra Malaysia, Seri Kembagan, Malaysia

    Mohd Hasan Selamat

  4. Kulliyyah of Information and Communication Technology, International Islamic University Malaysia, Gombak, Malaysia

    Sherzod Turaev

Authors
  1. Gairatzhan Mavlankulov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mohamed Othman
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Mohd Hasan Selamat
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Sherzod Turaev
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University Putra Malaysia, Serdang, Selangor, Malaysia

    Adem Kilicman

  2. University Putra Malaysia, Serdang, Selangor, Malaysia

    Wah June Leong

  3. University Putra Malaysia, Serdang, Selangor, Malaysia

    Zainidin Eshkuvatov

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer Science+Business Media Singapore

About this paper

Cite this paper

Mavlankulov, G., Othman, M., Selamat, M., Turaev, S. (2014). Some Properties of the Concurrent Grammars. In: Kilicman, A., Leong, W., Eshkuvatov, Z. (eds) International Conference on Mathematical Sciences and Statistics 2013. Springer, Singapore. https://doi.org/10.1007/978-981-4585-33-0_23

Download citation

Publish with us

Policies and ethics

Search

Navigation