• Non ci sono risultati.

Automi Ibridi

N/A
N/A
Protected

Academic year: 2021

Condividi "Automi Ibridi"

Copied!
10
0
0

Testo completo

(1)

Automi Ibridi

Carla Piazza1

1Dipartimento di Matematica ed Informatica Universit `a di Udine

carla.piazza@dimi.uniud.it

(2)

Indice del Corso (Dis)Ordinato

Automi Ibridi: Sintassi e Semantica Sistemi a stati finiti(breve ripasso) Il problema dellaRaggiungibilit `a Risultati diIndecidibilit `a

Classi notevoli di Automi Ibridi:timed, rectangular, o-minimal, . . . Tecniche di Decisione: (Bi)Simulazione, Cylindric Algebraic Decomposition, Teoremi di Selezione,Semantiche approssimate Equazioni Differenziali

. . . e tanto altro:

Logiche temporali Composizione di Automi Il caso Stocastico

Stabilit `a, Osservabilit `a, Controllabilit `a Strumenti Software

Applicazioni

(3)

Charon

A language for modular specification of interacting hybrid systems based on the notions of agent and mode.

Alur, Esposito, Fierro, Grosu, Hur, Ivancic, et al.

UPenn, SunySB, NEC.

R. Alur et al. “Hybrid Modeling of Biomolecular Networks.”, HSCC 2001.

(4)

Checkmate

A MATLAB-based tool for modeling, simulating, and verifying properties of hybrid dynamic systems.

Chutinan, Fehnker, Han, Kapinski, Kumar, Krogh, et al.

CMU.

Silva and Krogh “Formal verification of hybrid systems using CheckMate: a case study.”, ACC 2000.

(5)

d/dt

A tool for reachability analysis of continuous and hybrid systems with linear differential inclusions. The

approximation of reachable states is based on numerical integration and polyhedral approximation.

Dang, Maler.

VERIMAG.

Asarin et al. “Approximate Reachability Analysis of Piecewise Linear Dynamical Systems”, HSCC 2000.

(6)

HSolver

A program for verification of hybrid systems based on the constraint solver RSOLVER.

Ratchan, She.

Max-Planck-Institut.

Ratschan and She. “Safety verification of hybrid systems by constraint propagation based abstraction refinement”, ACM Transactions on Embedded Computing Systems, 2007.

Si veda anche: Campagna and Piazza. “Hybrid Automata, Reachability and Systems Biology.” TCS 2010.

(7)

HyTech

It computes the condition under which a linear hybrid system satisfies a temporal requirement.

Henzinger.

Berkeley.

Henzinger, Ho, and Wong-Toi. “HyTech: A Model Checker for Hybrid Systems.” Software Tools for Technology Transfer, 1997.

(8)

KeYmaera

A hybrid verification tool for hybrid systems that combines deductive, real algebraic, and computer algebraic prover technologies.

Platzer, Quesel, R ¨ummer.

CMU.

Platzer. “Logic and compositional verification of hybrid systems.” CAV 2011.

(9)

Matisse

A free MATLAB toolbox for safety verification and reachable set computation of large dimensional, constrained linear systems.

Girard, Julius, Pappas.

UPenn.

Girard and Pappas. “Approximation Metrics for Discrete and Continuous Systems.” IEEE Transactions on Automatic Control, 2005.

(10)

Ariadne

A C++ package for set-based analysis of dynamical and control systems, including reachability analysis, robust simulation and safety verification.

Balluchi, Casagrande, Collins, Ferrari, Villa, Sangiovanni-Vincentelli, et al.

Udine, Parades, CWI, Verona

Balluchi, Casagrande, Collins, Ferrari, Villa,

Sangiovanni-Vincentelli, “Ariadne: a Framework for Reachability Analysis of Hybrid Automata”, MNTS 2006.

Riferimenti

Documenti correlati

Tali sistemi vengono detti hybrid systems e possono essere modellati attraverso hybrid automata... Esempio:

Ci possono essere archi che portano in locazioni distinte ma che condividono parzialmente le activation. Le attivazioni non sono necessariamente sulle frontiere

A mathematical model is a formal model whose primary semantics is denotational; that is, the model describes by equations a relationship between quantities and how they change

in un campo vettoriale la direzione e l’intensit `a della derivata dipende dal punto, ma non dal tempo, quindi si tratta di un’equazione autonoma..

IDA (Independent Dynamics hybrid Automata) consentono identity resets tra locazioni che hanno la stessa dinamica Possiamo ridurre il problema della raggiungibilit `a per FOCoRe e IDA

Using -semantics and assuming both bounded invariants and decidability for specification language, we have decidability of reachability problem for hybrid automata.

In this thesis we deal with two main questions concerning discrete-time polynomial dynamical systems: 1) the reachability computation problem, i.e, given a set of initial conditions

Distinguishing between transitions to instability due to a complex pair of eigenvalues or to a real eigenvalue crossing the imaginary axis, a complete characterisation is provided