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
126
search results - page 26 / 26
»
Modal Logic in Two Gestalts
Sort
relevance
views
votes
recent
update
View
thumb
title
171
click to vote
STACS
2010
Springer
157
views
Theoretical Computer Science
»
more
STACS 2010
»
Branching-time Model Checking of One-counter Processes
16 years 28 days ago
Download
hal.inria.fr
One-counter processes (OCPs) are pushdown processes which operate only on a unary stack alphabet. We study the computational complexity of model checking computation tree logic (CT...
Stefan Göller, Markus Lohrey
claim paper
Read More »
« Prev
« First
page 26 / 26
Last »
Next »