Concurrent Context-Free Grammars

  • Gairatzhan Mavlankulov
  • Mohamed Othman
  • Mohd Hasan Selamat
  • Sherzod Turaev
Conference paper
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 285)


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.


Petri nets Parallel firing Controlled grammars Parallel computing 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.



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


  1. 1.
    Hans-Dieter Burkhard. Ordered Firing in petri nets. Information Processing and Cybernetcs, 2/3:71-86, 1989.Google Scholar
  2. 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. 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. 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. 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. 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. 7.
    B. Farwer, M. Kudlek, and H. Rolke. Concurrent Turing machines. Fundamenta Informaticae, 79(3-4):303-317, 2007.Google Scholar
  8. 8.
    M. Hack. Petri net languages. Computation Structures Group Memo, Project MAC 124, MIT, Cambridge Mass., 1975.Google Scholar
  9. 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. 10.
    J.L. Peterson. Petri net theory and modeling of systems. Prentice-Hall, Englewood Clis, NJ, 1981.Google Scholar
  11. 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

Copyright information

© Springer Science+Business Media Singapore 2014

Authors and Affiliations

  • Gairatzhan Mavlankulov
    • 1
  • Mohamed Othman
    • 1
  • Mohd Hasan Selamat
    • 1
  • Sherzod Turaev
    • 2
  1. 1.Department of Communication Technology and NetworkUniversiti Putra Malaysia UPMSerdangMalaysia
  2. 2.Department of Computer ScienceInternational Islamic University MalaysiaGombakMalaysia

Personalised recommendations