Skip to main content

Describing Resource Allocation to Dynamically Formed Groups with Grammars

  • Conference paper
  • First Online:
Simulation and Modeling Methodologies, Technologies and Applications (SIMULTECH 2017)

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 873))

  • 393 Accesses

Abstract

In this paper we model dynamic group formation and resource allocation with grammars in order to gain a deeper understanding into the involved processes. Modelling with grammars allows us to describe resource allocation and group formation as generative processes that provide, at any given time, information about at what stage the process of group formation and resource allocation is. We divide our model into four phases: (1) resource supply, (2) candidate group formation, (3) final group formation, and (4) resource distribution. In particular, we show that we can use permitting random context grammars to describe the first two phases. For the third phase we introduce an algorithm that determines based on a resource allocation strategy the final group to which resources are distributed. The last phase is described with random context grammars under a specific leftmost derivation mode. Our model shows that if information about the available resource and candidate group formation is distributed and kept separate, then the synchronisation of this information at a later stage (i.e. resource distribution phase) needs a more powerful grammar model.

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 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

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Bensch, S., Drewes, F., Jürgensen, H., van der Merwe, B.: Graph transformation for incremental natural language analysis. Theor. Comput. Sci. 531, 1–25 (2014)

    Article  MathSciNet  Google Scholar 

  2. Bensch, S., Ewert, S., Raborife, M.: Modelling the formation of virtual buying cooperatives with grammars of regulated rewriting. In Proceedings of the 7th International Conference on Simulation and Modeling Methodologies, Technologies and Applications, SIMULTECH 2017, pp. 45–55 (2017)

    Google Scholar 

  3. Chomsky, N.: Three models for the description of language. IRE Trans. Inf. Theory 2(3), 113–124 (1956)

    Article  Google Scholar 

  4. Dassow, J., Păun, G.: Regulated Rewriting in Formal Language Theory, vol. 18. EATCS Monographs on Theoretical Computer Science. Springer, Heidelberg (1989)

    Chapter  Google Scholar 

  5. Ewert, S., Van der Walt, A.: A pumping lemma for random permitting context languages. Theor. Comput. Sci. 270, 959–967 (2002)

    Article  MathSciNet  Google Scholar 

  6. Ewert, S.: Random context picture grammars: the state of the art. In: Drewes, F., Habel, A., Hoffmann, B., Plump, D. (eds.) Manipulation of Graphs, Algebras and Pictures, pp. 135–147. Hohnholt, Bremen (2009)

    Google Scholar 

  7. Ewert, S., van der Walt, A.: Random context picture grammars. Publicationes Mathematicae (Debrecen), 54(Supp), 763–786 (1999)

    Google Scholar 

  8. Hopcroft, J., Ullman, J.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979)

    Google Scholar 

  9. Joshi, A.K.: Tree adjoining grammars: how much context-sensitivity is required to provide reasonable structural descriptions? In: Dowty, D.R., Karttunen, L., Zwicky, A.M. (eds.) Natural Language Parsing. Psychological, Computational, and Theoretical Perspectives, pp. 206–250. Cambridge University Press, New York (1985)

    Chapter  Google Scholar 

  10. Mashkov, V., Barilla, J., Simr, P., Bicanek, J.: Modeling and simulation of coalition formation. In: Proceedings of the 5th International Conference on Simulation and Modeling Methodologies, Technologies and Applications (SIMULTECH 2015), pp. 329–336 (2015)

    Google Scholar 

  11. Mohan, N.R.R., Raj, E.B.: Resource allocation techniques in cloud computing – research challenges for applications. In: Fourth International Conference on Computational Intelligence and Communication Networks (CICN), pp. 556–560 (2012)

    Google Scholar 

  12. Okundaye, B.: A tree grammar-based visual password scheme. Ph.D. thesis, University of the Witwatersrand, Johannesburg (2015)

    Google Scholar 

  13. Recker, J.: Evaluations of Process Modeling Grammars. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  14. van der Walt, A.P.J.: Random context languages. Inf. Process. 71, 66–68 (1972)

    MathSciNet  MATH  Google Scholar 

  15. Zetzsche, G.: On erasing productions in random context grammars. In: 37th International Colloquium on Automata, Languages and Programming, ICALP 2010, Proceedings, Part II, pp. 175–186 (2010)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Suna Bensch .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Bensch, S., Ewert, S. (2019). Describing Resource Allocation to Dynamically Formed Groups with Grammars. In: Obaidat, M., Ören, T., Rango, F. (eds) Simulation and Modeling Methodologies, Technologies and Applications . SIMULTECH 2017. Advances in Intelligent Systems and Computing, vol 873. Springer, Cham. https://doi.org/10.1007/978-3-030-01470-4_9

Download citation

Publish with us

Policies and ethics