Results 1 - 10 of 189

Symbolic Model Checking for Real-time Systems

by Thomas A. Henzinger, Xavier Nicollin, Joseph Sifakis, Sergio Yovine - INFORMATION AND COMPUTATION , 1992
"... We describe finite-state programs over real-numbered time in a guarded-command language with real-valued clocks or, equivalently, as finite automata with real-valued clocks. Model checking answers the question which states of a real-time program satisfy a branching-time specification (given in an ..."
Abstract - Cited by 578 (50 self) - Add to MetaCart
We describe finite-state programs over real-numbered time in a guarded-command language with real-valued clocks or, equivalently, as finite automata with real-valued clocks. Model checking answers the question which states of a real-time program satisfy a branching-time specification (given

Graded-CTL: Satisfiability and Symbolic Model Checking

by Ro Ferrante, Margherita Napoli, Mimmo Parente - In ICFEM’10, LNCS 5885 , 2009
"... Abstract. In this paper we continue the study of a strict extension of the Computation Tree Logic, called graded-CTL, recently introduced by the same authors. This new logic augments the standard quantifiers with graded modalities, being able thus to express “There exist at least k ” or “For all but ..."
Abstract - Cited by 3 (1 self) - Add to MetaCart
Abstract. In this paper we continue the study of a strict extension of the Computation Tree Logic, called graded-CTL, recently introduced by the same authors. This new logic augments the standard quantifiers with graded modalities, being able thus to express “There exist at least k ” or “For all

Symbolic model checking of biochemical networks

by Nathalie Chabrier, Cois Fages Projet Contraintes - Computational Methods in Systems Biology (CMSB’03), volume 2602 of LNCS , 2003
"... Abstract. Model checking is an automatic method for deciding if a circuit or a program, expressed as a concurrent transition system, satisfies a set of properties expressed in a temporal logic such as CTL. In this paper we argue that symbolic model checking is feasible in systems biology and that it ..."
Abstract - Cited by 66 (8 self) - Add to MetaCart
Abstract. Model checking is an automatic method for deciding if a circuit or a program, expressed as a concurrent transition system, satisfies a set of properties expressed in a temporal logic such as CTL. In this paper we argue that symbolic model checking is feasible in systems biology

Symbolic Model Checking in Practice

by Sergio Vale Aguiar Campos, Srgio Vale, Aguiar Campos , 1999
"... Introduction The task of checking if a computer system satisfies its timing specifications is extremely important. These systems are often used in critical applications where failure to meet a deadline can have serious or even fatal consequences. This work discusses an efficient method for performi ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
Introduction The task of checking if a computer system satisfies its timing specifications is extremely important. These systems are often used in critical applications where failure to meet a deadline can have serious or even fatal consequences. This work discusses an efficient method

Parallel propositional satisfiability checking with distributed dynamic learning

by Wolfgang Blochinger, Carsten Sinz, Wolfgang Küchlin - Parallel Computing , 2003
"... We address the parallelization and distributed execution of an algorithm from the area of symbolic computation: propositional satisfiability (SAT) checking with dynamic learning. Our parallel programming models are strict multithreading for the core SAT checking procedure, complemented by mobile age ..."
Abstract - Cited by 26 (4 self) - Add to MetaCart
We address the parallelization and distributed execution of an algorithm from the area of symbolic computation: propositional satisfiability (SAT) checking with dynamic learning. Our parallel programming models are strict multithreading for the core SAT checking procedure, complemented by mobile

Techniques in Symbolic Model Checking

by Ashutosh Trivedi - IIT BOMBAY , 2003
"... Model checking is a highly automatic verification technique for finite state concurrent systems. In this approach for verification, temporal specifications are exhaustively verified over the state-space of the concurrent system. The number of states grows exponentially with the concurrency of th ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
satisfiability solving (SAT) and polynomial algebra have been demonstrated to be quite powerful in practice. In this thesis, we propose an approach to symbolic model checking where model checking is performed by decomposing a finite state system into components. We first review the decomposition process

Symbolic model checking for incomplete designs

by Christoph Scholl, Christoph Scholl - Proc. IWLS ‘04 , 2004
"... We consider the problem of checking whether an incomplete design can still be extended to a complete design satisfying a given CTL formula and whether the property is satisfied for all possible extensions. Motivated by the fact that well-known model checkers like SMV or VIS produce incorrect results ..."
Abstract - Cited by 12 (7 self) - Add to MetaCart
We consider the problem of checking whether an incomplete design can still be extended to a complete design satisfying a given CTL formula and whether the property is satisfied for all possible extensions. Motivated by the fact that well-known model checkers like SMV or VIS produce incorrect

SAT-based unbounded symbolic model checking

by Hyeong-ju Kang, Student Member, In-cheol Park, Senior Member - in Proc. 40th Design Automat. Conf. Anaheim, CA: IEEE Computer Society
"... Abstract—This paper describes a Boolean satisfiability checking (SAT)-based unbounded symbolic model-checking algorithm. The conjunctive normal form is used to represent sets of states and tran-sition relation. A logical operation on state sets is implemented as an operation on conjunctive normal fo ..."
Abstract - Cited by 35 (0 self) - Add to MetaCart
Abstract—This paper describes a Boolean satisfiability checking (SAT)-based unbounded symbolic model-checking algorithm. The conjunctive normal form is used to represent sets of states and tran-sition relation. A logical operation on state sets is implemented as an operation on conjunctive normal

290 Approximate Symbolic Model Checking for Incomplete Designs

by Christoph Scholl
"... Abstract. We consider the problem of checking whether an incomplete design can still be extended to a complete design satisfying a given CTL formula and whether the property is satisfied for all possible extensions. Motivated by the fact that well-known model checkers like SMV or VIS produce incorre ..."
Abstract - Add to MetaCart
Abstract. We consider the problem of checking whether an incomplete design can still be extended to a complete design satisfying a given CTL formula and whether the property is satisfied for all possible extensions. Motivated by the fact that well-known model checkers like SMV or VIS produce

Composite Model Checking with Type Specific Symbolic Encodings

by Tevfik Bultan, Richard Gerber , 1998
"... We present a new symbolic model checking technique, which analyzes temporal properties in multityped transition systems. Specifically, the method uses multiple type-specific data encodings to represent system states, and it carries out fixpoint computations via the corresponding type-specific symbol ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
We present a new symbolic model checking technique, which analyzes temporal properties in multityped transition systems. Specifically, the method uses multiple type-specific data encodings to represent system states, and it carries out fixpoint computations via the corresponding type
Results 1 - 10 of 189