منابع مشابه
Symbolic Methods for the State Space Exploration of GSPN Models
Generalised Stochastic Petri Nets (GSPNs) suffer from the same problem as any other state-transition modelling technique: it is difficult to represent sufficient states so that general, real life systems can be analysed. In this paper we use symbolic techniques to perform state space exploration for unstructured GSPNs. We present an algorithm for finding an encoding function which attempts to m...
متن کاملEfficient Symbolic State Exploration of Timed Systems: Theory and Implementation
Timing aspects are important for the correctness of safety-critical systems. It is crucial that they are carefully analysed in designing such systems. UPPAAL is a tool designed to automate the analysis process. In UPPAAL, a system under construction is described as a network of timed automata and the desired properties of the system can be specified using a query language. Then UPPAAL can be us...
متن کاملSymDIVINE: Tool for Control-Explicit Data-Symbolic State Space Exploration
We present SymDIVINE: a tool for bit-precise model checking of parallel C and C++ programs. It builds upon LLVM compiler infrastructure, hence, it uses LLVM IR as an input formalism. Internally, SymDIVINE extends the standard explicit-state state space exploration with SMT machinery to handle non-deterministic data values. As such, SymDIVINE is on a halfway between a symbolic executor and an ex...
متن کاملPartial-Order Reduction in Symbolic State Space Exploration
State space explosion is a fundamental obstacle in formal veri cation of designs and protocols. Several techniques for combating this problem have emerged in the past few years, among which two are signi cant: partialorder reductions and symbolic state space search. In asynchronous systems, interleavings of independent concurrent events are equivalent, and only a representative interleaving nee...
متن کاملSymbolic Query Exploration
We study the problem of generating a database and parameters for a given parameterized SQL query satisfying a given test condition. We introduce a formal background theory that includes arithmetic, tuples, and sets, and translate the generation problem into a satisfiability or model generation problem modulo the background theory. We use the satisfiability modulo theories (SMT) solver Z3 in the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2001
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(04)80668-6