Proceedings of the 23rd International Conference on Hybrid Systems: Computation and Control 2020
DOI: 10.1145/3365365.3382202
|View full text |Cite
|
Sign up to set email alerts
|

A computable and compositional semantics for hybrid automata

Abstract: published version features the final layout of the paper including the volume, issue and page numbers. Link to publication General rightsCopyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights.• Users may download and print one copy of any publication from the public portal for the purpose of … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
8
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
4
2
2

Relationship

1
7

Authors

Journals

citations
Cited by 13 publications
(8 citation statements)
references
References 36 publications
0
8
0
Order By: Relevance
“…Hybrid systems is a well-established version of computational dynamical systems theory [3] (another being timed process algebras [16] or more recently model interfaces [57]). Ames (as well as Tabuada et al to some extent [69]) did develop a categorical theory of hybrid systems [5], which could be used to relate or otherwise use results from the wellestablished formalism of hybrid systems in our proposed framework as future work, but also the opposite; potentially strengthening notions of composition [4,15] in hybrid systems from category theory.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…Hybrid systems is a well-established version of computational dynamical systems theory [3] (another being timed process algebras [16] or more recently model interfaces [57]). Ames (as well as Tabuada et al to some extent [69]) did develop a categorical theory of hybrid systems [5], which could be used to relate or otherwise use results from the wellestablished formalism of hybrid systems in our proposed framework as future work, but also the opposite; potentially strengthening notions of composition [4,15] in hybrid systems from category theory.…”
Section: Related Workmentioning
confidence: 99%
“…Recall that the image of a function is the subset of its codomain where all elements of the domain get mapped to, namely for an arbitrary : → , ( ) = { ∈ | ∃ ∈ such that ( ) = }. In the end, using the above constructions of the twostep process exhibited in (15), the explicit description of the resulting contract is precisely equation (8).…”
Section: A Nomenclaturementioning
confidence: 99%
“…In this section, we describe some of the existing Monte Carlo based SMC tools, focusing on those that are directly available to the academic community. There exist tools using simulation-based techniques, but whose output is not a statistical confidence interval, which are not included in our review, like: SyLVaaS [57], a Web-based software-as-a-service tool for System Level Formal Verification of CPSs; S-TaLiRo [58], which is a tool performing temporal logic falsification of properties over non-linear hybrid systems; Ariadne [59], which is a tool for the formal verification of CPSs, using reachability analysis for nonlinear hybrid automata; SpaceEx, a tool platform for reachability and safety verification of continuous and hybrid systems [60]; Symbolic PathFinder [61], a SMC tool implementing approximate algorithms for MDP.…”
Section: Statistical Model Checking Toolsmentioning
confidence: 99%
“…The formalism of hybrid automata is commonly used to define the composition of controller and environment along with the semantics for its behavior (see [3,6]). Reachability analysis in particular is concerned with the computation of the reachable set, i.e., the set of points reached from an initial set that evolves under the system's dynamics.…”
Section: Introductionmentioning
confidence: 99%