Filters








5,934 Hits in 3.5 sec

Time Domain Verification of Oscillator Circuit Properties

Goran Frehse, Bruce H. Krogh, Rob A. Rutenbar, Oded Maler
2006 Electronical Notes in Theoretical Computer Science  
The approach is illustrated for a nonlinear tunneldiode circuit model using PHAVer, a hybrid system analysis tool that provides sound verification results based on linear hybrid automata approximations  ...  Generic monitor automata are proposed to facilitate the application of hybrid system reachability computations to characterize time domain features of oscillatory behavior, such as bounds on the signal  ...  Fig. 1 . 1 Monitor automata for the amplitude variation Fig. 2 . 2 Monitor automata for the phase jitter Fig. 3 . 3 Reachable states and partitioning of the invariants the time elapse operator.  ... 
doi:10.1016/j.entcs.2006.02.019 fatcat:b4qenuu62fcr7h4fh7rguagpou

The FC2TOOLS set [chapter]

Amar Bouali, Annie Ressouche, Valérie Roy, Robert Simone
1996 Lecture Notes in Computer Science  
Of uttermost interest in the new implementation is that most analysis functions are implemented with redundancy using both explicit classical representation of automata, and also implicit state space symbolic  ...  We are currently extending these features of FC2IMPLICIT SO that labeled predicates on states, hiding of behaviours irrelevant to specific analysis, and use of side observer automata would allow to check  ...  Traditional Relational Coarsest Partitioning Algorithm [3] is used to refine a state partition until fix-point. Comparison with automata specifications.  ... 
doi:10.1007/3-540-61474-5_98 fatcat:a2skyrt7jrd5hew3542iy53mee

PARAMETRIC VERIFICATION AND TEST COVERAGE FOR HYBRID AUTOMATA USING THE INVERSE METHOD

LAURENT FRIBOURG, ULRICH KÜHNE
2013 International Journal of Foundations of Computer Science  
Recently, a method has been presented for attacking this problem for Timed Automata. In this paper, we show the extension of this methodology for hybrid automata with linear and affine dynamics.  ...  Hybrid Automata are a powerful formalism for the modeling and verification of such systems.  ...  The algorithm has first been described for parametric timed automata in [4] . It has been applied for the synthesis of timing constraints for memory circuits [2] .  ... 
doi:10.1142/s0129054113400091 fatcat:qviqf7rwujejfezdw33vgb2cue

Parametric Verification and Test Coverage for Hybrid Automata Using the Inverse Method [chapter]

Laurent Fribourg, Ulrich Kühne
2011 Lecture Notes in Computer Science  
Recently, a method has been presented for attacking this problem for Timed Automata. In this paper, we show the extension of this methodology for hybrid automata with linear and affine dynamics.  ...  Hybrid Automata are a powerful formalism for the modeling and verification of such systems.  ...  The algorithm has first been described for parametric timed automata in [4] . It has been applied for the synthesis of timing constraints for memory circuits [2] .  ... 
doi:10.1007/978-3-642-24288-5_17 fatcat:upf3uyexfjgn7mtq3as3w3bfxu

Reachability Analysis of a Class of Switched Continuous Systems by Integrating Rectangular Approximation and Rectangular Analysis [chapter]

J. Preußig, O. Stursberg, S. Kowalewski
1999 Lecture Notes in Computer Science  
It combines an existing approach for approximating such systems by rectangular automata with an existing reachability algorithm for this class of hybrid automata.  ...  The paper presents a concept for the reachability analysis of switched continuous systems in which switching only occurs when the continuous state trajectory crosses thresholds defined by a rectangular  ...  Acknowledgements The work was partially supported by the German Research Council (DFG) in the special program Analysis and Synthesis of Technical Systems with Continuous-Discrete Dynamics (KONDISK) and  ... 
doi:10.1007/3-540-48983-5_20 fatcat:wzi4aj4otrbuljbjtk5xtpm2v4

Recent progress in continuous and hybrid reachability analysis

Eugene Asarin, Thao Dang, Goran Frehse, Antoine Girard, Colas Le Guernic, Oded Maler
2006 2006 IEEE Conference on Computer Aided Control System Design, 2006 IEEE International Conference on Control Applications, 2006 IEEE International Symposium on Intelligent Control  
The improvements include new geometrical objects for representing sets, new approximation schemes, and more flexible combinations of graph-search algorithm and partition refinement.  ...  Due to its inherent complexity, the application of reachability analysis has been limited so far to simple systems, both in the continuous and the hybrid domain.  ...  For systems such as timed automata or linear hybrid automata, where the continuous dynamics are given by linear constraints on the derivatives of the continuous variables, an exact reachability analysis  ... 
doi:10.1109/cacsd-cca-isic.2006.4776877 fatcat:hipfmslmorgtzjm56vw3rmrpju

Approximated Reachability on Hybrid Automata: Falsification meets Certification

K. Bauer, R. Gentilini, K. Schneider
2008 Electronical Notes in Theoretical Computer Science  
In this paper, we introduce a novel method for the reachability analysis of hybrid automata featuring (1) the ability of combining the certification and the falsification of reachability properties, and  ...  Being mostly based on either bounded reachability or on the notion of simulation preorder, current techniques for the approximated reachability analysis force to choose between under-and over-approximations  ...  Conclusions We proposed a novel framework for the reachability analysis of hybrid automata.  ... 
doi:10.1016/j.entcs.2008.12.030 fatcat:nwupv7llxfbb7fi2ktllk3dvaa

Multi-core Reachability for Timed Automata [chapter]

Andreas E. Dalsgaard, Alfons Laarman, Kim G. Larsen, Mads Chr. Olesen, Jaco van de Pol
2012 Lecture Notes in Computer Science  
Interpretation Lattices Worklist Algorithm  ...  Acknowledgments We would like to thank the LTSmin and APRON developers for making their excellent code available to others in the research community.  ...  Algorithm 16 is the algorithm used for over-approximate reachability checking of timed automata using the convex-hull abstraction [45] .  ... 
doi:10.1007/978-3-642-33365-1_8 fatcat:qwhq3mr2bzfizm54xhsw7ddd5a

Safety and progress proofs for a reactive planner and controller for autonomous driving [article]

Abolfazl Karimi, Manish Goyal, Parasara Sridhar Duggirala
2021 arXiv   pre-print
For proving the safety and performance specification, we compute the reachable set of this hybrid automata and employ some enhancements that make this computation easier.  ...  Our reactive planner selects a waypoint on the local Voronoi diagram and we use a pure-pursuit controller to navigate towards the waypoint. Our safety and performance analysis has two parts.  ...  of the given width and reachable set is computed for each partition.  ... 
arXiv:2107.05815v1 fatcat:43d32jlfqfgjdiwlra5zvvj2ra

An algorithm for reachability computations on hybrid automata models of protein signaling networks

R. Ghosh, C. Tomlin
2004 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601)  
The algorithm has been implemented and used to compute reachable sets for the biologically observed equilibria of multiple cell Delta-Notch protein signaling networks.  ...  This is useful for determining experimentally verifiable properties of the system under study.  ...  RESULTS The algorithm has been used to analyze the one cell, two cell and four cell Delta-Notch automata.  ... 
doi:10.1109/cdc.2004.1430384 fatcat:wdmu4nkd3vhblnnjye6wjdznwi

Reachability Problems on Extended O-Minimal Hybrid Automata [chapter]

Raffaella Gentilini
2005 Lecture Notes in Computer Science  
This can be seen either as a reachability problem paired with time-constraints or as a classical reachability problem for a class of hybrid automata which properly extends the o-minimal one, with an extra  ...  In this paper we start considering the problem of timed-bounded reachability on o-minimal automata.  ...  Policriti for many useful discussions.  ... 
doi:10.1007/11603009_14 fatcat:ottvt6kykjan5pubh6bt3on7zm

IMITATOR II: A Tool for Solving the Good Parameters Problem in Timed Automata

Étienne André
2010 Electronic Proceedings in Theoretical Computer Science  
We present here Imitator II, a new version of Imitator, a tool implementing the "inverse method" for parametric timed automata: given a reference valuation of the parameters, it synthesizes a constraint  ...  Imitator II also implements the "behavioral cartography algorithm", allowing us to solve the following good parameters problem: find a set of valuations within a given bounded parametric domain for which  ...  I thank Bertrand Jeannet for his help to link IMITATOR II with APRON, Ulrich Kühne for the interface with PPL, and Daphné Dussaud for the graphical output for the cartography.  ... 
doi:10.4204/eptcs.39.7 fatcat:kc6ukrsut5gr5oyztp5ngsxl24

Symbolic reachability computation using the disjunctive partitioning technique in Supervisory Control Theory

Z. Fei, K. Akesson, B. Lennartson
2011 2011 IEEE International Conference on Robotics and Automation  
To alleviate this problem, a well-known strategy is to represent and explore the state-space symbolically by using Binary Decision Diagrams.  ...  Supervisory Control Theory (SCT) is a modelbased framework for automatically synthesizing a supervisor that minimally restricts the behavior of a plant such that a given specification is fulfilled.  ...  The algorithm maintains a set of active disjunctive transition relations W k . These active transition relations are selected one at a time for the reachability search.  ... 
doi:10.1109/icra.2011.5980008 dblp:conf/icra/FeiAL11 fatcat:2zk734r5a5bjppxmw26ol4k4nu

An Optimal Approach to Hardware/Software Partitioning for Synchronous Model [chapter]

Pu Geguang, Dang Van Hung, He Jifeng, Wang Yi
2004 Lecture Notes in Computer Science  
This paper describes a new approach to hardware/software partitioning for synchronous communication model. We transform the partitioning into a reachability problem of timed automata.  ...  To relax the initial condition of the partitioning for optimization, two algorithms are designed to explore the dependency relations among processes in the sequential specification.  ...  Acknowledgement We are grateful to Liu Zhiming, Jin Naiyong for their helpful discussions and suggestions for the improvement of the paper.  ... 
doi:10.1007/978-3-540-24756-2_20 fatcat:dpdxwl3je5ff5ha5s4sugvp744

√erics: A Tool for Verifying Timed Automata and Estelle Specifications [chapter]

Piotr Dembiński, Agata Janowska, Paweł Janowski, Wojciech Penczek, Agata Półrola, Maciej Szreter, Bożena Woźna, Andrzej Zbrzezny
2003 Lecture Notes in Computer Science  
The current version offers an automatic translation from Estelle specifications to timed automata, and two complementary methods of reachability analysis.  ...  The paper presents a new tool for automated verification of Timed Automata as well as protocols written in the specification language Estelle.  ...  ] ), using a partitioning algorithm, and performing an on-the-fly reachability verification.  ... 
doi:10.1007/3-540-36577-x_20 fatcat:h2cbpz7it5cjjffbweo6hwprlq
« Previous Showing results 1 — 15 out of 5,934 results