4 search results - page 1 / 1 » Model Checking FO(R) over One-Counter Processes and beyond |
105
Voted
CSL
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. One-counter processes are pushdown processes over a singleton stack alphabet (plus a stack-bottom symbol). We study the problems of model checking asynchronous products o...
82
Voted
LICS
2009
IEEE
15 years 7 months ago
2009
IEEE
—One-counter processes are pushdown systems over a singleton stack alphabet (plus a stack-bottom symbol). We study the complexity of two closely related verification problems ov...
111
Voted
ISQED
2008
IEEE
15 years 6 months ago
2008
IEEE
The effects of random variations during the manufacturing process on devices can be simulated as a variation of transistor parameters. Device degradation, due to temperature or vo...
139
Voted
PODS
1994
ACM
15 years 4 months ago
1994
ACM
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...