Sciweavers

28 search results - page 1 / 6
» Forward Analysis for WSTS, Part I: Completions
Sort
View
STACS
2009
Springer
14 years 2 months ago
Forward Analysis for WSTS, Part I: Completions
Well-structured transition systems provide the right foundation to compute a finite basis of the set of predecessors of the upward closure of a state. The dual problem, to compute...
Alain Finkel, Jean Goubault-Larrecq
ICALP
2009
Springer
14 years 7 months ago
Forward Analysis for WSTS, Part II: Complete WSTS
Abstract. We describe a simple, conceptual forward analysis procedure for complete WSTS S. This computes the clover of a state s0, i.e., a finite description of the closure of the ...
Alain Finkel, Jean Goubault-Larrecq
APN
2010
Springer
13 years 7 months ago
Forward Analysis for Petri Nets with Name Creation
Pure names are identifiers with no relation between them, except equality and inequality. In previous works we have extended P/T nets with the capability of creating and managing p...
Fernando Rosa Velardo, David de Frutos-Escrig
VMCAI
2012
Springer
12 years 2 months ago
Ideal Abstractions for Well-Structured Transition Systems
stractions for Well-Structured Transition Systems Damien Zufferey1 , Thomas Wies2 , and Thomas A. Henzinger1 1 IST Austria 2 New York University Many infinite state systems can be...
Damien Zufferey, Thomas Wies, Thomas A. Henzinger
CIKM
2009
Springer
14 years 1 months ago
Completing wikipedia's hyperlink structure through dimensionality reduction
Wikipedia is the largest monolithic repository of human knowledge. In addition to its sheer size, it represents a new encyclopedic paradigm by interconnecting articles through hyp...
Robert West, Doina Precup, Joelle Pineau