Skip to main content
SpringerLink
Log in

Concurrent Context-Free Grammars

  • Conference paper
  • First Online:
Proceedings of the First International Conference on Advanced Data and Information Engineering (DaEng-2013)

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 285))

Abstract

In this paper we study some properties of context-free concurrent grammars which are controlled by Petri nets under parallel firing strategies, i.e., the transitions of a Petri net fire simultaneously in different modes. These variants of control increase the computational power of generative devices. Moreover, they can be used as theoretical models for parallel computing devices.

Mohamed Othman is an associate researcher at Computational Science and Mathematical Physics Lab., Mathematical Science Ins., UPM.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Hans-Dieter Burkhard. Ordered Firing in petri nets. Information Processing and Cybernetcs, 2/3:71-86, 1989.

    Google Scholar 

  2. J. Dassow and S. Turaev. k-Petri net controlled grammars. Language and Automata Theory and Applications. Second International Conference, LATA 2008. Revised Papers, volume 5196 of LNCS, pages 209-220. Springer, 2008.

    Google Scholar 

  3. J. Dassow and S. Turaev. Grammars controlled by special Petri nets. Language and Automata Theory and Applications, Third International Conference, LATA 2009, volume 5457 of LNCS, pages 326-337. Springer, 2009.

    Google Scholar 

  4. J. Dassow and S. Turaev. Petri net controlled grammars: the power of labeling and final markings. Romanian Jour. of Information Science and Technology, 12(2):191-207, 2009.

    Google Scholar 

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

    Google Scholar 

  6. B. Farwer, M. Jantzen, M. Kudlek, H. Rolke, and G. Zetzsche. Petri net controlled finite automata. Fundamenta Informaticae, 85(1-4):111-121, 2008.

    Google Scholar 

  7. B. Farwer, M. Kudlek, and H. Rolke. Concurrent Turing machines. Fundamenta Informaticae, 79(3-4):303-317, 2007.

    Google Scholar 

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

    Google Scholar 

  9. M. Jantzen and G. Zetzsche. Labeled step sequences in Petri Nets. In Petri Nets 2008, volume 5062 of LNCS, pages 270-283. Springer, 2008.

    Google Scholar 

  10. J.L. Peterson. Petri net theory and modeling of systems. Prentice-Hall, Englewood Clis, NJ, 1981.

    Google Scholar 

  11. S. Turaev. Petri net controlled grammars. In Third Doctoral Workshop on Mathematical and Engineering Methods in Computer Science, MEMICS 2007, pages 233-240, Znojmo, Czechia, 2007. ISBN 978-80-7355-077-6.

    Google Scholar 

Download references

Acknowledgments

This work has been supported by Ministry of Higher Education of Malaysia via Fundamental Research Grant Scheme FRGS/1/11/SG/UPM/01/1.

Author information

Authors and Affiliations

  1. Department of Communication Technology and Network, Universiti Putra Malaysia UPM, Serdang, Selangor D.E, Malaysia

    Gairatzhan Mavlankulov, Mohamed Othman & Mohd Hasan Selamat

  2. Department of Computer Science, International Islamic University Malaysia, 53100, Gombak, Selangor D.E, 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

Corresponding author

Correspondence to Gairatzhan Mavlankulov .

Editor information

Editors and Affiliations

  1. Faculty of Computer Science and Information Technology, University of Malaya, Kuala Lumpur, Malaysia

    Tutut Herawan

  2. Faculty of Computer Science and Information Technology, Universiti Tun Hussein Onn Malaysia, Batu Pahat, Malaysia

    Mustafa Mat Deris

  3. School of Information Technology, Deakin University, Burwood, Victoria, Australia

    Jemal Abawajy

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.H., Turaev, S. (2014). Concurrent Context-Free Grammars. In: Herawan, T., Deris, M., Abawajy, J. (eds) Proceedings of the First International Conference on Advanced Data and Information Engineering (DaEng-2013). Lecture Notes in Electrical Engineering, vol 285. Springer, Singapore. https://doi.org/10.1007/978-981-4585-18-7_58

Download citation

  • DOI: https://doi.org/10.1007/978-981-4585-18-7_58

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-4585-17-0

  • Online ISBN: 978-981-4585-18-7

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation