Symbolic Reachability Analysis of B through ProB and LTSmin

We present a symbolic reachability analysis approach for B that can provide a significant speedup over traditional explicit state model checking. The symbolic analysis is implemented by linking ProB to LTSmin, a high-performance language independent model checker. The link is achieved via LTSmin's PINS interface, allowing ProB to benefit from LTSmin's analysis algorithms, while only writing a few hundred lines of glue-code, along with a bridge between ProB and C using ZeroMQ. ProB supports model checking of several formal specification languages such as B, Event-B, Z and TLA. Our experiments are based on a wide variety of B-Method and Event-B models to demonstrate the efficiency of the new link. Among the tested categories are state space generation and deadlock detection; but action detection and invariant checking are also feasible in principle. In many cases we observe speedups of several orders of magnitude. We also compare the results with other approaches for improving model checking, such as partial order reduction or symmetry reduction. We thus provide a new scalable, symbolic analysis algorithm for the B-Method and Event-B, along with a platform to integrate other model checking improvements via LTSmin in the future

Study of the degradation profile for virgin linear low-density polyethylene (LLDPE) and polyolefin (PO) plastic waste blends

In this study, the properties of virgin linear low-density polyethylene (LLDPE) and its blends with reclaimed plastic solid waste (PSW) are investigated by thermogravimetry, differential scanning calorimetry (DSC), infrared spectroscopy and scanning electron microscopy (SEM). The PSW constituted polyolefin (PO) polymers recycled mechanically via extrusion/blown-film and exposed to accelerated weathering tests to determine the change in their degradation behaviour. The oxidation products determined using the FTIR analysis and thermal stability studies points toward the blend constituting 25% of waste by weight as the most stable. Changes in crystallinity of the polymers were attributed to the crystal size change as a consequence of the weathering mechanism. The DSC results revealed that both oxidation induction temperature (OIT) and crystallinity were affected by the PO waste content. This points towards the impact of polymers immiscibility and polydispersity within the matrix of the blends due to chain scission reaction and oxidation with the UV exposure

ParaPlan: A Tool for Parallel Reachability Analysis of Planar Polygonal Differential Inclusion Systems

Andrei Sandler, and Olga Tveretina, ‘ParaPlan: A Tool for Parallel Reachability Analysis of Planar Polygonal Differential Inclusion Systems’, in Patricia Bouyer, Andrea Orlandini and Pierluigi San Pietro, eds. Proceedings Eight International Symposium on Games, Automata, Logics and Formal Verification (GandALF 2017), Rome, Italy, 20-22 September 2017, Electronic Proceedings in Theoretical Computer Science, Vol. 256: 283-296, September 2017. © 2017 The Author(s). This work is licensed under the Creative Commons Attribution License CC BY 4.0 https://creativecommons.org/licenses/by/4.0/We present the ParaPlan tool which provides the reachability analysis of planar hybrid systems defined by differential inclusions (SPDI). It uses the parallelized and optimized version of the algorithm underlying the SPeeDI tool. The performance comparison demonstrates the speed-up of up to 83 times with respect to the sequential implementation on various benchmarks. Some of the benchmarks we used are randomly generated with the novel approach based on the partitioning of the plane with Voronoi diagrams

A Metric Encoding for Bounded Model Checking (extended version)

In Bounded Model Checking both the system model and the checked property are translated into a Boolean formula to be analyzed by a SAT-solver. We introduce a new encoding technique which is particularly optimized for managing quantitative future and past metric temporal operators, typically found in properties of hard real time systems. The encoding is simple and intuitive in principle, but it is made more complex by the presence, typical of the Bounded Model Checking technique, of backward and forward loops used to represent an ultimately periodic infinite domain by a finite structure. We report and comment on the new encoding technique and on an extensive set of experiments carried out to assess its feasibility and effectiveness

Performance Guarantees for Distributed Reachability Queries

In the real world a graph is often fragmented and distributed across different sites. This highlights the need for evaluating queries on distributed graphs. This paper proposes distributed evaluation algorithms for three classes of queries: reachability for determining whether one node can reach another, bounded reachability for deciding whether there exists a path of a bounded length between a pair of nodes, and regular reachability for checking whether there exists a path connecting two nodes such that the node labels on the path form a string in a given regular expression. We develop these algorithms based on partial evaluation, to explore parallel computation. When evaluating a query Q on a distributed graph G, we show that these algorithms possess the following performance guarantees, no matter how G is fragmented and distributed: (1) each site is visited only once; (2) the total network traffic is determined by the size of Q and the fragmentation of G, independent of the size of G; and (3) the response time is decided by the largest fragment of G rather than the entire G. In addition, we show that these algorithms can be readily implemented in the MapReduce framework. Using synthetic and real-life data, we experimentally verify that these algorithms are scalable on large graphs, regardless of how the graphs are distributed.Comment: VLDB201

Biochar Synthesis from Mineral- and Ash-Rich Waste Biomass, Part 1: Investigation of Thermal Decomposition Mechanism during Slow Pyrolysis

Synthesizing biochar from mineral- and ash-rich waste biomass (MWB), a by-product of human activities in urban areas, can result in renewable and versatile multi-functional materials, which can also cater to the need of solid waste management. Hybridizing biochar with minerals, silicates, and metals is widely investigated to improve parent functionalities. MWB intrinsically possesses such foreign materials. The pyrolysis of such MWB is kinetically complex and requires detailed investigation. Using TGA-FTIR, this study investigates and compares the kinetics and decomposition mechanism during pyrolysis of three types of MWB: (i) mineral-rich banana peduncle (BP), (ii) ash-rich sewage sludge (SS), and (iii) mineral and ash-rich anaerobic digestate (AD). The results show that the pyrolysis of BP, SS, and AD is exothermic, catalyzed by its mineral content, with heat of pyrolysis 5480, 4066, and 1286 kJ/kg, respectively. The pyrolysis favors char formation kinetics mainly releasing CO2 and H2O. The secondary tar reactions initiate from ≈318 °C (BP), 481 °C (SS), and 376 °C (AD). Moreover, negative apparent activation energies are intrinsic to their kinetics after 313 °C (BP), 448 °C (SS), and 339 °C (AD). The results can support in tailoring and controlling sustainable biochar synthesis from slow pyrolysis of MWB

UTP, Circus, and Isabelle

We dedicate this paper with great respect and friendship to He Jifeng on the occasion of his 80th birthday. Our research group owes much to him. The authors have over 150 publications on unifying theories of programming (UTP), a research topic Jifeng created with Tony Hoare. Our objective is to recount the history of Circus (a combination of Z, CSP, Dijkstra’s guarded command language, and Morgan’s refinement calculus) and the development of Isabelle/UTP. Our paper is in two parts. (1) We first discuss the activities needed to model systems: we need to formalise data models and their behaviours. We survey our work on these two aspects in the context of Circus. (2) Secondly, we describe our practical implementation of UTP in Isabelle/HOL. Mechanising UTP theories is the basis of novel verification tools. We also discuss ongoing and future work related to (1) and (2). Many colleagues have contributed to these works, and we acknowledge their support

Introduction to Runtime Verification

International audienceThe aim of this chapter is to act as a primer for those wanting to learn about Runtime Verification (RV). We start by providing an overview of the main specification languages used for RV. We then introduce the standard terminology necessary to describe the monitoring problem, covering the pragmatic issues of monitoring and instrumentation, and discussing extensively the monitorability problem