A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Bounded Reachability Checking with Process Semantics
[chapter]
2001
Lecture Notes in Computer Science
Preserved Fulltext
We consider three semantics: process, step, and interleaving semantics. We show that process semantics has often the best performance for bounded reachability checking. ...
Bounded model checking has been recently introduced as an efficient verification method for reactive systems. In this work we apply bounded model checking to asynchronous systems. ...
A marking may be reachable with a bound n and only reachable with bound i in the process semantics, where i < n. ...
doi:10.1007/3-540-44685-0_15
fatcat:lcsheuvgxzbw7oakw6qa3aq2yy
Model Checking of Hybrid Systems Using Shallow Synchronization
[chapter]
2010
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
This destroys the structure of the network and results in a loss of efficiency, especially using bounded model checking techniques. ...
We implemented a bounded reachability search based on the use of an incremental Satisfiability-Modulo-Theory solver. ...
Other works as in [17] propose symbolic versions of POR and combine them with bounded model checking and SMT. ...
doi:10.1007/978-3-642-13464-7_13
fatcat:6expaqekefbp3ecmsv6tgdjxe4
On the complexity of model checking interval-valued discrete time Markov chains
2013
Information Processing Letters
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We show that, for reachability, these two semantics coincide and the problem is P-complete. This entails that PCTL model checking problem under the IMDP semantics is also P-complete. ...
Two semantics are considered, the uncertain Markov chain (UMC) semantics and the interval Markov decision process (IMDP) semantics. ...
It follows from Theorem 1 that model checking IDTMCs against PCTL under the IMDP semantics is also P-complete. This improves an upper bound of [7] .
Theorem 3. ...
doi:10.1016/j.ipl.2013.01.004
fatcat:fss5h7j36re5nl4yis2kany22i
Checking Partial-Order Properties of Vector Addition Systems with States
2013
2013 13th International Conference on Application of Concurrency to System Design
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
However we show that basic problems about the set of markings reached along the processes of a VASS, such as boundedness, covering and reachability, can be reduced to the analogous problems for Petri nets ...
We present also a technique to check effectively any MSO property of these partial orders, provided that the given system is bounded. ...
They have been implemented in a prototype tool [3] built on top of TINA [2] to check the prefix-boundedness of a given PNS and MONA [1] to check MSO properties of processes of a given bounded PNS. ...
doi:10.1109/acsd.2013.13
dblp:conf/acsd/AvellanedaM13
fatcat:kznuw3qbinbure5rz3dtys2b4i
On the Completeness of Verifying Message Passing Programs Under Bounded Asynchrony
[chapter]
2018
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We show that reachability over k-synchronous computations and checking k-synchronizability are both PSPACE-complete. ...
We introduce a bounded analysis that explores a special type of computations, called k-synchronous. ...
Importantly, we show that checking k-synchronizability of a program, with possibly infinite-state processes, can be reduced in linear time to checking state reachability under the k-synchronous semantics ...
doi:10.1007/978-3-319-96142-2_23
fatcat:wh5wjcmmxnf5vndwyyze5qt4wm
On the Completeness of Verifying Message Passing Programs under Bounded Asynchrony
[article]
2018
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We also show that reachability over k-synchronous computations and checking k-synchronizability are both PSPACE-complete. ...
We introduce a bounded analysis that explores a special type of computations, called k-synchronous. ...
Note that verifying flow-boundedness is reducible to a reachability problem for a single process and thus, decidable for finite-state processes. Theorem 4. ...
arXiv:1804.06612v1
fatcat:ufgdgjeq5bc2fauwvps2zug4wm
Scaling BDD-based Timed Verification with Simulation Reduction
[chapter]
2016
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The problem of model checking real-time systems based on digitization is that the number of tick transitions increases rapidly with the increment of clock upper bounds. ...
We show that simulation reduction allows us to verify timed automata with large clock upper bounds and to converge faster to the fixpoint. ...
Conclusion In this paper, we propose to use the simulation relation to improve the BDD-based model checking for real-time systems. Our approach is applied to verify reachability and LTL properties. ...
doi:10.1007/978-3-319-47846-3_23
fatcat:5znel3pznzdorpdjk3de4shlrm
BPPChecker: An SMT-based Model Checker on Basic Parallel Processes(Full Version)
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Other Versions
For EG operator, we provide a k-step bounded semantics and reduce the model checking of EG-formulas to the satisfiability problem of linear integer arithmetic. ...
Basic Parallel Process (BPP), as a subclass of Petri nets, can be used as a model for describing and verifying concurrent programs with lower complexity. ...
with fixed length, model checking reachability on BPP is p d complete, where d is the nested depth of modal operator d. ...
arXiv:2110.09414v2
fatcat:drvexe3xvvhrritgxffj7gwv5q
Context-Bounded Analysis for POWER
[chapter]
2017
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We propose an under-approximate reachability analysis algorithm for programs running under the POWER memory model, in the spirit of the work on context-bounded analysis intitiated by Qadeer et al. in 2005 ...
The generated program P contains the same number of processes as P, and operates on the same data domain. ...
We perform sanity checks on the guessed values in order to verify that they are consistent with the POWER semantics. Lines 6-8 perform the sanity checks for iW (p, x). ...
doi:10.1007/978-3-662-54580-5_4
fatcat:rqqxrlv4v5bl5m7yryxzysxdjy
Model Checking of Boolean Process Models
[article]
2011
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
The paper closes with the model checking of some Boolean process models which have been designed as Event-driven Process Chains. ...
It splits the processes of the Boolean system into a finite set of base processes of bounded length. Their behaviour translates to formulas from propositional logic. ...
tokens are admissible for model checking. ...
arXiv:1105.0653v1
fatcat:sucfthujrrdvno6pwgg4vg3k24
Model Checking Multithreaded Programs with Asynchronous Atomic Methods
[chapter]
2006
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Our main result shows that the control state reachability problem for finite SPL programs is decidable. ...
Therefore, such multithreaded programs can be model checked using the counterexample guided abstraction-refinement framework. ...
Finally, we conclude this section by showing that the control state reachability problem has a lower bound of EXPSPACE. ...
doi:10.1007/11817963_29
fatcat:rpcwhi4dabctre2grgwbvhvl6i
Applying symbolic bounded model checking to the 2012 RERS greybox challenge
2014
International Journal on Software Tools for Technology Transfer (STTT)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We checked the reachability properties via reachability of the error labels, and the behavioral properties via a bounded LTL model checking approach. ...
We describe the application of ESBMC, a symbolic bounded model checker for C programs, to the 2012 RERS greybox challenge. ...
We use this approach both for the reachability properties (in the usual way via checking the reachability of the error labels) and the behavioral properties (via our bounded LTL model checking approach ...
doi:10.1007/s10009-014-0335-0
fatcat:e4nbc6oacrgoffylkpt5tt7cci
Checking Asynchronously Communicating Components Using Symbolic Transition Systems
[chapter]
2004
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
We have to prove these results and to compare them with model-checking techniques. ...
One future work is to study specific communication checking to help the design and analysis of such systems. We have yet some preliminary results about deadlock checking for STS. ...
Checking Dico Boundedness The role of the checking algorithm is to analyse an STS and to check if the system is dico bounded or not. ...
doi:10.1007/978-3-540-30469-2_42
fatcat:xua2ebffprbnrihtxpinbsk52i
Decidable Classes of Unbounded Petri Nets with Time and Urgency
[chapter]
2016
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We obtain decidability of reachability for unbounded TPNs with restricted urgency under a new, yet natural, timed-arc semantics presenting them as Timed-Arc Petri Nets with restricted urgency. ...
Decidability of reachability under the intermediate marking semantics is also obtained for a restricted subclass. ...
As for Timed-Arc PNU, checking whether a TPN is with restricted urgency or with restricted constraints is decidable, since checking boundedness of (untimed) Petri Nets is decidable. ...
doi:10.1007/978-3-319-39086-4_18
fatcat:ifva7k4snjftjl66u6ojqplvyi
Analysis of Message Passing Programs Using SMT-Solvers
[chapter]
2013
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In order to achieve efficiency, we consider the phase-bounded reachability problem, where each process is allowed to perform a bounded number of phases during a run of the system. ...
We show that the framework allows a uniform translation of bounded-phase reachability for each of the above mentioned semantics to the satisfiability of quantifierfree Presburger formulas. ...
We say that π is k-bounded if it is k-bounded with respect to all process p ∈ P. For configurations γ and γ , we say that γ is k-reachable from γ if γ is reachable from γ by a k-bounded computation. ...
doi:10.1007/978-3-319-02444-8_20
fatcat:snu3au2cofhjlgw4msfffhwymq
« Previous
Showing results 1 — 15 out of 21,861 results