Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
3
search results - page 1 / 1
»
Expand, Enlarge, and Check: New Algorithms for the Coverabil...
Sort
relevance
views
votes
recent
update
View
thumb
title
18
click to vote
JCSS
2006
51
views
more
JCSS 2006
»
Expand, Enlarge and Check: New algorithms for the coverability problem of WSTS
13 years 8 months ago
Download
www.ulb.ac.be
Gilles Geeraerts, Jean-François Raskin, Lau...
claim paper
Read More »
17
click to vote
FSTTCS
2004
Springer
82
views
Software Engineering
»
more
FSTTCS 2004
»
Expand, Enlarge, and Check: New Algorithms for the Coverability Problem of WSTS
14 years 1 months ago
Download
www.ulb.ac.be
Gilles Geeraerts, Jean-François Raskin, Lau...
claim paper
Read More »
27
click to vote
CAV
2005
Springer
104
views
Hardware
»
more
CAV 2005
»
Expand, Enlarge and Check... Made Efficient
14 years 1 months ago
Download
www.ulb.ac.be
Abstract. The coverability problem is decidable for the class of wellstructured transition systems. Until recently, the only known algorithm to solve this problem was based on symb...
Gilles Geeraerts, Jean-François Raskin, Lau...
claim paper
Read More »
« Prev
« First
page 1 / 1
Last »
Next »