Results 11  20
of
44
IsomorphFree Model Enumeration: A New Method for Checking Relational Specifications
 ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS
, 1998
"... This article describes a technique for analyzing relational specifications. The underlying idea is very simple. Both simulation and checking amount to finding models of a relational formula, i.e., assignments for which the formula is true. For simulation the formula is the description of the operati ..."
Abstract

Cited by 21 (11 self)
 Add to MetaCart
This article describes a technique for analyzing relational specifications. The underlying idea is very simple. Both simulation and checking amount to finding models of a relational formula, i.e., assignments for which the formula is true. For simulation the formula is the description of the operation; for checking, the formula is the negation of an assertion about an operation. Models are found by a generateandtest strategy: the formula is repeatedly evaluated for a series of assignments until one is found for which the formula is true
Symmetry Reduction for SAT Representations of Transition Systems
"... Symmetries are inherent in systems that consist of several interchangeable objects or components. When reasoning about such systems, big computational savings can be obtained if the presence of symmetries is recognized. In earlier work, symmetries in constraint satisfaction problems have been h ..."
Abstract

Cited by 19 (2 self)
 Add to MetaCart
(Show Context)
Symmetries are inherent in systems that consist of several interchangeable objects or components. When reasoning about such systems, big computational savings can be obtained if the presence of symmetries is recognized. In earlier work, symmetries in constraint satisfaction problems have been handled by introducing symmetrybreaking constraints.
Reduction Rules for Time Petri Nets
, 1996
"... The goal of net reduction is to increase the effectiveness of Petrinet based realtime program analysis. Petrinetbased analysis, like all reachabilitybased methods, suffers from the state explosion problem. Petri net reduction is one key method for combating this problem. In this paper, we exten ..."
Abstract

Cited by 15 (3 self)
 Add to MetaCart
The goal of net reduction is to increase the effectiveness of Petrinet based realtime program analysis. Petrinetbased analysis, like all reachabilitybased methods, suffers from the state explosion problem. Petri net reduction is one key method for combating this problem. In this paper, we extend several rules for the reduction of ordinary Petri nets to work with time Petri nets. We introduce a notion of equivalence among time Petri nets, and prove that our reduction rules yield equivalent nets. This notion of equivalence guarantees that crucial timing and concurrency properties are preserved. Partially supported by NSF grants CCR9108753 and CCR9314258. Email: sloan@eecs.uic.edu. y Partially supported by NSF grants CCR9109231 and CCR9314258. Email: buy@eecs.uic.edu. 1 Introduction Petri nets have proven to be a very useful tool for the analysis of concurrent systems. To date several approaches have been defined that use Petri nets to model a system being analyzed (e.g...
State Reduction Methods For Automatic Formal Verification
, 1996
"... Validation of industrial designs is becoming more challenging as technology advances and demand for higher performance increases. One of the most suitable debugging aids is automatic formal verification. Unlike simulation, which tests behaviors under a specific execution, automatic formal verificati ..."
Abstract

Cited by 14 (1 self)
 Add to MetaCart
Validation of industrial designs is becoming more challenging as technology advances and demand for higher performance increases. One of the most suitable debugging aids is automatic formal verification. Unlike simulation, which tests behaviors under a specific execution, automatic formal verification tests behaviors under all possible executions of a system. Therefore, it is able to detect errors that cannot be reliably repeated using simulation. However, automatic formal verification is limited by the state explosion problem. The number of states for practical systems is often too large to check exhaustively within the limited time and memory that is available. Existing solutions have widened the range of verifiable systems, but they are either insufficient or hard to use. This thesis presents several techniques for reducing the number of states that are examined in automatic formal verification. These techniques have been evaluated on highlevel descriptions of industrial designs, ...
How to calculate symmetries of Petri nets
 Acta Informatica
, 1997
"... A definition of Petri net symmetries is given and an algorithm is introduced, which computes these symmetries. Then three examples are given how algorithms from different fields of Petri net analysis can be improved using symmetries, namely computation of reachability graphs, semipositive place inva ..."
Abstract

Cited by 14 (5 self)
 Add to MetaCart
(Show Context)
A definition of Petri net symmetries is given and an algorithm is introduced, which computes these symmetries. Then three examples are given how algorithms from different fields of Petri net analysis can be improved using symmetries, namely computation of reachability graphs, semipositive place invariants and structural deadlocks,
Structural Symmetries and Model Checking
, 1998
"... We present a fully automatic framework for identifying symmetries in structural descriptions of digital circuits and CTL* formulas and using them in a model checker. We show how the set of subformulas of a formula can be partitioned into equivalence classes so that truth values for only one subfor ..."
Abstract

Cited by 12 (0 self)
 Add to MetaCart
We present a fully automatic framework for identifying symmetries in structural descriptions of digital circuits and CTL* formulas and using them in a model checker. We show how the set of subformulas of a formula can be partitioned into equivalence classes so that truth values for only one subformula in any class need be evaluated for model checking. We unify and extend the theories developed by Clarke et al [CEFJ96] and Emerson and Sistla [ES96] for symmetries in Kripke structures. We formalize the notion of structural symmetries in netlist descriptions of digital circuits and CTL* formulas. We show how they relate to symmetries in the corresponding Kripke structures. We also show how such symmetries can automatically be extracted by constructing a suitable directed labeled graph and computing its automorphism group. We present a novel fast algorithm for solving the graph automorphism problem for directed labeled graphs.
On The Symmetry Reduction Method For Petri Nets And Similar Formalisms
, 2003
"... The symmetry reduction method is a technique for alleviating the combinatorial explosion problem arising in the state space analysis of concurrent systems. This thesis studies various issues involved in the method. The focus is on systems modeled with Petri nets and similar formalisms, such as the M ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
The symmetry reduction method is a technique for alleviating the combinatorial explosion problem arising in the state space analysis of concurrent systems. This thesis studies various issues involved in the method. The focus is on systems modeled with Petri nets and similar formalisms, such as the Mur\phi description language. For
Analysis of RealTime Programs with Simple Time Petri Nets
 In Proc. 1994 Internat. Sympos. on Software Testing and Analysis
, 1994
"... We present a first report on our PARTS toolset for the automated static analysis of realtime systems. The PARTS toolset is based upon a timed extension of Petri nets. Our simple time Petri nets or STP nets are specifically aimed at facilitating realtime analysis. Our analysis approach uses the sta ..."
Abstract

Cited by 8 (5 self)
 Add to MetaCart
(Show Context)
We present a first report on our PARTS toolset for the automated static analysis of realtime systems. The PARTS toolset is based upon a timed extension of Petri nets. Our simple time Petri nets or STP nets are specifically aimed at facilitating realtime analysis. Our analysis approach uses the state space of an STP net in order to answer queries about the concurrency and timing behavior of the corresponding system. An attractive feature of STP nets is that they support a variety of techniques for controlling the number of states that must be explicitly enumerated. These techniques were originally defined for the analysis of concurrency properties of untimed systems, and in this paper we discuss the extension of each to the timed domain. We also report on some preliminary experimental results that we obtained by running our toolset on examples of realtime systems. In: Proceedings of the 1994 Internatinal Symposium on Software Testing and Analysis (ISSTA '94), pp. 228239, August 1...
A PetriNetBased Approach to RealTime Program Analysis
 In Proc. Seventh Internat. Workshop on Software Specification and Design
, 1993
"... We propose to extend existing Petrinetbased tools for concurrency analysis to realtime analysis. The goal is to create a fully automated system, which starts from code in a higher level language for realtime programming, and answers programmers' queries about timing properties of the code. ..."
Abstract

Cited by 7 (4 self)
 Add to MetaCart
We propose to extend existing Petrinetbased tools for concurrency analysis to realtime analysis. The goal is to create a fully automated system, which starts from code in a higher level language for realtime programming, and answers programmers' queries about timing properties of the code. The key difficulty with all reachabilitybased approaches is that the state space quickly becomes intractably large. To circumvent this state explosion problem, we propose using a combination of several heuristics for model reduction and state space reduction that have been effective for untimed concurrency analysis. In: Proceedings of the Seventh International Workshop on Software Specification and Design, pp. 5660, December 1993, IEEE Computer Society Press. 1 Introduction The analysis of realtime software is very difficult. Indeed, the activities of design, implementation and testing are costly and complex even for traditional software, considerably more costly and complex for untimed co...