3,679 Hits in 10.7 sec

Model Checking for Rectangular Hybrid Systems: A Quantified Encoding Approach

Luan V. Nguyen, Wesam Haddad, Taylor T. Johnson
2022 Electronic Proceedings in Theoretical Computer Science  
In this paper, we present a new quantified encoding of BMC for rectangular hybrid automata (RHA), which requires using more general logics due to the real (dense) time and real-valued state variables modeling  ...  This approach has previously been applied to perform BMC using a Quantified Boolean Formula (QBF) encoding for purely discrete systems, and then discharges the QBF checks using QBF solvers.  ...  Johnson, Andreas Veneris, "Quantified Bounded Model Checking for Rectangular Hybrid Automata," which was presented at the 9th International Workshop on Constraints in Formal Verification (CFV 2015), Austin  ... 
doi:10.4204/eptcs.361.4 fatcat:7cwybobqmbe2tneujc65hykcdm

Discrete abstractions of hybrid systems

R. Alur, T.A. Henzinger, G. Lafferriere, G.J. Pappas
2000 Proceedings of the IEEE  
Either the continuous dynamics must be restricted, as is the case for timed and rectangular hybrid systems, or the discrete dynamics must be restricted, as is the case for o-minimal hybrid systems.  ...  A hybrid system is a dynamical system with both discrete and continuous state changes.  ...  ACKNOWLEDGMENT The authors would like to thank the reviewers for their detailed comments.  ... 
doi:10.1109/5.871304 fatcat:gt7ucnyuyrgwxnanhelm7ilgci

Verifying LTL Properties of Hybrid Systems with K-Liveness [chapter]

Alessandro Cimatti, Alberto Griggio, Sergio Mover, Stefano Tonetta
2014 Lecture Notes in Computer Science  
In this paper, we extend K-Liveness to deal with LTL for hybrid systems.  ...  In the context of finite-state model checking, K-Liveness is a recently proposed algorithm that tackles the problem by proving that an accepting condition can be visited at most K times.  ...  In [31] the authors consider the problem of LTL model checking for discrete-time robust hybrid systems. Instead, we consider continuous-time systems.  ... 
doi:10.1007/978-3-319-08867-9_28 fatcat:swzv2x2cpze3fpjfs3mmbv5r7u

Multi-Robot Systems: Modeling, Specification, and Model Checking [chapter]

Ammar Mohammed, Ulrich Furbach, Frieder Stolzenburg
2010 Robot Soccer  
Another interesting approach on model checking hybrid systems is presented in Gulwani & Tiwari (2008) .  ...  In contrast to our approach, some authors approached modeling the behavior of hybrid systems as an automaton using CLP, but they do not handle a hybrid system consisting of different interacting hybrid  ... 
doi:10.5772/7349 fatcat:scvgry75fnbyta67aajoot6rda

Model Checking of Biological Systems [chapter]

Luboš Brim, Milan Češka, David Šafránek
2013 Lecture Notes in Computer Science  
We present a selection of approaches used for modeling biological systems and formalizing their interesting properties in temporal logics.  ...  We also give a brief account of high performance model checking techniques and add a few case studies that demonstrate the use of model checking in computational systems biology.  ...  for the exhaustive model checking approach.  ... 
doi:10.1007/978-3-642-38874-3_3 fatcat:gko33i5f6fe33jl4zi2cdte6ha

Parametrized Verification of Distributed Cyber-Physical Systems: An Aircraft Landing Protocol Case Study

Taylor T. Johnson, Sayan Mitra
2012 2012 IEEE/ACM Third International Conference on Cyber-Physical Systems  
In this paper, we present the formal modeling and automatic parameterized verification of a distributed air traffic control protocol called the Small Aircraft Transportation System (SATS).  ...  Each aircraft is modeled as a timed automaton with (possibly unbounded) counters. SATS is then described as the composition of N such aircraft, where N is a parameter from the natural numbers.  ...  The authors wish to thank Cesar Muñoz for providing a PVS specification of SATS, Karthik Manamcheri for developing the Uppaal model, and helpful discussions with Madhusudan Parthasarathy.  ... 
doi:10.1109/iccps.2012.24 dblp:conf/iccps/JohnsonM12 fatcat:27mvcasvb5hrbp4jktimoopg7e

Algorithmic Algebraic Model Checking I: Challenges from Systems Biology [chapter]

C. Piazza, M. Antoniotti, V. Mysore, A. Policriti, F. Winkler, B. Mishra
2005 Lecture Notes in Computer Science  
In this paper, we suggest a possible confluence of the theory of hybrid automata and the techniques of algorithmic algebra to create a computational basis for systems biology.  ...  We briefly show an application to the study of the Delta-Notch protein signaling system in biology.  ...  Note also that the "algorithmic algebraic model checking approach" that we propose here naturally generalizes many of the basic ideas inherent to BDDbased symbolic model checking or even the more recent  ... 
doi:10.1007/11513988_3 fatcat:2zwuvtaf3nfunk7niw27i2kiqy

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.  ...  He uses a discrete time model (such a model can in certain cases encode a continuous time model).  ... 
doi:10.1007/s10703-013-0196-2 fatcat:othbkzatj5fhfaigdbpc4incie

Intelligently deciphering unintelligible designs: algorithmic algebraic model checking in systems biology

B. Mishra
2009 Journal of the Royal Society Interface  
A particular focus in this review is on approaches embedded in an embryonic program, dubbed "Algorithmic Algebraic Model Checking," and its powers and limitations.  ...  In particular, one may wish to read this review to envision a subject built out of a consilience of many interesting concepts from systems sciences, logic and model theory, and algebra, culminating in  ...  A Few Words of Gratitude The ideas presented here owe enormously to several, but most prominently to: Carla Piazza, Alberto Casagrande and Venkat Mysore  ... 
doi:10.1098/rsif.2008.0546 pmid:19364723 pmcid:PMC2696146 fatcat:hv4osd33qbh3vdn66p2or2n4ly

Robustness in real-time systems

Nicolas Markey
2011 2011 6th IEEE International Symposium on Industrial and Embedded Systems  
We review several aspects of robustness of real-time systems, and present recent results on the robust verification of timed automata.  ...  I thank Patricia Bouyer-Decitre, Ocan Sakur, and the anonymous referees for helpful comments on earlier versions of this paper.  ...  This provides a way to check simple safety properties of timed automata, and has been extended to temporal-logic model checking.  ... 
doi:10.1109/sies.2011.5953652 dblp:conf/sies/Markey11 fatcat:iizd4xuczndupnhswaabv2ixbi

Algorithmic Algebraic Model Checking II: Decidability of Semi-algebraic Model Checking and Its Applications to Systems Biology [chapter]

V. Mysore, C. Piazza, B. Mishra
2005 Lecture Notes in Computer Science  
for model-checking with TCTL (Timed Computation Tree Logic) over this broad class of semi-algebraic hybrid systems.  ...  Motivated by applications to systems biology, and the emergence of semi-algebraic hybrid systems as a natural framework for modeling biochemical networks, we continue exploring the decidability problem  ...  In the following construction, we present a semi-algebraic hybrid system and encode the Mandelbrot set as a reachability query.  ... 
doi:10.1007/11562948_18 fatcat:zblkthtthzbkpjbhpzcmur7ui4

Safety verification of hybrid systems by constraint propagation-based abstraction refinement

Stefan Ratschan, Zhikun She
2007 ACM Transactions on Embedded Computing Systems  
We start from a classical method that uses interval arithmetic to check whether trajectories can move over the boundaries in a rectangular grid.  ...  This paper deals with the problem of safety verification of non-linear hybrid systems.  ...  The authors thank Martin Fränzle for carefully removing some of our initial ignorance about the intricacies of hybrid systems.  ... 
doi:10.1145/1210268.1210276 fatcat:4gkpnx6hznh4bknm6jby22skpy

Deriving Unbounded Proof of Linear Hybrid Automata from Bounded Verification

Dingbao Xie, Lei Bu, Xuandong Li
2014 2014 IEEE Real-Time Systems Symposium  
The behavior space of real time hybrid systems is very complex and hence expensive to conduct the classical full state space model checking.  ...  Compared to the classical model checking, bounded model checking (BMC) is much cheaper to conduct and has better scalability.  ...  Pascal Fontaine for insightful discussions and the anonymous reviewers for valuable advices on improving this paper. This work is supported by the National 863 High-Tech Program of China  ... 
doi:10.1109/rtss.2014.22 dblp:conf/rtss/XieBL14 fatcat:bwktzke67bfvzakbgi3szlsbmu

Computing Semi-algebraic Invariants for Polynomial Dynamical Systems [article]

Jiang Liu and Naijun Zhan and Hengjun Zhao
2011 arXiv   pre-print
In this paper, we consider an extended concept of invariant for polynomial dynamical system (PDS) with domain and initial condition, and establish a sound and complete criterion for checking semi-algebraic  ...  invariants (SAI) for such PDSs.  ...  So, this approach can not be applied to general linear hybrid systems, let alone nonlinear systems.  ... 
arXiv:1102.0705v2 fatcat:kqhsupeanngtfjaiyno5a6khgy

$$2^5$$ Years of Model Checking [chapter]

Edmund M. Clarke, Qinsi Wang
2015 Lecture Notes in Computer Science  
In this paper, we will briefly review the development of Model Checking over the past 32 years, with an emphasis on model checking stochastic hybrid systems.  ...  Model Checking is an automatic verification technique for large state transition systems. It was originally developed for reasoning about finite-state concurrent systems.  ...  More effective model checking algorithms are required for real-time and hybrid systems, and are badly in need for even more complex systems, such as stochastic hybrid systems.  ... 
doi:10.1007/978-3-662-46823-4_2 fatcat:g4tbd7fribgothf2bfgajkywfe
« Previous Showing results 1 — 15 out of 3,679 results