312,549 research outputs found
Towards Certification of Machine Learning-Based Distributed Systems
Machine Learning (ML) is increasingly used to drive the operation of complex
distributed systems deployed on the cloud-edge continuum enabled by 5G.
Correspondingly, distributed systems' behavior is becoming more
non-deterministic in nature. This evolution of distributed systems requires the
definition of new assurance approaches for the verification of non-functional
properties. Certification, the most popular assurance technique for system and
software verification, is not immediately applicable to systems whose behavior
is determined by Machine Learning-based inference. However, there is an
increasing push from policy makers, regulators, and industrial stakeholders
towards the definition of techniques for the certification of non-functional
properties (e.g., fairness, robustness, privacy) of ML. This article analyzes
the challenges and deficiencies of current certification schemes, discusses
open research issues and proposes a first certification scheme for ML-based
distributed systems.Comment: 5 pages, 1 figure, 1 tabl
Computer Aided Verification
The open access two-volume set LNCS 11561 and 11562 constitutes the refereed proceedings of the 31st International Conference on Computer Aided Verification, CAV 2019, held in New York City, USA, in July 2019. The 52 full papers presented together with 13 tool papers and 2 case studies, were carefully reviewed and selected from 258 submissions. The papers were organized in the following topical sections: Part I: automata and timed systems; security and hyperproperties; synthesis; model checking; cyber-physical systems and machine learning; probabilistic systems, runtime techniques; dynamical, hybrid, and reactive systems; Part II: logics, decision procedures; and solvers; numerical programs; verification; distributed systems and networks; verification and invariants; and concurrency
Computer Aided Verification
This open access two-volume set LNCS 11561 and 11562 constitutes the refereed proceedings of the 31st International Conference on Computer Aided Verification, CAV 2019, held in New York City, USA, in July 2019. The 52 full papers presented together with 13 tool papers and 2 case studies, were carefully reviewed and selected from 258 submissions. The papers were organized in the following topical sections: Part I: automata and timed systems; security and hyperproperties; synthesis; model checking; cyber-physical systems and machine learning; probabilistic systems, runtime techniques; dynamical, hybrid, and reactive systems; Part II: logics, decision procedures; and solvers; numerical programs; verification; distributed systems and networks; verification and invariants; and concurrency
Computer Aided Verification
This open access two-volume set LNCS 10980 and 10981 constitutes the refereed proceedings of the 30th International Conference on Computer Aided Verification, CAV 2018, held in Oxford, UK, in July 2018. The 52 full and 13 tool papers presented together with 3 invited papers and 2 tutorials were carefully reviewed and selected from 215 submissions. The papers cover a wide range of topics and techniques, from algorithmic and logical foundations of verification to practical applications in distributed, networked, cyber-physical, and autonomous systems. They are organized in topical sections on model checking, program analysis using polyhedra, synthesis, learning, runtime verification, hybrid and timed systems, tools, probabilistic systems, static analysis, theory and security, SAT, SMT and decisions procedures, concurrency, and CPS, hardware, industrial applications
Computer Aided Verification
The open access two-volume set LNCS 11561 and 11562 constitutes the refereed proceedings of the 31st International Conference on Computer Aided Verification, CAV 2019, held in New York City, USA, in July 2019. The 52 full papers presented together with 13 tool papers and 2 case studies, were carefully reviewed and selected from 258 submissions. The papers were organized in the following topical sections: Part I: automata and timed systems; security and hyperproperties; synthesis; model checking; cyber-physical systems and machine learning; probabilistic systems, runtime techniques; dynamical, hybrid, and reactive systems; Part II: logics, decision procedures; and solvers; numerical programs; verification; distributed systems and networks; verification and invariants; and concurrency
Computer Aided Verification
This open access two-volume set LNCS 11561 and 11562 constitutes the refereed proceedings of the 31st International Conference on Computer Aided Verification, CAV 2019, held in New York City, USA, in July 2019. The 52 full papers presented together with 13 tool papers and 2 case studies, were carefully reviewed and selected from 258 submissions. The papers were organized in the following topical sections: Part I: automata and timed systems; security and hyperproperties; synthesis; model checking; cyber-physical systems and machine learning; probabilistic systems, runtime techniques; dynamical, hybrid, and reactive systems; Part II: logics, decision procedures; and solvers; numerical programs; verification; distributed systems and networks; verification and invariants; and concurrency
Tools and Algorithms for the Construction and Analysis of Systems
This book is Open Access under a CC BY licence. The LNCS 11427 and 11428 proceedings set constitutes the proceedings of the 25th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2019, which took place in Prague, Czech Republic, in April 2019, held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2019. The total of 42 full and 8 short tool demo papers presented in these volumes was carefully reviewed and selected from 164 submissions. The papers are organized in topical sections as follows: Part I: SAT and SMT, SAT solving and theorem proving; verification and analysis; model checking; tool demo; and machine learning. Part II: concurrent and distributed systems; monitoring and runtime verification; hybrid and stochastic systems; synthesis; symbolic verification; and safety and fault-tolerant systems
On the minimum exit rate for a diffusion process pertaining to a chain of distributed control systems with random perturbations
In this paper, we consider the problem of minimizing the exit rate with which
a diffusion process pertaining to a chain of distributed control systems, with
random perturbations, exits from a given bounded open domain. In particular, we
consider a chain of distributed control systems that are formed by
subsystems (with ), where the random perturbation enters only in the
first subsystem and is then subsequently transmitted to the other subsystems.
Furthermore, we assume that, for any , the
distributed control systems, which is formed by the first subsystems,
satisfies an appropriate H\"ormander condition. As a result of this, the
diffusion process is degenerate, in the sense that the infinitesimal generator
associated with it is a degenerate parabolic equation. Our interest is to
establish a connection between the minimum exit rate with which the diffusion
process exits from the given domain and the principal eigenvalue for the
infinitesimal generator with zero boundary conditions. Such a connection allows
us to derive a family of Hamilton-Jacobi-Bellman equations for which we provide
a verification theorem that shows the validity of the corresponding optimal
control problems. Finally, we provide an estimate on the attainable exit
probability of the diffusion process with respect to a set of admissible
(optimal) Markov controls for the optimal control problems.Comment: 12 Pages. (Additional Note: This work is, in some sense, a
continuation of our previous paper arXiv:1408.6260.
Computer Aided Verification
This open access two-volume set LNCS 10980 and 10981 constitutes the refereed proceedings of the 30th International Conference on Computer Aided Verification, CAV 2018, held in Oxford, UK, in July 2018. The 52 full and 13 tool papers presented together with 3 invited papers and 2 tutorials were carefully reviewed and selected from 215 submissions. The papers cover a wide range of topics and techniques, from algorithmic and logical foundations of verification to practical applications in distributed, networked, cyber-physical, and autonomous systems. They are organized in topical sections on model checking, program analysis using polyhedra, synthesis, learning, runtime verification, hybrid and timed systems, tools, probabilistic systems, static analysis, theory and security, SAT, SMT and decisions procedures, concurrency, and CPS, hardware, industrial applications
- β¦