201 search results - page 26 / 41 » On the Decidability of Model-Checking for P Systems |
110
click to vote
IANDC
2011
14 years 6 months ago
2011
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a res...
182
click to vote
POPL
2006
ACM
16 years 4 hour ago
2006
ACM
We define a new fixpoint modal logic, the visibly pushdown ?-calculus (VP-?), as an extension of the modal ?-calculus. The models of this logic are execution trees of structured p...
184
click to vote
POPL
2005
ACM
16 years 4 hour ago
2005
ACM
While a typical software component has a clearly specified (static) interface in terms of the methods and the input/output types they support, information about the correct sequen...
FMCO
2009
Springer
14 years 9 months ago
2009
Springer
Abstract. The paradigms of service-oriented computing and modeldriven development are becoming of increasing importance in the field of software engineering. According to these par...
SOFSEM
2007
Springer
15 years 5 months ago
2007
Springer
Digital technology is increasingly deployed in safety-critical situations. This calls for systematic design and verification methodologies that can cope with three major sources o...