On external presentations of infinite graphs

The vertices of a finite state system are usually a subset of the natural numbers. Most algorithms relative to these systems only use this fact to select vertices. For infinite state systems, however, the situation is different: in particular, for such systems having a finite description, each state of the system is a configuration of some machine. Then most algorithmic approaches rely on the structure of these configurations. Such characterisations are said internal. In order to apply algorithms detecting a structural property (like identifying connected components) one may have first to transform the system in order to fit the description needed for the algorithm. The problem of internal characterisation is that it hides structural properties, and each solution becomes ad hoc relatively to the form of the configurations. On the contrary, external characterisations avoid explicit naming of the vertices. Such characterisation are mostly defined via graph transformations. In this paper we present two kind of external characterisations: deterministic graph rewriting, which in turn characterise regular graphs, deterministic context-free languages, and rational graphs. Inverse substitution from a generator (like the complete binary tree) provides characterisation for prefix-recognizable graphs, the Caucal Hierarchy and rational graphs. We illustrate how these characterisation provide an efficient tool for the representation of infinite state systems

Multi-level agent-based modeling - A literature survey

During last decade, multi-level agent-based modeling has received significant and dramatically increasing interest. In this article we present a comprehensive and structured review of literature on the subject. We present the main theoretical contributions and application domains of this concept, with an emphasis on social, flow, biological and biomedical models.Comment: v2. Ref 102 added. v3-4 Many refs and text added v5-6 bibliographic statistics updated. v7 Change of the name of the paper to reflect what it became, many refs and text added, bibliographic statistics update

Multi-level agent-based modeling with the Influence Reaction principle

This paper deals with the specification and the implementation of multi-level agent-based models, using a formal model, IRM4MLS (an Influence Reaction Model for Multi-Level Simulation), based on the Influence Reaction principle. Proposed examples illustrate forms of top-down control in (multi-level) multi-agent based-simulations

Probabilistic regular graphs

Deterministic graph grammars generate regular graphs, that form a structural extension of configuration graphs of pushdown systems. In this paper, we study a probabilistic extension of regular graphs obtained by labelling the terminal arcs of the graph grammars by probabilities. Stochastic properties of these graphs are expressed using PCTL, a probabilistic extension of computation tree logic. We present here an algorithm to perform approximate verification of PCTL formulae. Moreover, we prove that the exact model-checking problem for PCTL on probabilistic regular graphs is undecidable, unless restricting to qualitative properties. Our results generalise those of EKM06, on probabilistic pushdown automata, using similar methods combined with graph grammars techniques.Comment: In Proceedings INFINITY 2010, arXiv:1010.611

The chemical composition of CO-rich comet C/2009 P1 (Garradd) at Rh = 2.4 and 2.0 AU before perihelion

We quantified ten parent volatiles in comet C/2009 P1 (Garradd) before perihelion, through high-dispersion infrared spectra acquired with CRIRES at ESO's VLT on UT 2011 August 07 (Rh = 2.4 AU) and September 17-21 (Rh = 2.0 AU). On August 07, water was searched but not detected at an upper limit (3{\sigma}) of 2.1 \times 10^28 s-1, while ethane was detected with a production rate of 6.1 \times 10^26 s-1 (apparent mixing ratio > 2.90%). On September 17-21, the mean production rate for water was 8.4 \times 10^28 s-1, and abundance ratios (relative to water) of detected trace species were: CO (12.51%), CH3OH (3.90%), CH4 (1.24%), C2H6 (1.01%) and HCN (0.36%). Upper limits (3{\sigma}) to abundances for four minor species were: NH3 (1.55%), C2H2 (0.13%), HDO (0.89%) and OCS (0.20%). Given the relatively large heliocentric distance, we explored the effect of water not being fully sublimated within our FOV and identified the 'missing' water fraction needed to reconcile the retrieved abundance ratios with the mean values found for "organics-normal". The individual spatial profiles of parent volatiles and the continuum displayed rather asymmetric outgassing. Indications of H2O and CO gas being released in different directions suggest different active vents and/or the possible existence of polar and apolar ice aggregates in the nucleus. The high fractional abundance of CO identifies comet C/2009 P1 as a CO-rich comet.Comment: To appear in: The Astrophysical Journal Letters (LET27048R

An Experimental Study of Robustness to Asynchronism for Elementary Cellular Automata

Cellular Automata (CA) are a class of discrete dynamical systems that have been widely used to model complex systems in which the dynamics is specified at local cell-scale. Classically, CA are run on a regular lattice and with perfect synchronicity. However, these two assumptions have little chance to truthfully represent what happens at the microscopic scale for physical, biological or social systems. One may thus wonder whether CA do keep their behavior when submitted to small perturbations of synchronicity. This work focuses on the study of one-dimensional (1D) asynchronous CA with two states and nearest-neighbors. We define what we mean by ``the behavior of CA is robust to asynchronism'' using a statistical approach with macroscopic parameters. and we present an experimental protocol aimed at finding which are the robust 1D elementary CA. To conclude, we examine how the results exposed can be used as a guideline for the research of suitable models according to robustness criteria.Comment: Version : Feb 13th, 2004, submitted to Complex System