5863 search results - page 874 / 1173 » On Model-Checking of P Systems |
157
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Programs to solve so-called constraint problems are complex pieces of software which require many design decisions to be made more or less arbitrarily by the implementer. These dec...
185
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We investigate the asymptotic behavior of the steady-state queue length distribution under generalized maxweight scheduling in the presence of heavy-tailed traffic. We consider a s...
183
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We study the dynamics of the Naming Game [Baronchelli et al., (2006) J. Stat. Mech.: Theory Exp. P06014] in empirical social networks. This stylized agentbased model captures essen...
190
click to vote
FUIN
2008
15 years 6 months ago
2008
In this paper, we consider safe Time Petri Nets where time intervals (strict and large) are associated with places (P-TPN), arcs (A-TPN) or transitions (T-TPN). We give the formal ...
191
click to vote
CAL
2006
15 years 6 months ago
2006
Modern programming languages often include complex mechanisms for dynamic memory allocation and garbage collection. These features drive the need for more efficient implementation ...