23,598 research outputs found
Hybrid automata dicretising agents for formal modelling of robots
Some of the fundamental capabilities required by autonomous vehicles and systems for their intelligent decision making are: modelling of the environment and forming data abstractions for symbolic, logic based reasoning. The paper formulates a discrete agent framework that abstracts and controls a hybrid system that is a composition of hybrid automata modelled continuous individual processes. Theoretical foundations are laid down for a class of general model composition agents (MCAs) with an advanced subclass of rational physical agents (RPAs). We define MCAs as the most basic structures for the description of complex autonomous robotic systems. The RPAās have logic based decision making that is obtained by an extension of the hybrid systems concepts using a set of abstractions. The theory presented helps the creation of robots with reliable performance and safe operation in their environment. The paper emphasizes the abstraction aspects of the overall hybrid system that emerges from parallel composition of sets of RPAs and MCAs
Hybrid automata as coalgebras
Publicado em "Theoretical aspects of computing - ICTAC 2016: 13th International Colloquium, Taipei, Taiwan, ROC, October 24ā31, 2016, Proceedings". ISBN 978-3-319-46749-8Able to simultaneously encode discrete transitions and continuous
behaviour, hybrid automata are the de facto framework for the
formal specification and analysis of hybrid systems. The current paper
revisits hybrid automata from a coalgebraic point of view. This allows to
interpret them as state-based components, and provides a uniform theory
to address variability in their definition, as well as the corresponding
notions of behaviour, bisimulation, and observational semantics.FCT grants SFRH/BD/52234/2013, SFRH/BSAB/ 113890/2015ERDF - European Regional Development Fund, through the COMPETE Programme, and by National Funds through FCT within project PTDC/EEI-CTP/4836/201
Reachability computation for hybrid systems with Ariadne
Ariadne is an in-progress open environment to design algorithms for computing with hybrid automata, that relies on a rigorous computable analysis theory to represent
geometric objects, in order to achieve provable approximation bounds along the computations. In this paper we discuss the problem of reachability analysis of hybrid automata to decide safety properties. We describe in details the algorithm used in Ariadne to compute over-approximations of reachable sets. Then we show how it works on a simple example. Finally, we discuss the lower-approximation approach to the reachability problem and how to extend
Ariadne to support it
Languages and models for hybrid automata: A coalgebraic perspective
article in pressWe study hybrid automata from a coalgebraic point of view. We show that such a perspective supports a generic theory of hybrid automata with a rich palette of definitions and results. This includes, among other things, notions of bisimulation and behaviour, state minimisation techniques, and regular expression languages.POCI-01-0145-FEDER-016692. RDF ā European Regional Development Fund through the Operational Programme for Competitiveness and Internationalisation ā COMPETE 2020 Programme and by National Funds through the Portuguese funding agency, FCT ā FundaĆ§Ć£o para a CiĆŖncia e a Tecnologia within project POCI-01-0145-FEDER-016692 and by the PT-FLAD Chair on Smart Cities & Smart Governance at Universidade do Minh
Mathematics in Software Reliability and Quality Assurance
This monograph concerns the mathematical aspects of software reliability and quality assurance and consists of 11 technical papers in this emerging area. Included are the latest research results related to formal methods and design, automatic software testing, software verification and validation, coalgebra theory, automata theory, hybrid system and software reliability modeling and assessment
Approximated Symbolic Computations over Hybrid Automata
Hybrid automata are a natural framework for modeling and analyzing systems
which exhibit a mixed discrete continuous behaviour. However, the standard
operational semantics defined over such models implicitly assume perfect
knowledge of the real systems and infinite precision measurements. Such
assumptions are not only unrealistic, but often lead to the construction of
misleading models. For these reasons we believe that it is necessary to
introduce more flexible semantics able to manage with noise, partial
information, and finite precision instruments. In particular, in this paper we
integrate in a single framework based on approximated semantics different over
and under-approximation techniques for hybrid automata. Our framework allows to
both compare, mix, and generalize such techniques obtaining different
approximated reachability algorithms.Comment: In Proceedings HAS 2013, arXiv:1308.490
- ā¦