201 search results - page 20 / 41 » On the Decidability of Model-Checking for P Systems |
112
click to vote
CONCUR
2007
Springer
15 years 5 months ago
2007
Springer
The model checking problem for finite-state open systems (module checking) has been extensively studied in the literature, both in the context of environments with perfect and imp...
FMSD
2006
14 years 11 months ago
2006
We propose a refinement approach to language emptiness, which is based on the enumeration and the successive refinements of SCCs on over-approximations of the exact system. Our alg...
116
click to vote
JTRES
2010
ACM
14 years 12 months ago
2010
ACM
Chip-multiprocessors offer increased processing power at a low cost. However, in order to use them for real-time systems, tasks have to be scheduled efficiently and predictably. I...
157
click to vote
FASE
2004
Springer
15 years 3 months ago
2004
Springer
Real-Time Maude is a language and tool supporting the formal specification and analysis of real-time and hybrid systems. The specification formalism is based on rewriting logic, em...
128
click to vote
CORR
2009
Springer
14 years 9 months ago
2009
Springer
Abstract. We apply Uppaal Tiga to automatically compute adaptive scheduling strategies for an industrial case study dealing with a state-of-the-art image processing pipeline of a p...