Theoretical Aspects of Computing (ICTAC 2011)

n/

Origin and justification of the use of the arrhenius relation to represent the reaction rate of the thermal decomposition of a solid

Degradation models are commonly used to describe the generation of combustible gases when predicting fire behavior. A model may include many sub-models, such as heat and mass transfer models, pyrolysis models or mechanical models. The pyrolysis sub-models require the definition of a decomposition mechanism and the associated reaction rates. Arrhenius-type equations are commonly used to quantify the reaction rates. Arrhenius-type equations allow the representation of chemical decomposition as a function of temperature. This representation of the reaction rate originated from the study of gas-phase reactions, but it has been extrapolated to liquid and solid decomposition. Its extension to solid degradation needs to be justified because using an Arrhenius-type formulation implies important simplifications that are potentially questionable. This study describes these simplifications and their potential consequences when it comes to the quantification of solid-phase reaction rates. Furthermore, a critical analysis of the existing thermal degradation models is presented to evaluate the implications of using an Arrhenius-type equation to quantify mass-loss rates and gaseous fuel production for fire predictions

Approximate Model Checking of Real-Time Systems for Linear Duration Invariants

Real-time systems are usually modelled with timed automata and real-time requirements relating to the state durations of the system are often specifiable using Linear Duration Invariants, which is a decidable subclass of Duration Calculus formulas. Various algorithms have been developed to check timed automata or real-time automata for linear duration invariants, but each needs complicated preprocessing and exponential calculation. To the best of our knowledge, these algorithms have not been implemented. In this paper, we present an approximate model checking technique based on a genetic algorithm to check real-time automata for linear durration invariants in reasonable times. Genetic algorithm is a good optimization method when a problem needs massive computation and it works particularly well in our case because the fitness function which is derived from the linear duration invariant is linear. ACM Computing Classification System (1998): D.2.4, C.3

Benchmarks for Parity Games (extended version)

We propose a benchmark suite for parity games that includes all benchmarks that have been used in the literature, and make it available online. We give an overview of the parity games, including a description of how they have been generated. We also describe structural properties of parity games, and using these properties we show that our benchmarks are representative. With this work we provide a starting point for further experimentation with parity games.Comment: The corresponding tool and benchmarks are available from https://github.com/jkeiren/paritygame-generator. This is an extended version of the paper that has been accepted for FSEN 201