NDLI: Covering sharing trees: a compact data structure for parameterized verification

Content Provider	Springer Nature Link
Author	Delzan, Giorgio Raskin, Jean François Van Begin, Laurent
Copyright Year	2003
Abstract	The control state reachability problem is decidable for well-structured infinite-state systems like (Lossy) Petri Nets, Vector Addition Systems, and broadcast protocols. An abstract algorithm that solves the problem is the backward reachability algorithm of [1, 21 ]. The algorithm computes the closure of the predecessor operator with respect to a given upward-closed set of target states. When applied to this class of verification problems, symbolic model checkers based on constraints like [7, 26 ] suffer from the state explosion problem.In order to tackle this problem, in [13] we introduced a new data structure, called covering sharing trees, to represent in a compact way collections of infinite sets of system configurations. In this paper, we will study the theoretical complexity of the operations over covering sharing trees needed in symbolic model checking. We will also discuss several optimizations that can be used when dealing with Petri Nets. Among them, in [14] we introduced a new heuristic rule based on structural properties of Petri Nets that can be used to efficiently prune the search during symbolic backward exploration. The combination of these techniques allowed us to turn the abstract algorithm of [1, 21 ] into a practical method. We have evaluated the method on several finite-state and infinite-state examples taken from the literature [2, 18 , 20 , 30 ]. In this paper, we will compare the results we obtained in our experiments with those obtained using other finite and infinite-state verification tools.
Starting Page	268
Ending Page	297
Page Count	30
File Format	PDF
ISSN	14332779
Journal	International Journal on Software Tools for Technology Transfer
Volume Number	5
Issue Number	2-3
e-ISSN	14332787
Language	English
Publisher	Springer Berlin Heidelberg
Publisher Date	2004-03-01
Publisher Place	Berlin, Heidelberg
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Symbolic model checking Infinite-state systems Constraints Efficient data structures Heuristics Static analysis Software Engineering Software Engineering/Programming and Operating Systems Theory of Computation
Content Type	Text
Resource Type	Article
Subject	Information Systems Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Efficient verification of timed automata with BDD-like data structures

Abstract regular (tree) model checking

Applying symbolic bounded model checking to the 2012 RERS greybox challenge

A unified view of parameterized verification of abstract models of broadcast communication

Exploring very large state spaces using genetic algorithms

Symbolic computational techniques for solving games

Regular model checking for LTL(MSO)

A symbolic manipulator for automated verification of reactive systems with heterogeneous data types

Extrapolating (omega-)regular model checking

Covering sharing trees: a compact data structure for parameterized verification

Similar Documents

Efficient verification of timed automata with BDD-like data structures

Abstract regular (tree) model checking

Applying symbolic bounded model checking to the 2012 RERS greybox challenge

A unified view of parameterized verification of abstract models of broadcast communication

Exploring very large state spaces using genetic algorithms

Symbolic computational techniques for solving games

Regular model checking for LTL(MSO)

A symbolic manipulator for automated verification of reactive systems with heterogeneous data types

Extrapolating (omega-)regular model checking

Covering sharing trees: a compact data structure for parameterized verification