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
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
6
search results - page 2 / 2
»
Collapsible Pushdown Automata and Recursion Schemes
Sort
relevance
views
votes
recent
update
View
thumb
title
156
click to vote
PE
2011
Springer
214
views
Optimization
»
more
PE 2011
»
Time-bounded reachability in tree-structured QBDs by abstraction
14 years 10 months ago
Download
eprints.eemcs.utwente.nl
Structured QBDs by Abstraction Daniel Klink, Anne Remke, Boudewijn R. Haverkort, Fellow, IEEE, and Joost-Pieter Katoen, Member, IEEE Computer Society —This paper studies quantita...
Daniel Klink, Anne Remke, Boudewijn R. Haverkort, ...
claim paper
Read More »
« Prev
« First
page 2 / 2
Last »
Next »