A generalization of the procedure of Karp and Miller to well structured transition systems
14th International Colloquium on Automata, languages and programming
Reduction and covering of infinite reachability trees
Information and Computation
Unreliable channels are easier to verify than perfect channels
Information and Computation
Handbook of logic in computer science (vol. 3)
A note on well quasi-orderings for powersets
Information Processing Letters
Algorithmic analysis of programs with well quasi-ordered domains
Information and Computation - Special issue: LICS 1996—Part 1
Well-structured transition systems everywhere!
Theoretical Computer Science
Self-Modifying Nets, a Natural Extension of Petri Nets
Proceedings of the Fifth Colloquium on Automata, Languages and Programming
Reset Nets Between Decidability and Undecidability
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
On-the-Fly Analysis of Systems with Unbounded, Lossy FIFO Channels
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
The Minimal Coverability Graph for Petri Nets
Papers from the 12th International Conference on Applications and Theory of Petri Nets: Advances in Petri Nets 1993
On Model Checking for Non-Deterministic Infinite-State Systems
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
On the Verification of Broadcast Protocols
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Better is Better than Well: On Efficient Verification of Infinite-State Systems
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Using Forward Reachability Analysis for Verification of Lossy Channel Systems
Formal Methods in System Design
LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
Nets with Tokens which Carry Data
Fundamenta Informaticae - PETRI NETS 2007
A well-structured framework for analysing petri net extensions
Information and Computation
Journal of Computer and System Sciences
Expand, Enlarge and Check: New algorithms for the coverability problem of WSTS
Journal of Computer and System Sciences
On the efficient computation of the minimal coverability set for Petri nets
ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
Flat acceleration in symbolic model checking
ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
A complete abstract interpretation framework for coverability properties of WSTS
VMCAI'06 Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation
Towards a model-checker for counter systems
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Mixing Coverability and Reachability to Analyze VASS with One Zero-Test
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Noetherian spaces in verification
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Reachability games on extended vector addition systems with states
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Forward analysis and model checking for trace bounded WSTS
PETRI NETS'11 Proceedings of the 32nd international conference on Applications and theory of Petri Nets
Minimal coverability set for petri nets: Karp and Miller algorithm with pruning
PETRI NETS'11 Proceedings of the 32nd international conference on Applications and theory of Petri Nets
Deciding safety properties in infinite-state pi-calculus via behavioural types
Information and Computation
Forward analysis for petri nets with name creation
PETRI NETS'10 Proceedings of the 31st international conference on Applications and Theory of Petri Nets
Forward analysis of depth-bounded processes
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
On the relationship between spatial logics and behavioral simulations
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
Ideal abstractions for well-structured transition systems
VMCAI'12 Proceedings of the 13th international conference on Verification, Model Checking, and Abstract Interpretation
Multiset rewriting for the verification of depth-bounded processes with name binding
Information and Computation
Accelerations for the Coverability Set of Petri Nets with Names
Fundamenta Informaticae - Applications and Theory of Petri Nets and Other Models of Concurrency, 2010
The theory of WSTS: the case of complete WSTS
PETRI NETS'12 Proceedings of the 33rd international conference on Application and Theory of Petri Nets
Efficient coverability analysis by proof minimization
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
Well-Structured pushdown systems
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
Minimal Coverability Set for Petri Nets: Karp and Miller Algorithm with Pruning
Fundamenta Informaticae - Applications and Theory of Petri Nets and Other Models of Concurrency, 2011
Old and New Algorithms for Minimal Coverability Sets
Fundamenta Informaticae - Application and Theory of Petri Nets and Concurrency, 2012
| Hi-index | 0.00 |
We describe a simple, conceptual forward analysis procedure for ***-complete WSTS $\mathfrak S$. This computes the clover of a state s 0 , i.e., a finite description of the closure of the cover of s 0 . When $\mathfrak S$ is the completion of a WSTS $\mathfrak X$, the clover in $\mathfrak S$ is a finite description of the cover in $\mathfrak X$. We show that this applies exactly when $\mathfrak X$ is an *** 2 -WSTS , a new robust class of WSTS. We show that our procedure terminates in more cases than the generalized Karp-Miller procedure on extensions of Petri nets. We characterize the WSTS where our procedure terminates as those that are clover-flattable . Finally, we apply this to well-structured counter systems.