23,367 research outputs found
ON EQUIVALENCE OF LINEAR CONTROL SYSTEMS AND ITS USAGE TO VERIFICATION OF THE ADEQUACY OF DIFFERENT MODELS FOR A REAL DYNAMIC PROCESS
A problem of description of algebraic invariants for a linear control system thatdetermine its structure is considered. With the help of these invariants, the equivalence problem of two linear time-invariant control systems with respect to actions of some linear groups on the spaces of inputs, outputs, and states of these systems is solved. The invariants are used to establish the necessary equivalence conditions for two nonlinear systems of differential equations generalizing the well-known Hopfield neural network model. Finally, these conditions are applied to establish the adequacy of two neural network models designed to describe the behavior of a real dynamic process given by two different sets of time series
BeSpaceD: Towards a Tool Framework and Methodology for the Specification and Verification of Spatial Behavior of Distributed Software Component Systems
In this report, we present work towards a framework for modeling and checking
behavior of spatially distributed component systems. Design goals of our
framework are the ability to model spatial behavior in a component oriented,
simple and intuitive way, the possibility to automatically analyse and verify
systems and integration possibilities with other modeling and verification
tools. We present examples and the verification steps necessary to prove
properties such as range coverage or the absence of collisions between
components and technical details
Big Data in Critical Infrastructures Security Monitoring: Challenges and Opportunities
Critical Infrastructures (CIs), such as smart power grids, transport systems,
and financial infrastructures, are more and more vulnerable to cyber threats,
due to the adoption of commodity computing facilities. Despite the use of
several monitoring tools, recent attacks have proven that current defensive
mechanisms for CIs are not effective enough against most advanced threats. In
this paper we explore the idea of a framework leveraging multiple data sources
to improve protection capabilities of CIs. Challenges and opportunities are
discussed along three main research directions: i) use of distinct and
heterogeneous data sources, ii) monitoring with adaptive granularity, and iii)
attack modeling and runtime combination of multiple data analysis techniques.Comment: EDCC-2014, BIG4CIP-201
Directed Security Policies: A Stateful Network Implementation
Large systems are commonly internetworked. A security policy describes the
communication relationship between the networked entities. The security policy
defines rules, for example that A can connect to B, which results in a directed
graph. However, this policy is often implemented in the network, for example by
firewalls, such that A can establish a connection to B and all packets
belonging to established connections are allowed. This stateful implementation
is usually required for the network's functionality, but it introduces the
backflow from B to A, which might contradict the security policy. We derive
compliance criteria for a policy and its stateful implementation. In
particular, we provide a criterion to verify the lack of side effects in linear
time. Algorithms to automatically construct a stateful implementation of
security policy rules are presented, which narrows the gap between
formalization and real-world implementation. The solution scales to large
networks, which is confirmed by a large real-world case study. Its correctness
is guaranteed by the Isabelle/HOL theorem prover.Comment: In Proceedings ESSS 2014, arXiv:1405.055
Petri nets for systems and synthetic biology
We give a description of a Petri net-based framework for
modelling and analysing biochemical pathways, which uni¯es the qualita-
tive, stochastic and continuous paradigms. Each perspective adds its con-
tribution to the understanding of the system, thus the three approaches
do not compete, but complement each other. We illustrate our approach
by applying it to an extended model of the three stage cascade, which
forms the core of the ERK signal transduction pathway. Consequently
our focus is on transient behaviour analysis. We demonstrate how quali-
tative descriptions are abstractions over stochastic or continuous descrip-
tions, and show that the stochastic and continuous models approximate
each other. Although our framework is based on Petri nets, it can be
applied more widely to other formalisms which are used to model and
analyse biochemical networks
How to stop time stopping
Zeno-timelocks constitute a challenge for the formal verification of timed automata: they are difficult to detect, and the verification of most properties (e.g., safety) is only correct for timelock-free models. Some time ago, Tripakis proposed a syntactic check on the structure of timed automata: If a certain condition (called strong non-zenoness) is met by all the loops in a given automaton, then zeno-timelocks are guaranteed not to occur. Checking for strong non-zenoness is efficient, and compositional (if all components in a network of automata are strongly non-zeno, then the network is free from zeno-timelocks). Strong non-zenoness, however, is sufficient-only: There exist non-zeno specifications which are not strongly non-zeno. A TCTL formula is known that represents a sufficient-and-necessary condition for non-zenoness; unfortunately, this formula requires a demanding model-checking algorithm, and not all model-checkers are able to express it. In addition, this algorithm provides only limited diagnostic information. Here we propose a number of alternative solutions. First, we show that the compositional application of strong non-zenoness can be weakened: Some networks can be guaranteed to be free from Zeno-timelocks, even if not every component is strongly non-zeno. Secondly, we present new syntactic, sufficient-only conditions that complement strong non-zenoness. Finally, we describe a sufficient-and-necessary condition that only requires a simple form of reachability analysis. Furthermore, our conditions identify the cause of zeno-timelocks directly on the model, in the form of unsafe loops. We also comment on a tool that we have developed, which implements the syntactic checks on Uppaal models. The tool is also able to derive, from those unsafe loops in a given automaton (in general, an Uppaal model representing a product automaton of a given network), the reachability formulas that characterise the occurrence of zeno-timelocks. A modified version of the CSMA/CD protocol is used as a case-study
Exploring the randomness of Directed Acyclic Networks
The feed-forward relationship naturally observed in time-dependent processes
and in a diverse number of real systems -such as some food-webs and electronic
and neural wiring- can be described in terms of so-called directed acyclic
graphs (DAGs). An important ingredient of the analysis of such networks is a
proper comparison of their observed architecture against an ensemble of
randomized graphs, thereby quantifying the {\em randomness} of the real systems
with respect to suitable null models. This approximation is particularly
relevant when the finite size and/or large connectivity of real systems make
inadequate a comparison with the predictions obtained from the so-called {\em
configuration model}. In this paper we analyze four methods of DAG
randomization as defined by the desired combination of topological invariants
(directed and undirected degree sequence and component distributions) aimed to
be preserved. A highly ordered DAG, called \textit{snake}-graph and a
Erd\:os-R\'enyi DAG were used to validate the performance of the algorithms.
Finally, three real case studies, namely, the \textit{C. elegans} cell lineage
network, a PhD student-advisor network and the Milgram's citation network were
analyzed using each randomization method. Results show how the interpretation
of degree-degree relations in DAGs respect to their randomized ensembles depend
on the topological invariants imposed. In general, real DAGs provide disordered
values, lower than the expected by chance when the directedness of the links is
not preserved in the randomization process. Conversely, if the direction of the
links is conserved throughout the randomization process, disorder indicators
are close to the obtained from the null-model ensemble, although some
deviations are observed.Comment: 13 pages, 5 figures and 5 table
- …