Sciweavers

ICGI
2010
Springer
13 years 5 months ago
Inferring Regular Trace Languages from Positive and Negative Samples
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...
Antonio Cano Gómez
ACRI
2010
Springer
13 years 6 months ago
Parallel Composition of Asynchronous Cellular Automata Simulating Reaction Diffusion Processes
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...
Olga L. Bandman
FCT
2005
Springer
13 years 10 months ago
On the Expressiveness of Asynchronous Cellular Automata
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 ...
Benedikt Bollig
ACRI
2006
Springer
13 years 10 months ago
Social Distances Model of Pedestrian Dynamics
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...
ACRI
2006
Springer
13 years 10 months ago
Parallel Simulation of Asynchronous Cellular Automata Evolution
For simulating physical and chemical processes on molecular level asynchronous cellular automata with probabilistic transition rules are widely used being sometimes referred to as ...
Olga L. Bandman