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
104
Voted
FM
2001
Springer
89
views
Formal Methods
»
more
FM 2001
»
Test-Case Calculation through Abstraction
15 years 8 months ago
Download
www.ist.tugraz.at
Bernhard K. Aichernig
claim paper
Read More »
125
Voted
FM
2001
Springer
108
views
Formal Methods
»
more
FM 2001
»
Improvements in BDD-Based Reachability Analysis of Timed Automata
15 years 8 months ago
Download
www.sosy-lab.org
To develop efficient algorithms for the reachability analysis of timed automata, a promising approach is to use binary decision diagrams (BDDs) as data structure for the representa...
Dirk Beyer
claim paper
Read More »
« first
‹ previous
1
2