Can Stubborn Sets Be Optimal?

Authors:
Antti Valmari;Henri Hansen
Affiliations:
(Correspd.) Tampere University of Technology, Department of Software Systems, PO Box 553, FI-33101 Tampere, Finland. {antti.valmari,henri.hansen}@tut.fi;Tampere University of Technology, Department of Software Systems, PO Box 553, FI-33101 Tampere, Finland. {antti.valmari,henri.hansen}@tut.fi
Venue:
Fundamenta Informaticae - Applications and Theory of Petri Nets and Other Models of Concurrency, 2010
Year:
2011

Citing 12
Cited 0

Confluence for process verification

Theoretical Computer Science
Model checking

Model checking
Partial-Order Methods for the Verification of Concurrent Systems: An Approach to the State-Explosion Problem

Partial-Order Methods for the Verification of Concurrent Systems: An Approach to the State-Explosion Problem
Relaxed Visibility Enhances Partial Order Reduction

Formal Methods in System Design
The State Explosion Problem

Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
Decidability and Complexity of Petri Net Problems - An Introduction

Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
Using Partial Orders to Improve Automatic Verification Methods

CAV '90 Proceedings of the 2nd International Workshop on Computer Aided Verification
All from One, One for All: on Model Checking Using Representatives

CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
Dynamic partial-order reduction for model checking software

Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Exploring the Scope for Partial Order Reduction

ATVA '09 Proceedings of the 7th International Symposium on Automated Technology for Verification and Analysis
Compositional Analysis for Weak Stubborn Sets

ACSD '11 Proceedings of the 2011 Eleventh International Conference on Application of Concurrency to System Design
Can stubborn sets be optimal?

PETRI NETS'10 Proceedings of the 31st international conference on Applications and Theory of Petri Nets

Quantified Score

Hi-index	0.00

Visualization

Abstract

Literature on the stubborn set and similar state space reduction methods presents numerous seemingly ad-hoc conditions for selecting the transitions that are investigated in the current state. There are good reasons to believe that the choice between them has a significant effect on reduction results, but not much has been published on this topic. This article presents theoretical results and examples that aim at shedding light on the issue. Because the topic is extensive, we only consider the detection of deadlocks. We distinguish between different places where choices can be made and investigate their effects. It is usually impractical to aim at choices that are “best” in some sense. However, one non-trivial practical optimality result is proven.