In this work, we give an algorithm that infers Regular Trace Languages. Trace languages can be seen as regular languages that are closed under a partial commutation relation called...
A method of constructing asynchronous cellular automata (ACA model) as a parallel composition of two interacting ACA is presented. The resulting ACA is intended to simulate a proce...
We show that a slightly extended version of asynchronous cellular automata, relative to any class of pomsets and dags without autoconcurrency, has the same expressive power as the ...
Abstract. The knowledge of phenomena connected with pedestrian dynamics is desired in the process of developing public facilities. Nowadays, there is a necessity of creating variou...
Jaroslaw Was, Bartlomiej Gudowski, Pawel J. Matusz...
For simulating physical and chemical processes on molecular level asynchronous cellular automata with probabilistic transition rules are widely used being sometimes referred to as ...