Reachability Verification for Hybrid Automata (original) (raw)

Profile image of vlad rusuvlad rusu

1998

visibility

description

15 pages

link

1 file

Sign up for access to the world's latest research.

checkGet notified about relevant papers

checkSave papers to use in your research

checkJoin the discussion with peers

checkTrack your impact

Hybrid automata: from verification to implementation

Sergiy Bogomolov

International Journal on Software Tools for Technology Transfer, 2017

View PDFchevron_right

Reachability Analysis of Lazy Linear Hybrid Automata

Susmit Jha

2011

View PDFchevron_right

Constraints for Continuous Reachability in the Verification of Hybrid Systems

Tetsuo Ida

Artificial Intelligence and Symbolic Computation, 2006

View PDFchevron_right

2-Asynchronous automata

Robert Cori

Theoretical Computer Science, 1988

View PDFchevron_right

Approaches to the Formal Verification of Hybrid Systems

S. Engell

at - Automatisierungstechnik, 2001

View PDFchevron_right

Timed Automata Approach to Distributed and Fault Tolerant System Verification

Zdeněk Hanzálek

2005

View PDFchevron_right

Requirements Validation for Hybrid Systems

Alessandro Cimatti

Lecture Notes in Computer Science, 2009

View PDFchevron_right

A computable and compositional semantics for hybrid automata

Luca Geretti

Proceedings of the 23rd International Conference on Hybrid Systems: Computation and Control, 2020

View PDFchevron_right

Fresh-variable automata for service composition

Yannick Chevalier

View PDFchevron_right

Modeling, specification, and verification of automaton programs

Valery Sokolov

Programming and Computer Software

View PDFchevron_right

Loading...

Loading Preview

Sorry, preview is currently unavailable. You can download the paper by clicking the button above.

A Compositional Approach to the Verification of Hybrid Systems

Lacramioara Astefanoaei

Lecture Notes in Computer Science, 2016

View PDFchevron_right

Efficient Dynamic Error Reduction for Hybrid Systems Reachability Analysis

Erika Abraham

Lecture Notes in Computer Science, 2018

View PDFchevron_right

Ensuring Reachability by Design

Benoit Caillaud

Lecture Notes in Computer Science, 2012

View PDFchevron_right

Abstractions for hybrid systems

Ashish Tiwari

Formal Methods in System Design, 2007

View PDFchevron_right

Efficient Scenario Verification for Hybrid Automata

S. Tonetta

Lecture Notes in Computer Science, 2011

View PDFchevron_right

Regular processes and timed automata

Pedro Dargenio

Lecture Notes in Computer Science, 1997

View PDFchevron_right

On the Specification of Higher Dimensional Automata

Johnson Dominic

Electronic Notes in Theoretical Computer Science, 2002

View PDFchevron_right

Composing hybrid systems

Alberto Sangiovanni Vincentelli

2008 47th IEEE Conference on Decision and Control, 2008

View PDFchevron_right

Limited-time lookahead diagnosability of rectangular hybrid automata

Derbel Haithem

3rd IFAC Conference on Analysis and Design of Hybrid Systems (2009), 2009

View PDFchevron_right

Comparing Two Approaches to Include Stochasticity in Hybrid Automata

Erika Abraham

arXiv (Cornell University), 2023

View PDFchevron_right

Process algebras for hybrid systems : comparison and development

Uzma Khadim

2008

View PDFchevron_right

Parametrized automata simulation and application to service composition

Yannick Chevalier, Michael Rusinowitch

Journal of Symbolic Computation, 2015

View PDFchevron_right

Diagnosis of hybrid systems through bond graph, observers and timed automata

Kechida Sihem

Diagnostyka

View PDFchevron_right

Hybrid Systems IV

Panos Antsaklis

Lecture Notes in Computer Science, 1997

View PDFchevron_right

Efficient proof engines for bounded model checking of hybrid systems

Martin Fränzle

Electronic Notes in Theoretical Computer Science, 2005

View PDFchevron_right

Maximizing Reachability Probabilities in Rectangular Automata with Random Clocks

Erika Abraham

arXiv (Cornell University), 2023

View PDFchevron_right

Gate automata-driven run-time enforcement

Gabriele Costa

Computers & Mathematics with Applications, 2012

View PDFchevron_right

Certifying a Tree Automata Completion Checker

Thomas Genet

Automated Reasoning

View PDFchevron_right

Ariadne: a framework for reachability analysis of hybrid automata

Alberto Sangiovanni Vincentelli

2006

View PDFchevron_right

Distributing automata for asynchronous networks of processors

Benoit Caillaud

1994

View PDFchevron_right

On the Transition Reduction Problem for Finite Automata

houcein el Abdalaoui

Fundamenta Informaticae, 2014

View PDFchevron_right

Verification of Open Systems

Moshe Vardi

Interactive Computation

View PDFchevron_right

Pure reaction automata

Francesco Leiter

Natural computing, 2024

View PDFchevron_right

The fundamentals of hybrid systems modelers

Benoit Caillaud

49th IEEE Conference on Decision and Control (CDC), 2010

View PDFchevron_right

Temporal hybridity

Mark Perry

Proceedings of the 28th international conference on Human factors in computing systems - CHI '10, 2010

View PDFchevron_right

Hybrid SystemsSymbolic ExecutionHybrid Automata