Deposits of clastic carbonate-dominated (calciclastic) sedimentary slope systems in the rock record have been identified mostly as linearly-consistent carbonate apron deposits, even though most ancient clastic carbonate slope deposits fit the submarine fan systems better. Calciclastic submarine fans are consequently rarely described and are poorly understood. Subsequently, very little is known especially in mud-dominated calciclastic submarine fan systems. Presented in this study are a sedimentological core and petrographic characterisation of samples from eleven boreholes from the Lower Carboniferous of Bowland Basin (Northwest England) that reveals a >250 m thick calciturbidite complex deposited in a calciclastic submarine fan setting. Seven facies are recognised from core and thin section characterisation and are grouped into three carbonate turbidite sequences. They include: 1) Calciturbidites, comprising mostly of highto low-density, wavy-laminated bioclast-rich facies; 2) low-density densite mudstones which are characterised by planar laminated and unlaminated muddominated facies; and 3) Calcidebrites which are muddy or hyper-concentrated debrisflow deposits occurring as poorly-sorted, chaotic, mud-supported floatstones. These

Phd by thesis

ing WS1S Systems to Verify Parameterized Networks . . . . . . . . . . . . 188 Kai Baukus, Saddek Bensalem, Yassine Lakhnech and Karsten Stahl FMona: A Tool for Expressing Validation Techniques over Infinite State Systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 204 J.-P. Bodeveix and M. Filali Transitive Closures of Regular Relations for Verifying Infinite-State Systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 220 Bengt Jonsson and Marcus Nilsson Diagnostic and Test Generation Using Static Analysis to Improve Automatic Test Generation . . . . . . . . . . . . . 235 Marius Bozga, Jean-Claude Fernandez and Lucian Ghirvu Efficient Diagnostic Generation for Boolean Equation Systems . . . . . . . . . . . . 251 Radu Mateescu Efficient Model-Checking Compositional State Space Generation with Partial Order Reductions for Asynchronous Communicating Systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 266 Jean-Pierre Krimm and Laurent Mounier Checking for CFFD-Preorder with Tester Processes . . . . . . . . . . . . . . . . . . . . . . . 283 Juhana Helovuo and Antti Valmari Fair Bisimulation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 299 Thomas A. Henzinger and Sriram K. Rajamani Integrating Low Level Symmetries into Reachability Analysis . . . . . . . . . . . . . 315 Karsten Schmidt Model-Checking Tools Model Checking Support for the ASM High-Level Language . . . . . . . . . . . . . . 331 Giuseppe Del Castillo and Kirsten Winter Table of

Tools and Algorithms for the Construction and Analysis of Systems. Proc. TACAS 2009

http://user.it.uu.se/~jarst116/slides/week4.pdf

Graph-Based Algorithms for Boolean Function Manipulation

This paper reviews state-of-the-art empirical, hydrodynamic and simple conceptual models for determining flood inundation. It explores their advantages and limitations, highlights the most recent advances and discusses future directions. It addresses how uncertainty is analysed in this field with the various approaches and identifies opportunities for handling it better. The aim is to inform scientists new to the field, and help emergency response agencies, water resources managers, insurance companies and other decision makers keep up-to-date with the latest developments. Guidance is provided for selecting the most suitable method/model for solving practical flood related problems, taking into account the specific outputs required for the modelling purpose, the data available and computational demands. Multi-model, multi-discipline approaches are recommended in order to further advance this research field. This paper reviews state-of-the-art flood inundation models.It explores their advantages and limitations.It highlights the most recent advances and discusses future directions.It addresses how uncertainty is analysed and identifies opportunities for handling it better.

Flood inundation modelling

We consider turn-based stochastic games on infinite graphs induced by game probabilistic lossy channel systems (GPLCS), the game version of probabilistic lossy channel systems (PLCS). We study games with Buchi (repeated reachability) objectives and almost-sure winning conditions. These games are pure memoryless determined and, under the assumption that the target set is regular, a symbolic representation of the set of winning states for each player can be effectively constructed. Thus, turn-based stochastic games on GPLCS are decidable. This generalizes the decidability result for PLCS-induced Markov decision processes in [10].

/pdf/stochastic-games-with-lossy-channels-4lfbmxienp.pdf

Stochastic games with lossy channels

Probabilistic ω-automata are variants of nondeterministic automata over infinite words where all choices are resolved by probabilistic distributions Acceptance of a run for an infinite input word can be defined using traditional acceptance criteria for ω-automata, such as Buchi, Rabin or Streett conditions The accepted language of a probabilistic ω-automata is then defined by imposing a constraint on the probability measure of the accepting runs In this paper, we study a series of fundamental properties of probabilistic ω-automata with three different language-semantics: (1) the probable semantics that requires positive acceptance probability, (2) the almost-sure semantics that requires acceptance with probability 1, and (3) the threshold semantics that relies on an additional parameter λ i r0,1l that specifies a lower probability bound for the acceptance probability We provide a comparison of probabilistic ω-automata under these three semantics and nondeterministic ω-automata concerning expressiveness and efficiency Furthermore, we address closure properties under the Boolean operators union, intersection and complementation and algorithmic aspects, such as checking emptiness or language containment

Probabilistic ω-automata

Consider a connected undirected graph G = (V, E), a subset of vertices C ⊆ V, and an integer r ≥ 1; for any vertex v ∈ V, let B r (v) denote the ball of radius r centered at v, i.e., the set of all vertices within distance r from v. If for all vertices v ∈ V (respectively, v ∈ V\C), the sets Br(v) ∩ C are all nonempty and different, then we call C an r-identifying code (respectively, an r-locating-dominating code). We study the smallest cardinalities or densities of these codes in chains (finite or infinite) and cycles.

Identifying and locating-dominating codes on chains and cycles

The oxidation of iron has been studied at low temperatures (between 260 and 500 °C) in dry air or air with 2 vol% H2O, in the framework of research on dry corrosion of nuclear waste containers during long-term interim storage. Pure iron is regarded as a model material for low-alloyed steel. Oxidation tests were performed in a thermobalance (up to 250 h) or in a laboratory furnace (up to 1000 h). The oxide scales formed were characterized using SEM-EDX, TEM, XRD, SIMS and EBSD techniques. The parabolic rate constants deduced from microbalance experiments were found to be in good agreement with the few existing values of the literature. The presence of water vapor in air was found to strongly influence the transitory stages of the kinetics. The entire structure of the oxide scale was composed of an internal duplex magnetite scale made of columnar grains and an external hematite scale made of equiaxed grains. 18O tracer experiments performed at 400 °C allowed to propose a growth mechanism of the scale.

/pdf/iron-oxidation-at-low-temperature-260-500-c-in-air-and-the-ib5le1521t.pdf

Iron Oxidation at Low Temperature (260-500 C) in Air and the Effect of Water Vapor

Probabilistic Buchi automata (PBA) are finite-state acceptors for infinite words where all choices are resolved by fixed distributions and where the accepted language is defined by the requirement that the measure of the accepting runs is positive. The main contribution of this paper is a complementation operator for PBA and a discussion on several algorithmic problems for PBA. All interesting problems, such as checking emptiness or equivalence for PBA or checking whether a finite transition system satisfies a PBA-specification, turn out to be undecidable. An important consequence of these results are several undecidability results for stochastic games with incomplete information, modelled by partially-observable Markov decision processes and ω-regular winning objectives. Furthermore, we discuss an alternative semantics for PBA where it is required that almost all runs for an accepted word are accepting, which turns out to be less powerful, but has a decidable emptiness problem.

/pdf/on-decision-problems-for-probabilistic-buchi-automata-1m9kx87z7k.pdf

On decision problems for probabilistic Büchi automata

This paper presents a spatial Global Sensitivity Analysis (GSA) approach in a 2D shallow water equations based High Resolution (HR) flood model. The aim of a spatial GSA is to produce sensitivity maps which are based on Sobol index estimations. Such an approach allows to rank the effects of uncertain HR topographic data input parameters on flood model output. The influence of the three following parameters has been studied: the measurement error, the level of details of above-ground elements representation and the spatial discretization resolution. To introduce uncertainty, a Probability Density Function and discrete spatial approach have been applied to generate 2,000 DEMs. Based on a 2D urban flood river event modelling, the produced sensitivity maps highlight the major influence of modeller choices compared to HR measurement errors when HR topographic data are used. The spatial variability of the ranking is enhnaced. Sobol index maps produced by a spatial GSA rank in space the weight of each uncertain parameter on the variability of output parameter of interest.The weight of the modeller choices, with respect to the influence of HR dataset accuracy is enhanced.Added value is for modeller to better understand limits of his model.Requirements and limits for this approach are related to subjectivity of choices and to computational cost.

Nathalie Bertrand

Papers

Probabilistic ω-automata

Identifying and locating-dominating codes on chains and cycles

Iron Oxidation at Low Temperature (260-500 C) in Air and the Effect of Water Vapor

On decision problems for probabilistic Büchi automata

Spatial Global Sensitivity Analysis of High Resolution classified topographic data use in 2D urban flood modelling