Filters








926,473 Hits in 5.5 sec

Bounded Model Checking for Timed Systems [chapter]

G. Audemard, A. Cimatti, A. Kornilowicz, R. Sebastiani
2002 Lecture Notes in Computer Science  
In this paper we propose a new, symbolic verification technique that extends the Bounded Model Checking (BMC) approach for the verification of timed systems.  ...  First, a BMC problem for timed systems is reduced to the satisfiability of a math-formula, i.e., a boolean combination of propositional variables and linear mathematical relations over real variables (  ...  , triggering, math-driven backjumping and learning) which we have implemented. 3 Bounded Model Checking for Timed Automata Bounded Model Checking (BMC) is a recent approach to symbolic model checking [  ... 
doi:10.1007/3-540-36135-9_16 fatcat:u57v2romwjhqbehm7igk45njpa

Simple Bounded MTLK Model Checking for Timed Interpreted Systems [chapter]

Agnieszka M. Zbrzezny, Andrzej Zbrzezny
2017 Smart Innovation, Systems and Technologies  
We investigate a SAT-based bounded model checking method for Metric Temporal Logic that is interpreted over linear discrete infinite time models generated by discrete timed automata.  ...  Introduction Bounded model checking [2, 3, 5] (BMC) is one of the symbolic model checking technique designed for finding witnesses for existential properties or counterexamples for universal properties  ...  Bounded model checking In this section we define a bounded semantics for LTL q in order to translate the existential model checking problem for LTL q into the satisfiability problem.  ... 
doi:10.1007/978-3-319-59394-4_9 fatcat:5mm7pkbm2zh5lav4bfsvygke2a

Bounded Model Checking for GSMP Models of Stochastic Real-Time Systems [chapter]

Rajeev Alur, Mikhail Bernadsky
2006 Lecture Notes in Computer Science  
Model checking is a popular algorithmic verification technique for checking temporal requirements of mathematical models of systems.  ...  Model checking is a popular algorithmic verification technique for checking temporal requirements of mathematical models of systems.  ...  The bound k is analogous to the bound on the lengths of paths used in recent work on bounded model checking of discrete Boolean systems using SAT solvers [4] .  ... 
doi:10.1007/11730637_5 fatcat:vlcsedoo3zavxnbb5t5xcfuaaa

Combined Bounded and Symbolic Model Checking for Incomplete Timed Systems [chapter]

Georges Morbé, Christian Miller, Christoph Scholl, Bernd Becker
2014 Lecture Notes in Computer Science  
Existing bounded model checking (BMC) approaches for incomplete timed systems exploit the power of modern SMT solvers, but might be too coarse as an abstraction for certain problem instances.  ...  We present a hybrid model checking algorithm for incomplete timed systems where parts of the system are unspecified (so-called black boxes).  ...  One possible method to prove unrealisability of properties in incomplete timed systems is bounded model checking (BMC).  ... 
doi:10.1007/978-3-319-13338-6_3 fatcat:xngbsilrrrbrfo5c5zhv7rho7e

Upper bounds for Newton's method on monotone polynomial systems, and P-time model checking of probabilistic one-counter automata [article]

Alistair Stewart, Kousha Etessami, Mihalis Yannakakis
2013 arXiv   pre-print
Using our upper bounds, and building on prior work, we obtain the first P-time algorithm (in the standard Turing model of computation) for quantitative model checking, to within desired precision, of discrete-time  ...  A central computational problem for analyzing and model checking various classes of infinite-state recursive probabilistic systems (including quasi-birth-death processes, multi-type branching processes  ...  A central problem for the analysis and model checking of these systems is the computation of their associated termination probabilities.  ... 
arXiv:1302.3741v2 fatcat:s2gxfzszhrajdortxshkuloaba

Checking EMTLK Properties of Timed Interpreted Systems Via Bounded Model Checking

Bożena Woźna-Szcześniak, Andrzej Zbrzezny
2015 Studia Logica: An International Journal for Symbolic Logic  
We investigate a SAT-based bounded model checking (BMC) method for EMTLK (the existential fragment of the metric temporal logic with knowledge) that is interpreted over timed models generated by timed  ...  In particular, we translate the existential model checking problem for EMTLK to the existential model checking problem for a variant of linear temporal logic (called HLTLK), and we provide a SAT-based  ...  for TISs to the existential model checking problem for HLTLK and for an augmented timed interpreted system (ATIS).  ... 
doi:10.1007/s11225-015-9637-9 fatcat:sigyik43evaujamgf4gwwqds6y

Bounded model checking for knowledge and real time

Bozena Woźna, Alessio Lomuscio, Wojciech Penczek
2005 Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems - AAMAS '05  
We show that the TECTLK model checking problem is decidable, and we present an algorithm for bounded model checking based on a discretisation method.  ...  We present TECTLK, a logic to specify knowledge and real time in multi-agent systems.  ...  . ⊓ ⊔ TECTLK Bounded Model Checking Bounded model checking (BMC) is a SAT-based technique for symbolic model checking.  ... 
doi:10.1145/1082473.1082498 dblp:conf/atal/WoznaLP05 fatcat:qatnrlvgnrempmvntkrwcdrgbu

Symbolic Representation of Time Petri Nets for Efficient Bounded Model Checking

Nao IGAWA, Tomoyuki YOKOGAWA, Sousuke AMASAKI, Masafumi KONDO, Yoichiro SATO, Kazutami ARIMOTO
2020 IEICE transactions on information and systems  
This paper proposed an efficient verification method for TPN introducing bounded model checking based on satisfiability solving.  ...  Safety critical systems are often modeled using Time Petri Nets (TPN) for analyzing their reliability with formal verification methods.  ...  A part of the experiments was conducted with the support of the 2017 research grant of the Okawa Foundation for Information and Telecommunications.  ... 
doi:10.1587/transinf.2019edl8086 fatcat:6frvwb6xwrcpxnkwfjkzq542da

Upper Bounds for Newton's Method on Monotone Polynomial Systems, and P-Time Model Checking of Probabilistic One-Counter Automata

Alistair Stewart, Kousha Etessami, Mihalis Yannakakis
2015 Journal of the ACM  
Using our upper bounds, and building on prior work, we obtain the first P-time algorithm (in the standard Turing model of computation) for quantitative model checking, to within arbitrary desired precision  ...  A central computational problem for analyzing and model checking various classes of infinite-state recursive probabilistic systems (including quasi-birth-death processes, multi-type branching processes  ...  A central problem for the analysis and model checking of these systems is the computation of their associated termination probabilities.  ... 
doi:10.1145/2789208 fatcat:nhjh7ffz3fgpxgybcqzf5skbha

Upper Bounds for Newton's Method on Monotone Polynomial Systems, and P-Time Model Checking of Probabilistic One-Counter Automata [chapter]

Alistair Stewart, Kousha Etessami, Mihalis Yannakakis
2013 Lecture Notes in Computer Science  
Using our upper bounds, and building on prior work, we obtain the first P-time algorithm (in the standard Turing model of computation) for quantitative model checking, to within arbitrary desired precision  ...  A central computational problem for analyzing and model checking various classes of infinite-state recursive probabilistic systems (including quasi-birth-death processes, multi-type branching processes  ...  A central problem for the analysis and model checking of these systems is the computation of their associated termination probabilities.  ... 
doi:10.1007/978-3-642-39799-8_33 fatcat:gxcfycl3t5h5rpgu56fdvbbpci

Integrated Simulation and Model-Checking for the Analysis of Biochemical Systems

Federica Ciocchetta, Stephen Gilmore, Maria Luisa Guerriero, Jane Hillston
2009 Electronical Notes in Theoretical Computer Science  
A simulation pre-run identifies interesting time intervals on which model-checking should focus, if this information is not available from experimental data.  ...  Moreover, the finite nature of the state representation used means that a priori bounds must be set for the numbers of molecules of each species to be observed in the system.  ...  Stephen Gilmore and Maria Luisa Guerriero are supported by the EPSRC grant EP/E031439/1 "Stochastic Process Algebra for Biochemical Signalling Pathway Analysis".  ... 
doi:10.1016/j.entcs.2009.02.048 fatcat:xaaqhay42rb27hsrzht7y7vddu

Verifying Systems of Resource-Bounded Agents [chapter]

Natasha Alechina, Brian Logan
2016 Lecture Notes in Computer Science  
We briefly survey previous work on the verification of multi-agent systems that takes resources into account, and outline some key challenges for future work.  ...  Approaches to the verification of multi-agent systems are typically based on games or transition systems defined in terms of states and actions.  ...  The model-checking algorithm for PRB-ATL requires time polynomial in the size of the model and exponential in the number of resource types and the resource bound on the system.  ... 
doi:10.1007/978-3-319-40189-8_1 fatcat:ygwqpdauzrd35g37tqvxbwanfi

Computing Response Time Distributions Using Iterative Probabilistic Model Checking [chapter]

Freek van den Berg, Jozef Hooman, Arnd Hartmanns, Boudewijn R. Haverkort, Anne Remke
2015 Lecture Notes in Computer Science  
Under the hood, probabilistic real-time model checking technology is used iteratively to obtain precise bounds and probabilities.  ...  To reduce the state spaces for analysis, we use two sampling methods (for measurements) that simplify the system model: (i) applying an abstraction on time by increasing the length of a (discrete) model  ...  P Ω (t) = ∞ n=1 (1 − ρ) n−1 ρ P n (t), (3) Iterative Model Checking for Probability Bounds We provide an algorithm to compute function M, for a given iDSL model i, for the lower and upper bound, respectively  ... 
doi:10.1007/978-3-319-23267-6_14 fatcat:buoj73ebqfh5jlmpjfjqrfa4l4

Bounded Model Checking for Region Automata [chapter]

Fang Yu, Bow-Yaw Wang, Yao-Wen Huang
2004 Lecture Notes in Computer Science  
Bounded Model Checking for Region Automata. Fang Yu, Bow-Yaw Wang and Yaw-Wen Huang.  ...  · xBMC v2.1: an unbounded model checker for real-time systems based on incorporating induction proofs (proposed in ATVA 2004) · xBMC v2.0: a bounded model checker for real time systems based on discretization  ... 
doi:10.1007/978-3-540-30206-3_18 fatcat:g5sawav6rvbtfntyihfbjtp3re

ProEva: Runtime Proactive Performance Evaluation Based on Continuous-Time Markov Chains

Guoxin Su, Taolue Chen, Yuan Feng, David S. Rosenblum
2017 2017 IEEE/ACM 39th International Conference on Software Engineering (ICSE)  
In this paper, we present a framework called ProEva, which extends the conventional technique of time-bounded CTMC model checking by admitting imprecise, interval-valued estimates for transition rates.  ...  The core method of ProEva computes asymptotic expressions and bounds for the imprecise model checking output. We also present an evaluation of accuracy and computational overhead for ProEva.  ...  However, the model checking problem for CTMCs against time-bounded metrics, namely time-bounded CTMC model checking [13] , requires different techniques.  ... 
doi:10.1109/icse.2017.51 dblp:conf/icse/SuCFR17 fatcat:upw4s5lm5nhcdjyow6v7fns5zq
« Previous Showing results 1 — 15 out of 926,473 results