Abstract. Current algorithms for the automatic verification of Petri nets suffer from the explosion caused by the high dimensionality of the state spaces of practical examples. In this paper, we develop an abstract interpretation based analysis that reduces the dimensionality of state spaces that are explored during verification. In our approach, the dimensionality is reduced by trying to gather places that may not be important for the property to establish. If the abstraction that is obtained is too coarse, an automatic refinement is performed and a more precise abstraction is obtained. The refinement is computed by taking into account information about the inconclusive analysis. The process is iterated until the property is proved to be t...
Predicate abstraction is a powerful technique to reduce the state space of a program to a finite and...
Standard abstract model checking relies on abstract Kripke structures which approximate concrete mod...
In abstract interpretation-based static analysis, approximation is encoded by abstract domains. They...
Abstract — Model Checking has emerged as a promising and powerful approach to analyze Petri nets aut...
Verifying system specifications using traditional model-checking techniques rapidly becomes infeasib...
Abstract. Abstraction is the key for effectively dealing with the state explosionproblem in model-ch...
Predicate abstraction is a powerful technique to reduce the state space of a program to a finite and...
Abstraction refinement-based model checking has become a standard approach for efficiently verifying...
AbstractThis paper is concerned with a method for expanding (or reducing) a Petri net representation...
The advent of ever more complex reactive systems in increasingly critical areas calls for the de-vel...
Abstract. We present an automatic iterative abstraction-refinement methodology in which the initial ...
Formal verification techniques allow rigorous reasoning about the operation of computer systems and ...
AbstractAbstraction is one of the most important strategies for dealing with the state space explosi...
Abstract. Verification seeks to prove or refute putative properties of a given program. Deductive ve...
Many algorithms have been proposed to minimally refine abstract transition systems in order to get s...
Predicate abstraction is a powerful technique to reduce the state space of a program to a finite and...
Standard abstract model checking relies on abstract Kripke structures which approximate concrete mod...
In abstract interpretation-based static analysis, approximation is encoded by abstract domains. They...
Abstract — Model Checking has emerged as a promising and powerful approach to analyze Petri nets aut...
Verifying system specifications using traditional model-checking techniques rapidly becomes infeasib...
Abstract. Abstraction is the key for effectively dealing with the state explosionproblem in model-ch...
Predicate abstraction is a powerful technique to reduce the state space of a program to a finite and...
Abstraction refinement-based model checking has become a standard approach for efficiently verifying...
AbstractThis paper is concerned with a method for expanding (or reducing) a Petri net representation...
The advent of ever more complex reactive systems in increasingly critical areas calls for the de-vel...
Abstract. We present an automatic iterative abstraction-refinement methodology in which the initial ...
Formal verification techniques allow rigorous reasoning about the operation of computer systems and ...
AbstractAbstraction is one of the most important strategies for dealing with the state space explosi...
Abstract. Verification seeks to prove or refute putative properties of a given program. Deductive ve...
Many algorithms have been proposed to minimally refine abstract transition systems in order to get s...
Predicate abstraction is a powerful technique to reduce the state space of a program to a finite and...
Standard abstract model checking relies on abstract Kripke structures which approximate concrete mod...
In abstract interpretation-based static analysis, approximation is encoded by abstract domains. They...