Filters








328 Hits in 2.2 sec

Relating Syntactic and Semantic Perturbations of Hybrid Automata

Nima Roohi, Pavithra Prabhakar, Mahesh Viswanathan, Michael Wagner
2018 International Conference on Concurrency Theory  
We investigate how the semantics of a hybrid automaton deviates with respect to syntactic perturbations on the hybrid automaton.  ...  We consider syntactic perturbations of a hybrid automaton, wherein the syntactic representations of its elements, namely, initial sets, invariants, guards, and flows, in some logic are perturbed.  ...  C O N C U R 2 0 1 8 26:10 Relating Syntactic and Semantic Perturbations of Hybrid Automata Arbitrary Over-Approximation of Hybrid Automata In Section 2.4, we defined hybrid automata, its semantics,  ... 
doi:10.4230/lipics.concur.2018.26 dblp:conf/concur/RoohiP018 fatcat:qxolib5xdjdbxd2fd2q636vhvi

Discrete Semantics for Hybrid Automata

Alberto Casagrande, Carla Piazza, Alberto Policriti
2009 Discrete event dynamic systems  
Such behaviors can be described in a very natural way by a class of automata called hybrid automata.  ...  This paper addresses issues regarding the decidability of the reachability problem for hybrid automata (i.e., "can the system reach a state a from a state b?") by proposing an "inaccurate" semantics.  ...  Montanari, and G. Puppis for useful discussions.  ... 
doi:10.1007/s10626-009-0082-7 fatcat:tow63oe57vd7hanknrf3rivycm

Approximated Symbolic Computations over Hybrid Automata

Alberto Casagrande, Tommaso Dreossi, Carla Piazza
2013 Electronic Proceedings in Theoretical Computer Science  
In particular, in this paper we integrate in a single framework based on approximated semantics different over and under-approximation techniques for hybrid automata.  ...  Hybrid automata are a natural framework for modeling and analyzing systems which exhibit a mixed discrete continuous behaviour.  ...  However, imposing syntactic restrictions, several subclasses of hybrid automata over which the reachability problem is decidable have been identified [13, 6] .  ... 
doi:10.4204/eptcs.124.6 fatcat:bvcr4knanbfxlkis3gumvhew5u

ϵ-Semantics computations on biological systems

A. Casagrande, T. Dreossi, J. Fabriková, C. Piazza
2014 Information and Computation  
Hybrid automata are a natural model for both representing and analyzing systems that exhibit a mixed discrete continuous behaviours.  ...  Moreover, it reduces the computation of two specific -semantics to the decidability of a first-order theory and suggests how to decrease the complexity of the involved formulae.  ...  The following section details the formal meaning of these formulae and describes the semantics of hybrid automata. ∀Xψ[X, X].  ... 
doi:10.1016/j.ic.2014.01.011 fatcat:lrvms3ieqrdlfkswsgbknshywq

Guest editors' introduction to the special section on syntactic and structural pattern recognition

M. Basu, H. Bunke, A. Del Bimbo
2005 IEEE Transactions on Pattern Analysis and Machine Intelligence  
PROBLEMS OF INTEREST IN SYNTACTIC AND STRUCTURAL PATTERN RECOGNITION AND IN RELATED AREAS The fields of syntactic and structural pattern recognition experienced explosive growth during the 1960s and 1970s  ...  The authors use directed labeled graphs (where nodes and edges code concepts and semantic relations between two concepts, respectively) to represent word sense.  ... 
doi:10.1109/tpami.2005.141 pmid:16013749 fatcat:pfxujyxazjdkxfku6ymwjy3dfe

Robust timed automata [chapter]

Vineet Gupta, Thomas A. Henzinger, Radha Jagadeesan
1997 Lecture Notes in Computer Science  
We de ne robust timed automata, which are timed automata that accept all trajectories \robustly": if a robust timed automaton accepts a trajectory, then it must accept neighboring trajectories also; and  ...  This result is somewhat unexpected, given that in temporal logic, the removal of realtime equality constraints is known to lead to a decidable theory that is closed under all boolean operations.  ...  For this purpose, we relate tube acceptance and trajectory acceptance by considering syntactic subclasses of timed automata.  ... 
doi:10.1007/bfb0014736 fatcat:3ppjmuxfancy5izjdlvnotauym

Operational Models for Piecewise-Smooth Systems

Andrew Sogokon, Khalil Ghorbal, Taylor T. Johnson
2017 ACM Transactions on Embedded Computing Systems  
Our approach is to give meaning to motion in systems of this type by automatically synthesizing operational models in the form of hybrid automata (HA).  ...  These differences have a number of interesting nuances related to phenomena such as chattering, non-determinism, so-called mythical modes and sliding behaviour.  ...  Gautam Biswas at Vanderbilt University for a useful discussion of his related earlier research and extend special thanks to the anonymous reviewers for their careful reading, valuable suggestions, and  ... 
doi:10.1145/3126506 fatcat:qtr5cirzlvg75essiv26takv5e

Robustness and Implementability of Timed Automata [chapter]

Martin De Wulf, Laurent Doyen, Nicolas Markey, Jean-François Raskin
2004 Lecture Notes in Computer Science  
We show that this question is closely related to a notion of robustness for timed automata defined in [Pur98] and prove that the implementability problem is decidable.  ...  In a former paper, we defined a new semantics for timed automata, the Almost ASAP semantics, which is parameterized by ∆ to cope with the reaction delay of the controller.  ...  In Section 2, we recall some classical definitions related to timed automata and we introduce a general notion of enlarged semantics for those automata.  ... 
doi:10.1007/978-3-540-30206-3_10 fatcat:4cuiz33ur5dabbzeaqomdgj3gq

Robust Undecidability of Timed and Hybrid Systems [chapter]

Thomas A. Henzinger, Jean-François Raskin
2000 Lecture Notes in Computer Science  
The algorithmic approach to the analysis of timed and hybrid systems is fundamentally limited by undecidability, of universality in the timed case where all continuous variables are clocks, and of emptiness  ...  Besides the obvious blow our results deal to the algorithmic method, they also prove that the standard model of timed and hybrid systems, while not robust" in its de nition of trajectory acceptance which  ...  Open rectangular automata Open automata introduce fuzziness" syntactically, b y restricting all guard and di erential-inclusion intervals to open sets.  ... 
doi:10.1007/3-540-46430-1_15 fatcat:ubb25gf5ozbbrpdprp3jarrpbu

Delta-Complete Analysis for Bounded Reachability of Hybrid Systems [article]

Sicun Gao, Soonho Kong, Wei Chen, Edmund Clarke
2014 arXiv   pre-print
Our implementation of the techniques, an open-source tool dReach, scales well on several highly nonlinear hybrid system models that arise in biomedical and robotics applications.  ...  The techniques take into account of robustness properties of the systems under numerical perturbations.  ...  The syntactic perturbations correspond to semantic over-approximation of H in the trajectory space. Proof. Let ξ ∈ H be any trajectory of H.  ... 
arXiv:1404.7171v1 fatcat:yxgj6ay7tjejxo7pigcwcfynhi

Tutorial: Software tools for hybrid systems verification, transformation, and synthesis: C2E2, HyST, and TuLiP

Parasara Sridhar Duggirala, Chuchu Fan, Matthew Potok, Bolun Qi, Sayan Mitra, Mahesh Viswanathan, Stanley Bak, Sergiy Bogomolov, Taylor T. Johnson, Luan Viet Nguyen, Christian Schilling, Andrew Sogokon (+2 others)
2016 2016 IEEE Conference on Control Applications (CCA)  
Hybrid systems have both continuous and discrete dynamics and are useful for modeling a variety of control systems, from air traffic control protocols to robotic maneuvers and beyond.  ...  that simplify verification of a given hybrid system.  ...  Tutorial Plan The tutorial in C2E2 would illustrate the following features: 1) syntax and semantics of input hybrid systems models, 2) semantics and verification of the safety specification, and 3) using  ... 
doi:10.1109/cca.2016.7587948 dblp:conf/IEEEcca/DuggiralaFPQM0B16 fatcat:2aveitykz5b4tmbbx5xoditsqa

Unwinding biological systems

Alberto Casagrande, Carla Piazza
2015 Theoretical Computer Science  
In particular, we elaborate on the notion of robustness and propose some instances of unwinding over the process algebra Bio-PEPA and over hybrid automata.  ...  In Section 4 we present two unwinding conditions over hybrid automata and in Section 4.1 we exploit them on kinetic models of influenza virus. Conclusions are drawn in Section 5.  ...  The framework can be instantiated on all modeling languages which rely on operational semantics defined in terms of LTS's.  ... 
doi:10.1016/j.tcs.2015.02.045 fatcat:5izkyicy7fbnvbvjnefapcciam

Robust safety of timed automata

Martin De Wulf, Laurent Doyen, Nicolas Markey, Jean-François Raskin
2008 Formal methods in system design  
Timed automata are governed by an idealized semantics that assumes a perfectly precise behavior of the clocks.  ...  The traditional semantics is not robust because the slightest perturbation in the timing of actions may lead to completely different behaviors of the automaton.  ...  We show how to adapt this reduction to the perturbed semantics of timed automata.  ... 
doi:10.1007/s10703-008-0056-7 fatcat:un2vy3fq4ng25os6gusgju4sr4

Cyber/Physical Co-verification for Developing Reliable Cyber-physical Systems

Yu Zhang, Fei Xie, Yunwei Dong, Xingshe Zhou, Chunyan Ma
2013 2013 IEEE 37th Annual Computer Software and Applications Conference  
We present an efficient approach to reachability analysis of Hybrid Automata Pushdown System (HAPS ) models for cyber/physical co-verification of CPS.  ...  The evaluation has shown that HAPS is an effective model for co-verification of CPS and our approach has major potential in verifying systemlevel properties of CPS, therefore improving the reliability  ...  Hybrid Automata as Plant Models A Hybrid Automata HA [4] is syntactically a tuple (x,x 0 , V, v 0 , inv, di f, E, act, lab, syn), consisting of the following components: •x is a vector of n real-valued  ... 
doi:10.1109/compsac.2013.88 dblp:conf/compsac/ZhangXDZM13 fatcat:sttcyjejw5bgfbnq775kzu36ei

Safety verification of non-linear hybrid systems is quasi-decidable

Stefan Ratschan
2013 Formal methods in system design  
In contrast to earlier work, our result holds for a very general class of hybrid systems, and it uses a continuous time model. * This is an extended version of a conference paper [23] .  ...  Safety verification of hybrid systems is undecidable, except for very special cases.  ...  Here the syntactic level is depicted on the top, and the semantic level on the bottom.  ... 
doi:10.1007/s10703-013-0196-2 fatcat:othbkzatj5fhfaigdbpc4incie
« Previous Showing results 1 — 15 out of 328 results