Masterminding change by combining secure system design with security risk assessment

This track introduction presents the results of the Workshop on Security practices for Internet of Things, SPIoT held at ETAPS in Prague in April 2019. For this Special Issue of STTT, we have selected, invited and edited three distinguished papers. We briefly recall the aims, summarize the Workshop held in Prague and introduce the selected papers

Weighted Modal Transition Systems

Specification theories as a tool in model-driven development processes of component-based software systems have recently attracted a considerable attention. Current specification theories are however qualitative in nature, and therefore fragile in the sense that the inevitable approximation of systems by models, combined with the fundamental unpredictability of hardware platforms, makes it difficult to transfer conclusions about the behavior, based on models, to the actual system. Hence this approach is arguably unsuited for modern software systems. We propose here the first specification theory which allows to capture quantitative aspects during the refinement and implementation process, thus leveraging the problems of the qualitative setting. Our proposed quantitative specification framework uses weighted modal transition systems as a formal model of specifications. These are labeled transition systems with the additional feature that they can model optional behavior which may or may not be implemented by the system. Satisfaction and refinement is lifted from the well-known qualitative to our quantitative setting, by introducing a notion of distances between weighted modal transition systems. We show that quantitative versions of parallel composition as well as quotient (the dual to parallel composition) inherit the properties from the Boolean setting.Comment: Submitted to Formal Methods in System Desig

Vitual kitchen : A dual-modal virtual reality platform for (re)learning of everyday life cooking activites in Alzheimer’s disease

International audienc

Tropical Fourier-Motzkin elimination, with an application to real-time verification

We introduce a generalization of tropical polyhedra able to express both strict and non-strict inequalities. Such inequalities are handled by means of a semiring of germs (encoding infinitesimal perturbations). We develop a tropical analogue of Fourier-Motzkin elimination from which we derive geometrical properties of these polyhedra. In particular, we show that they coincide with the tropically convex union of (non-necessarily closed) cells that are convex both classically and tropically. We also prove that the redundant inequalities produced when performing successive elimination steps can be dynamically deleted by reduction to mean payoff game problems. As a complement, we provide a coarser (polynomial time) deletion procedure which is enough to arrive at a simply exponential bound for the total execution time. These algorithms are illustrated by an application to real-time systems (reachability analysis of timed automata).Comment: 29 pages, 8 figure

Computing Nash Equilibrium in Wireless Ad Hoc Networks: A Simulation-Based Approach

This paper studies the problem of computing Nash equilibrium in wireless networks modeled by Weighted Timed Automata. Such formalism comes together with a logic that can be used to describe complex features such as timed energy constraints. Our contribution is a method for solving this problem using Statistical Model Checking. The method has been implemented in UPPAAL model checker and has been applied to the analysis of Aloha CSMA/CD and IEEE 802.15.4 CSMA/CA protocols.Comment: In Proceedings IWIGP 2012, arXiv:1202.422

Statistical Model Checking for Stochastic Hybrid Systems

This paper presents novel extensions and applications of the UPPAAL-SMC model checker. The extensions allow for statistical model checking of stochastic hybrid systems. We show how our race-based stochastic semantics extends to networks of hybrid systems, and indicate the integration technique applied for implementing this semantics in the UPPAAL-SMC simulation engine. We report on two applications of the resulting tool-set coming from systems biology and energy aware buildings.Comment: In Proceedings HSB 2012, arXiv:1208.315

A Hierarchy of Scheduler Classes for Stochastic Automata

Stochastic automata are a formal compositional model for concurrent stochastic timed systems, with general distributions and non-deterministic choices. Measures of interest are defined over schedulers that resolve the nondeterminism. In this paper we investigate the power of various theoretically and practically motivated classes of schedulers, considering the classic complete-information view and a restriction to non-prophetic schedulers. We prove a hierarchy of scheduler classes w.r.t. unbounded probabilistic reachability. We find that, unlike Markovian formalisms, stochastic automata distinguish most classes even in this basic setting. Verification and strategy synthesis methods thus face a tradeoff between powerful and efficient classes. Using lightweight scheduler sampling, we explore this tradeoff and demonstrate the concept of a useful approximative verification technique for stochastic automata

Safe sets, network majority on weighted trees

Let G = (V, E) be a graph and let w : V → ℝ>0 be a positive weight function on the vertices of G. For every subset X of V, let w(X) ≔ ∑v∈Gw(v). A non-empty subset ∑ is a weighted safe set if, for every component C of the subgraph induced by S and every component D of G/S, we have w(C) ≥ w(D) whenever there is an edge between C and D. If the subgraph G(S) induced by a weighted safe set S is connected, then the set S is called a weighted connected safe set. In this article, we show that the problem of computing the minimum weight of a safe set is NP-hard for trees, even if the underlying tree is restricted to be a star, but it is polynomially solvable for paths. We also give an O(n log n) time 2-approximation algorithm for finding a weighted connected safe set with minimum weight in a weighted tree. Then, as a generalization of the concept of a minimum safe set, we define the concept of a parameterized infinite family of proper central subgraphs on weighted trees, whose polar ends are the vertex set of the tree and the centroid points. We show that each of these central subgraphs includes a centroid point. © 2017 Wiley Periodicals, Inc

Compared to conventional, ecological intensive management promotes beneficial proteolytic soil microbial communities for agro-ecosystem functioning under climate change-induced rain regimes

Projected climate change and rainfall variability will affect soil microbial communities, biogeochemical cycling and agriculture. Nitrogen (N) is the most limiting nutrient in agroecosystems and its cycling and availability is highly dependent on microbial driven processes. In agroecosystems, hydrolysis of organic nitrogen (N) is an important step in controlling soil N availability. We analyzed the effect of management (ecological intensive vs. conventional intensive) on N-cycling processes and involved microbial communities under climate change-induced rain regimes. Terrestrial model ecosystems originating from agroecosystems across Europe were subjected to four different rain regimes for 263 days. Using structural equation modelling we identified direct impacts of rain regimes on N-cycling processes, whereas N-related microbial communities were more resistant. In addition to rain regimes, management indirectly affected N-cycling processes via modifications of N-related microbial community composition. Ecological intensive management promoted a beneficial N-related microbial community composition involved in N-cycling processes under climate change-induced rain regimes. Exploratory analyses identified phosphorus-associated litter properties as possible drivers for the observed management effects on N-related microbial community composition. This work provides novel insights into mechanisms controlling agro-ecosystem functioning under climate change

Au-Ag template stripped pattern for scanning probe investigations of DNA arrays produced by Dip Pen Nanolithography

We report on DNA arrays produced by Dip Pen Nanolithography (DPN) on a novel Au-Ag micro patterned template stripped surface. DNA arrays have been investigated by atomic force microscopy (AFM) and scanning tunnelling microscopy (STM) showing that the patterned template stripped substrate enables easy retrieval of the DPN-functionalized zone with a standard optical microscope permitting a multi-instrument and multi-technique local detection and analysis. Moreover the smooth surface of the Au squares (abput 5-10 angstrom roughness) allows to be sensitive to the hybridization of the oligonucleotide array with label-free target DNA. Our Au-Ag substrates, combining the retrieving capabilities of the patterned surface with the smoothness of the template stripped technique, are candidates for the investigation of DPN nanostructures and for the development of label free detection methods for DNA nanoarrays based on the use of scanning probes.Comment: Langmuir (accepted