38 Hits in 3.3 sec

Static Guard Analysis in Timed Automata Verification [chapter]

Gerd Behrmann, Patricia Bouyer, Emmanuel Fleury, Kim G. Larsen
2003 Lecture Notes in Computer Science  
By definition Timed Automata have an infinite state-space, thus for verification purposes, an exact finite abstraction is required.  ...  We show that the location-based zone abstraction is sound and complete with respect to location reachability; that it generalises active-clock reduction, in the sense that an inactive clock has no relevant  ...  In UPPAAL, clocks (and clock differences) may be compared to expressions over bounded integer variables.  ... 
doi:10.1007/3-540-36577-x_18 fatcat:fviucp3u2nb6rgighux6bszb5a

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  
Acknowledgments We would like to thank the LTSmin and APRON developers for making their excellent code available to others in the research community.  ...  Thus, for a more conventional analysis specification an extrapolation can be viewed as a widening.  ...  The models can be edited in the uppaal [72] GUI, to introduce static partitionings.  ... 
doi:10.1007/978-3-642-33365-1_8 fatcat:qwhq3mr2bzfizm54xhsw7ddd5a

Slicing for uppaal

Claus Thrane, Uffe Sørensen
2008 2008 Annual IEEE Student Paper Conference  
The focus of this thesis is to introduce slicing for Uppaal [9] . Slicing is a technique based on static analysis used to reduce the syntactic size of models or applications.  ...  Using automated slicing in Uppaal will eliminate the need for users to manually optimize models for faster verification of a certain property.  ...  In the following, we give a further introduction to the language used in Uppaal, in order to motivate research into static analysis of the imperative language components and to achieve even better performance  ... 
doi:10.1109/aispc.2008.4460546 fatcat:qam4k3uhqzdldlqmvabe5t3fc4

Efficient Analysis and Synthesis of Complex Quantitative Systems [article]

Peter Gjøl Jensen
2018 PhD series, Technical Faculty of IT and Design, ˜Aalborg=ålborgœ University  
In the topic of tool integration, we extend the tool Uppaal to facilitate interoperability with other tools.  ...  We also present a case-study using externally defined components, such as an ARM-processor emulator, in a classical model checking context. iii Resumé Fra toastere til rumstationer har computerbaseret  ...  The third author is partially affiliated with FI MU in Brno. Acknowledgments. The research leading to these results was made possible by an external stay partially funded by Otto Mønsted Fonden.  ... 
doi:10.5278/ fatcat:fq4x5hnl5rgdzdtolcimzbonxm

Formal verification of timed systems: a survey and perspective

Farn Wang
2004 Proceedings of the IEEE  
An overview of the current state of the art of formal verification of real-time systems is presented.  ...  Behrmann et al. proposed a static analysis technique on triggering condition [35] . F.  ...  UPPAAL UPPAAL [39] , [183] has now grown into an integrated tool environment for modeling, validation, and verification of real-time systems modeled by a network of automata with high-level data objects  ... 
doi:10.1109/jproc.2004.831197 fatcat:7e5u5rvdbncqbmkku7szkdyz34

Symbolic-Numeric Methods for Problem Solving in CPS (Dagstuhl Seminar 16491)

Sergiy Bogomolov, Martin Fränzle, Kyoko Makino, Nacim Ramdani, Marc Herbstritt
2017 Dagstuhl Reports  
Reflecting the fundamental role numeric and mixed symbolic-numeric arguments play in the analysis, decision making, and control of cyber-physical processes, this seminar promoted crossfertilization between  ...  means of error-propagation analysis; numerical and/or symbolic methods such as verified integrations, interval methods and arithmetic constraint solving; reactive and in-advance planning and optimization  ...  Combining Symbolic Analysis and Simulation in Uppaal Stratego We overview Pryce's structural analysis (SA) theory and its realization in the DAETS solver (Nedialkov and Pryce), a C++ package for solving  ... 
doi:10.4230/dagrep.6.12.1 dblp:journals/dagstuhl-reports/BogomolovFMR16 fatcat:sydj4slvefa7boehai7gpnfupm

Lazy Reachability Checking for Timed Automata with Discrete Variables [chapter]

Tamás Tóth, István Majzik
2018 Lecture Notes in Computer Science  
In this paper, we propose a lazy abstraction method for the location reachability problem of timed automata that can be used to efficiently control the visibility of discrete variables occurring in such  ...  We combine in a single algorithm our abstraction method with known efficient lazy abstraction algorithms for the handling of clock variables.  ...  The standard solution involves performing a forward exploration in the zone abstract domain [7] , combined with extrapolation [3] parametrized by bounds appearing in guards, extracted by static analysis  ... 
doi:10.1007/978-3-319-94111-0_14 fatcat:lkb3gkjv6rfttb3kkqjepdubb4

Towards formal security analysis of GTRBAC using timed automata

Samrat Mondal, Shamik Sural, Vijayalakshmi Atluri
2009 Proceedings of the 14th ACM symposium on Access control models and technologies - SACMAT '09  
Such an analysis calls for formal verification. While formal analysis on traditional RBAC has been done to some extent, the extensions of RBAC lack such an analysis.  ...  Both time and space analysis has been done for studying the performance of the approach under different configurations.  ...  [12] considered negative preconditions and static mutually exclusive role constraints in the policy analysis of administrative RBAC.  ... 
doi:10.1145/1542207.1542214 dblp:conf/sacmat/MondalSA09 fatcat:yst7sskmhjckrhie6dnuoxzhqe

Efficient Detection of Zeno Runs in Timed Automata [chapter]

Rodolfo Gómez, Howard Bowman
Lecture Notes in Computer Science  
As an alternative, we describe here an efficient static analysis to assert absence of Zeno runs on Uppaal networks; this is based on Tripakis's strong non-Zenoness property, and identifies all loops in  ...  Zeno runs, where infinitely many actions occur in finite time, may inadvertently arise in timed automata specifications.  ...  Acknowledgments: We are grateful to the researchers who made the benchmark models available, and to the reviewers for their insightful comments.  ... 
doi:10.1007/978-3-540-75454-1_15 fatcat:elp2compnjfj3bk5dcqs3gzwnq

TCTL Inevitability Analysis of Dense-time Systems [article]

Farn Wang, Geng-Dian Hwang, Fang Yu
2003 arXiv   pre-print
We also discuss the TCTL subclass with only universal path quantifiers which allows for the safe abstraction analysis of inevitability properties.  ...  Inevitability properties in branching temporal logics are of the syntax forall eventually \phi, where \phi is an arbitrary (timed) CTL formula.  ...  ≤, <, =, >, ≥, and c is an integer constant.  ... 
arXiv:cs/0304003v2 fatcat:axluzteihfaf5idtohqu6x6mue

Predictive and Reactive Scheduling for a Critical Machine of a Production System

Iwona Paprocka, Wojciech M. Kempa, Cezary Grabowik, Krzysztof Kalinowski
2014 Advanced Materials Research  
In the paper a production model with failures is presented where successive failure-free times are supposed to have normal distributions and are followed by normally distributed times of repairs.  ...  Acknowledgments The authors would like to acknowledge Cor Hurkens for his valuable comments and Roel Boumen and Maarten van Bree for their help with the case.  ...  Acknowledgments The authors would like to acknowledge Cor Hurkens for his valuable comments. Acknowledgments The authors would like to acknowledge Robert Dumont for his help with the case.  ... 
doi:10.4028/ fatcat:3ujweobndjgl7mqotcqrxfyypy

Abstraction Refinement-Based Verification of Timed Automata

Tamás Tóth, István Majzik
2021 Zenodo  
In addition, the state space is not necessarily finite, in particular for real-time systems, where continuous variables with time dimension are part of the specification.  ...  Model checking is an automatic formal verification technique that is based on exhaustive traversal of the design model's state space.  ...  This can be performed directly by extrapolation [Beh+04] parameterized by bounds obtained by static analysis [Beh+03] .  ... 
doi:10.5281/zenodo.4759046 fatcat:3vrprqrhfjeknjjdn74uqoreo4

TCTL Inevitability Analysis of Dense-Time Systems: From Theory to Engineering

Farn Wang, Geng-Dian Huang, Fang Yu
2006 IEEE Transactions on Software Engineering  
Inevitability properties in branching temporal logics are of the syntax ∀♦φ, where φ is an arbitrary (timed) CTL (Computation Tree Logic) formula.  ...  We have experimented with various issues, which may affect the performance of TCTL inevitability analysis. Specifically, our algorithms come with a parameter for the measurement of time-progress.  ...  or ≥, and c is an integer constant.  ... 
doi:10.1109/tse.2006.71 fatcat:ejdyth75kvhvhgamthn32xq2ma

Configurable verification of timed automata with discrete variables

Tamás Tóth, István Majzik
2020 Acta Informatica  
Moreover, based on our previous work, we uniformly formalize in our framework several abstraction refinement strategies for both clock and discrete variables that can be freely combined, resulting in many  ...  In this paper, we propose a configurable lazy abstraction framework for the location reachability problem of timed automata that potentially contain discrete variables.  ...  by static analysis [3] .  ... 
doi:10.1007/s00236-020-00393-4 fatcat:w7or2qfe2zht7owdlmbq2defji

Model Checking Real-Time Systems [chapter]

Patricia Bouyer, Uli Fahrenberg, Kim Guldstrand Larsen, Nicolas Markey, Joël Ouaknine, James Worrell
2018 Handbook of Model Checking  
We begin with introducing the model, as an extension of finite-state automata with real-valued variables for measuring time.  ...  This chapter surveys timed automata as a formalism for model checking real-time systems.  ...  Acknowledgement We thank the reviewers for their numerous comments, remarks and additional references, which greatly helped us improve this chapter.  ... 
doi:10.1007/978-3-319-10575-8_29 fatcat:thsp3udcpnfyjpjzn6i2slbplm
« Previous Showing results 1 — 15 out of 38 results