5216 search results - page 503 / 1044 » Planning as Model Checking |
173
click to vote
ICFP
2007
ACM
16 years 6 months ago
2007
ACM
We present a model checker for verifying distributed programs written in the Erlang programming language. Providing a model checker for Erlang is especially rewarding since the la...
206
Voted
ICECCS
2010
IEEE
15 years 7 months ago
2010
IEEE
Abstract—Transactional Memory (TM) is a promising technique that addresses the difficulty of parallel programming. Since TM takes responsibility for all concurrency control, TM ...
206
Voted
ENTCS
2006
15 years 6 months ago
2006
Using graph transformation as a formalism to specify model transformation, termination and confluence of the graph transformation system are often required properties. Only under ...
168
Voted
ETFA
2008
IEEE
16 years 1 months ago
2008
IEEE
This paper presents an application for the automatic generation of Bond Graph models. The basis for this automated creation is a modified plant model in the XML-format according t...
246
click to vote
FMSB
2008
15 years 8 months ago
2008
We introduce bounded asynchrony, a notion of concurrency tailored to the modeling of biological cell-cell interactions. Bounded asynchrony is the result of a scheduler that bounds ...