5863 search results - page 78 / 1173 » On Model-Checking of P Systems |
108
Voted
FOSSACS
2008
Springer
15 years 2 months ago
2008
Springer
We study complexity issues related to the model-checking problem for LTL with registers (a.k.a. freeze LTL) over one-counter automata. We consider several classes of one-counter au...
194
click to vote
ASE
2011
14 years 7 months ago
2011
This paper introduces a technique for incremental and compositional model checking that allows efficient reuse of model-checking results associated with the features in a product l...
129
click to vote
IEAAIE
2011
Springer
14 years 4 months ago
2011
Springer
Using model checking to verify that interaction protocols have given properties is widely recognized as an important issue in multiagent systems where autonomous and heterogeneous ...
106
click to vote
CAV
2010
Springer
15 years 4 months ago
2010
Springer
Graded-CTL is an extension of CTL with graded quantifiers which allow to reason about either at least or all but any number of possible futures. In this paper we show an extension...
110
Voted
FOSSACS
2009
Springer
15 years 7 months ago
2009
Springer
Higher-order recursion schemes are systems of rewrite rules on typed non-terminal symbols, which can be used to define infinite trees. The Global Modal Mu-Calculus Model Checking...