201 search results - page 8 / 41 » On the Decidability of Model-Checking for P Systems |
154
click to vote
IPL
2010
15 years 4 months ago
2010
model checking via abstract interpretation N. De Francesco, G. Lettieri∗ , L. Martini, G. Vaglini Universit`a di Pisa, Dipartimento di Ingegneria dell’Informazione, sez. Inform...
166
Voted
QEST
2008
IEEE
16 years 9 days ago
2008
IEEE
In [3] a probabilistic semantics for timed automata has been defined in order to rule out unlikely (sequences of) events. The qualitative model-checking problem for LTL propertie...
161
click to vote
CONCUR
2004
Springer
15 years 9 months ago
2004
Springer
We introduce a generic family of behavioral relations for which the problem of comparing an arbitrary transition system to some finite-state specification can be reduced to a model...
154
click to vote
FOSSACS
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. Among the branching-time temporal logics used for the specification and verification of systems, CTL+ , FCTL and ECTL+ are the most notable logics for which the precise...
165
click to vote
ACSD
2008
IEEE
16 years 12 days ago
2008
IEEE
Synchronous systems can immediately react to the inputs of their environment which may lead to so-called causality cycles between actions and their trigger conditions. Systems wit...