Timed Transition Automata as Numerical Planning Domain

A general technique for transforming a timed finite state automaton into an equivalent automated planning domain based on a numerical parameter model is introduced. Timed transition automata have many applications in control systems and agents models; they are used to describe sequential processes, where actions are labelling by automaton transitions subject to temporal constraints. The language of timed words accepted by a timed automaton, the possible sequences of system or agent behaviour, can be described in term of an appropriate planning domain encapsulating the timed actions patterns and constraints. The time words recognition problem is then posed as a planning problem where the goal is to reach a final state by a sequence of actions, which corresponds to the timed symbols labeling the automaton transitions. The transformation is proved to be correct and complete and it is space/time linear on the automaton size. Experimental results shows that the performance of the planning domain obtained by transformation is scalable for real world applications. A major advantage of the planning based approach, beside of the solving the parsing problem, is to represent in a single automated reasoning framework problems of plan recognitions, plan synthesis and plan optimisation.

The MIRELA framework: modeling and analyzing mixed reality applications using timed automata

Mixed Reality (MR) aims to link virtual entities with the real world and has many applications such as military and medical domains [JBL+00, NFB07]. In many MR systems and more precisely in augmented scenes, one needs the application to render the virtual part accurately at the right time. To achieve this, such systems acquire data related to the real world from a set of sensors before rendering virtual entities. A suitable system architecture should minimize the delays to keep the overall system delay (also called end-to-end latency) within the requirements for real-time performance. In this context, we propose a compositional modeling framework for MR software architectures in order to specify, simulate and validate formally the time constraints of such systems. Our approach is first based on a functional decomposition of such systems into generic components. The obtained elements as well as their typical interactions give rise to generic representations in terms of timed automata. A whole system is then obtained as a composition of such defined components. To write specifications, a textual language named MIRELA (MIxed REality LAnguage) is proposed along with the corresponding compilation tools. The generated output contains timed automata in UPPAAL format for simulation and verification of time constraints. These automata may also be used to generate source code skeletons for an implementation on a MR platform. The approach is illustrated first on a small example. A realistic case study is also developed. It is modeled by several timed automata synchronizing through channels and including a large number of time constraints. Both systems have been simulated in UPPAAL and checked against the required behavioral properties.

Phacomatoses et tumeurs génétiquement déterminées: la transition enfant-adulte [Phacomatosis and genetically determined tumors: the transition from childhood to adulthood]

Les phacomatoses regroupent des maladies du développement du neurectoderme, engendrant des manifestations cutanées ou du système nerveux central. Les symptômes de ces maladies peuvent affecter les individus atteints à différents moments de leur vie. Il s'agit de maladies, héréditaires ou congénitales, qui sont transmises de façon variable. Effectivement, certaines, telles que la neurofibromatose, la sclérose tubéreuse ou la maladie de von Hippel-Lindau sont autosomiques dominantes, alors que d'autres, telles que la maladie de Sturge-Weber sont sporadiques. Des transmissions autosomiques récessives liées à X ou des formes mosaïques existent également. Une revue de la littérature, comprenant les cinq phacomatoses les plus fréquemment vues par un neurochirurgien (neurofibromatose de type I et II, sclérose tubéreuse de Bourneville, maladie de Sturge-Weber-Krabbe, maladie de von Hippel-Lindau) a été effectuée en se centrant sur le diagnostic, la variabilité de la symptomatologie selon l'âge du patient et son traitement. Les cas de patients adultes et pédiatriques vus aux consultations de neurologie et neurochirurgie de l'hôpital de Lille (France) et Lausanne (Suisse), de 1961 à nos jours, ont été revus pour illustrer les différentes pathologies rencontrées, selon l'âge des patients atteints. Le phénotype de ces maladies se modifie avec l'âge, car les gènes incriminés sont des gènes impliqués dans la différentiation tissulaire et sont activés à des âges différents suivant les tissus. Le rôle du neurochirurgien sera variable selon l'âge et le syndrome du patient. Il importe de connaître les variations du phénotype de ces maladies avec l'âge ainsi que les conséquences à long terme des traitements pour proposer au patient un suivi neurochirurgical personnalisé. Phacomatoses, or neurocutaneous disorders, are a group of congenital and hereditary diseases characterized by developmental lesions of the neuroectoderm, leading to pathologies affecting the skin and the central nervous system. There is a wide range of pathologies affecting individuals at different moments of life. The genetics is variable: while neurofibromatosis 1 and 2, tuberous sclerosis and von Hippel-Lindau disease are all inherited as autosomal dominant traits, Sturge-Weber syndrome is sporadic. Other neurocutaneous disorders can be inherited as autosomal recessive traits (i.e., ataxia-telangiectasia), X-linked (i.e., incontinentia pigmenti) or explained by mosaicism (i.e., hypomelanosis of Ito, McCune-Albright syndrome). In this review, we discuss the major types of neurocutaneous disorders most frequently encountered by the neurosurgeon and followed beyond childhood. They include neurofibromatosis types 1 and 2, tuberous sclerosis, Sturge-Weber syndrome and von Hippel-Lindau disease. In each case, a review of the literature, including diagnosis, genetics and treatment will be presented. The lifespan of the disease with the implications for neurosurgeons will be emphasized. A review of cases, including both pediatric and adult patients, seen in neurosurgical practices in the Lille, France and Lausanne, Switzerland hospitals between 1961 and 2007 is presented to illustrate the pathologies seen in different age-groups. Because the genes mutated in most phacomatoses are involved in development and are activated following a timed schedule, the phenotype of these diseases evolves with age. The implication of the neurosurgeon varies depending on the patient's age and pathology. While neurosurgeons tend to see pediatric patients affected with neurofibromatosis type 1, tuberous sclerosis and Sturge-Weber syndrome, there will be a majority of adult patients with von Hippel-Lindau disease or neurofibromatosis type 2

Automates à contraintes semilinéaires = Automata with a semilinear constraint

Cette thèse présente une étude dans divers domaines de l'informatique théorique de modèles de calculs combinant automates finis et contraintes arithmétiques. Nous nous intéressons aux questions de décidabilité, d'expressivité et de clôture, tout en ouvrant l'étude à la complexité, la logique, l'algèbre et aux applications. Cette étude est présentée au travers de quatre articles de recherche. Le premier article, Affine Parikh Automata, poursuit l'étude de Klaedtke et Ruess des automates de Parikh et en définit des généralisations et restrictions. L'automate de Parikh est un point de départ de cette thèse; nous montrons que ce modèle de calcul est équivalent à l'automate contraint que nous définissons comme un automate qui n'accepte un mot que si le nombre de fois que chaque transition est empruntée répond à une contrainte arithmétique. Ce modèle est naturellement étendu à l'automate de Parikh affine qui effectue une opération affine sur un ensemble de registres lors du franchissement d'une transition. Nous étudions aussi l'automate de Parikh sur lettres: un automate qui n'accepte un mot que si le nombre de fois que chaque lettre y apparaît répond à une contrainte arithmétique. Le deuxième article, Bounded Parikh Automata, étudie les langages bornés des automates de Parikh. Un langage est borné s'il existe des mots w_1, w_2, ..., w_k tels que chaque mot du langage peut s'écrire w_1...w_1w_2...w_2...w_k...w_k. Ces langages sont importants dans des domaines applicatifs et présentent usuellement de bonnes propriétés théoriques. Nous montrons que dans le contexte des langages bornés, le déterminisme n'influence pas l'expressivité des automates de Parikh. Le troisième article, Unambiguous Constrained Automata, introduit les automates contraints non ambigus, c'est-à-dire pour lesquels il n'existe qu'un chemin acceptant par mot reconnu par l'automate. Nous montrons qu'il s'agit d'un modèle combinant une meilleure expressivité et de meilleures propriétés de clôture que l'automate contraint déterministe. Le problème de déterminer si le langage d'un automate contraint non ambigu est régulier est montré décidable. Le quatrième article, Algebra and Complexity Meet Contrained Automata, présente une étude des représentations algébriques qu'admettent les automates contraints et les automates de Parikh affines. Nous déduisons de ces caractérisations des résultats d'expressivité et de complexité. Nous montrons aussi que certaines hypothèses classiques en complexité computationelle sont reliées à des résultats de séparation et de non clôture dans les automates de Parikh affines. La thèse est conclue par une ouverture à un possible approfondissement, au travers d'un certain nombre de problèmes ouverts.

A study on semigroup action on fuzzy subsets, inverse fuzzy automata and related topics

This thesis comprises five chapters including the introductory chapter. This includes a brief introduction and basic definitions of fuzzy set theory and its applications, semigroup action on sets, finite semigroup theory, its application in automata theory along with references which are used in this thesis. In the second chapter we defined an S-fuzzy subset of X with the extension of the notion of semigroup action of S on X to semigroup action of S on to a fuzzy subset of X using Zadeh's maximal extension principal and proved some results based on this. We also defined an S-fuzzy morphism between two S-fuzzy subsets of X and they together form a category S FSETX. Some general properties and special objects in this category are studied and finally proved that S SET and S FSET are categorically equivalent. Further we tried to generalize this concept to the action of a fuzzy semigroup on fuzzy subsets. As an application, using the above idea, we convert a _nite state automaton to a finite fuzzy state automaton. A classical automata determine whether a word is accepted by the automaton where as a _nite fuzzy state automaton determine the degree of acceptance of the word by the automaton. 1.5. Summary of the Thesis 17 In the third chapter we de_ne regular and inverse fuzzy automata, its construction, and prove that the corresponding transition monoids are regular and inverse monoids respectively. The languages accepted by an inverse fuzzy automata is an inverse fuzzy language and we give a characterization of an inverse fuzzy language. We study some of its algebraic properties and prove that the collection IFL on an alphabet does not form a variety since it is not closed under inverse homomorphic images. We also prove some results based on the fact that a semigroup is inverse if and only if idempotents commute and every L-class or R-class contains a unique idempotent. Fourth chapter includes a study of the structure of the automorphism group of a deterministic faithful inverse fuzzy automaton and prove that it is equal to a subgroup of the inverse monoid of all one-one partial fuzzy transformations on the state set. In the fifth chapter we define min-weighted and max-weighted power automata study some of its algebraic properties and prove that a fuzzy automaton and the fuzzy power automata associated with it have the same transition monoids. The thesis ends with a conclusion of the work done and the scope of further study.

An extinction-survival-type phase transition in the probabilistic cellular automaton p182-q200

We investigate the critical behaviour of a probabilistic mixture of cellular automata (CA) rules 182 and 200 (in Wolfram`s enumeration scheme) by mean-field analysis and Monte Carlo simulations. We found that as we switch off one CA and switch on the other by the variation of the single parameter of the model, the probabilistic CA (PCA) goes through an extinction-survival-type phase transition, and the numerical data indicate that it belongs to the directed percolation universality class of critical behaviour. The PCA displays a characteristic stationary density profile and a slow, diffusive dynamics close to the pure CA 200 point that we discuss briefly. Remarks on an interesting related stochastic lattice gas are addressed in the conclusions.

Critical behavior of a contact process with aperiodic transition rates

We performed Monte Carlo simulations to investigate the steady-state critical behavior of a one-dimensional contact process with an aperiodic distribution of rates of transition. As in the presence of randomness, spatial fluctuations can lead to changes of critical behavior. For sufficiently weak fluctuations, we give numerical evidence to show that there is no departure from the universal critical behavior of the underlying uniform model. For strong spatial fluctuations, the analysis of the data indicates a change of critical universality class.

Evolutionary modeling of larval dispersal in blowflies using non-uniform cellular automata

When the food supply flnishes, or when the larvae of blowflies complete their development and migrate prior to the total removal of the larval substrate, they disperse to find adequate places for pupation, a process known as post-feeding larval dispersal. Based on experimental data of the Initial and final configuration of the dispersion, the reproduction of such spatio-temporal behavior is achieved here by means of the evolutionary search for cellular automata with a distinct transition rule associated with each cell, also known as a nonuniform cellular automata, and with two states per cell in the lattice. Two-dimensional regular lattices and multivalued states will be considered and a practical question is the necessity of discovering a proper set of transition rules. Given that the number of rules is related to the number of cells in the lattice, the search space is very large and an evolution strategy is then considered to optimize the parameters of the transition rules, with two transition rules per cell. As the parameters to be optimized admit a physical interpretation, the obtained computational model can be analyzed to raise some hypothetical explanation of the observed spatiotemporal behavior. © 2006 IEEE.

Digital system design process automation using place/transition petri nets

The constant increase in digital systems complexity definitely demands the automation of the corresponding synthesis process. This paper presents a computational environment designed to produce both software and hardware implementations of a system. The tool for code generation has been named ACG8051. As for the hardware synthesis there has been produced a larger environment consisting of four programs, namely: PIPE2TAB, AGPS, TABELA, and TAB2VHDL. ACG8051 and PIPE2TAB use place/transition net descriptions from PIPE as inputs. ACG8051 is aimed at generating assembly code for the 8051 micro-controller. PIPE2TAB produces a tabular version of a Mealy type finite state machine of the system, its output is fed into AGPS that is used for state allocation. The resulting digital system is then input to TABELA, which minimizes control functions and outputs of the digital system. Finally, the output generated by TABELA is fed to TAB2VHDL that produces a VHDL description of the system at the register transfer level. Thus, we present here a set of tools designed to take a high-level description of a digital system, represented by a place/transition net, and produces as output both an assembly code that can be immediately run on an 8051 micro-controller, and a VHDL description that can be used to directly implement the hardware parts either on an FPGA or as an ASIC.

[Transition - how adolescents with cystic fibrosis their parents experience the change from paediatric to adult care].

BACKGROUND Cystic Fibrosis is the most common autosomal-recessive hereditary disease among white Europeans. The average survival of CF patients has increased to above 40 years and transition from paediatric to adult care has therefore become a significant issue. AIM With this study, experiences of adolescents with CF and their parents with the transition from the paediatric to the adult care were explored. METHODS At a Swiss university CF centre, six adolescents and their mothers were recruited. Twelve narrative interviews were conducted on how the phase of transition was experienced. The transcribed interviews were analysed according to the method of hermeneutic phenomenology. RESULTS Positive and negative experiences with long term routine care in the paediatric service, general themes of adolescence and the quality of the relationship with paediatric doctors influenced the families' experience during transition significantly. For mothers, insensitive information on the CF diagnosis might have influenced the transition experience. The adolescents welcomed an individualized and age appropriate care. Continuity in care, the announcement of, and involvement in the planning of the transfer were of great importance. The families particularly appreciated the timed adaptations of the transfer to individual needs. CONCLUSIONS Flexibility and a strong collaboration between paediatric and adult CF teams are most relevant in the care of families.

Cryptographic properties of Boolean functions defining elementary cellular automata

In this work, the algebraic properties of the local transition functions of elementary cellular automata (ECA) were analysed. Specifically, a classification of such cellular automata was done according to their algebraic degree, the balancedness, the resiliency, nonlinearity, the propagation criterion and the existence of non-zero linear structures. It is shown that there is not any ECA satisfying all properties at the same time.

Accelerating precursory activity within a class of earthquake analogue automata

A statistical fractal automaton model is described which displays two modes of dynamical behaviour. The first mode, termed recurrent criticality, is characterised by quasi-periodic, characteristic events that are preceded by accelerating precursory activity. The second mode is more reminiscent of SOC automata in which large events are not preceded by an acceleration in activity. Extending upon previous studies of statistical fractal automata, a redistribution law is introduced which incorporates two model parameters: a dissipation factor and a stress transfer ratio. Results from a parameter space investigation indicate that a straight line through parameter space marks a transition from recurrent criticality to unpredictable dynamics. Recurrent criticality only occurs for models within one corner of the parameter space. The location of the transition displays a simple dependence upon the fractal correlation dimension of the cell strength distribution. Analysis of stress field evolution indicates that recurrent criticality occurs in models with significant long-range stress correlations. A constant rate of activity is associated with a decorrelated stress field.

On OBDD Transformations Representing Finite State Automata

We present OBDD transformation problem representing finite labeled transition systems corresponding to some congruence relation. Transformations are oriented toward obtaining the OBDD of a minimized transition system for this congruence relation.

Determinization of timed Petri nets behaviors

International audience

Supervisory control of (max,+) automata: extensions towards applications

International audience