Describing Resource Allocation to Dynamically Formed Groups with Grammars

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.

[1]  Jan Recker Evaluations of Process Modeling Grammars - Ontological, Qualitative and Quantitative Analyses Using the Example of BPMN , 2011, Lecture Notes in Business Information Processing.

[2]  Sigrid Ewert,et al.  Modelling the Formation of Virtual Buying Cooperatives with Grammars of Regulated Rewriting , 2017, SIMULTECH.

[3]  Pavel Simr,et al.  Modeling and Simulation of Coalition Formation , 2015, SIMULTECH.

[4]  Georg Zetzsche On Erasing Productions in Random Context Grammars , 2010, ICALP.

[5]  Jürgen Dassow,et al.  Applications of Regulated Rewriting , 1989 .

[6]  Brink van der Merwe,et al.  Graph transformation for incremental natural language analysis , 2014, Theor. Comput. Sci..

[7]  N. R. R. Mohan,et al.  Resource Allocation Techniques in Cloud Computing -- Research Challenges for Applications , 2012, 2012 Fourth International Conference on Computational Intelligence and Communication Networks.

[8]  Aravind K. Joshi,et al.  Natural language parsing: Tree adjoining grammars: How much context-sensitivity is required to provide reasonable structural descriptions? , 1985 .

[9]  Sigrid Ewert,et al.  A pumping lemma for random permitting context languages , 2002, Theor. Comput. Sci..

[10]  Sigrid Ewert,et al.  Generalized Random Context Picture Grammars: The State of the Art , 2012, Languages Alive.

[11]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[12]  Noam Chomsky,et al.  Three models for the description of language , 1956, IRE Trans. Inf. Theory.

[13]  Sigrid Ewert Random Context Picture Grammars , 2012 .

[14]  Gheorghe Paun,et al.  Regulated Rewriting in Formal Language Theory , 1989 .

[15]  Benjamin Okundaye A tree grammar-based visual password scheme , 2016 .