245 search results - page 16 / 49 » Efficient Symbolic Model Checking for Process Algebras |
108
click to vote
CORR
2010
Springer
14 years 9 months ago
2010
Springer
We introduce streaming data string transducers that map input data strings to output data strings in a single left-to-right pass in linear time. Data strings are (unbounded) seque...
FMICS
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. Quantitative analysis of quality-of-service metrics is an important tool in early evaluation of service provision. This analysis depends on being able to estimate the ave...
WEBI
2005
Springer
15 years 2 months ago
2005
Springer
In this paper, we present an efficient model for discovering repeated patterns in symbolic representations of music. Combinatorial redundancy inherent to the pattern discovery pa...
LICS
2009
IEEE
15 years 4 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...
FMCAD
2000
Springer
15 years 1 months ago
2000
Springer
Abstract. We consider the problem of refinement checking for asynchronous processes where refinement corresponds to stutter-closed language inclusion. Since an efficient algorithmi...