2272 search results - page 387 / 455 » A Calculus for |
130
click to vote
CAV
2003
Springer
15 years 11 months ago
2003
Springer
The paper considers the problem of checking abstraction between two finite-state fair discrete systems (FDS). In automata-theoretic terms this is trace inclusion between two nond...
161
click to vote
EUROCAST
2003
Springer
15 years 11 months ago
2003
Springer
This paper explores the computational capacity of a novel local computational model that expands the conventional analogical and logical dynamic neural models, based on the charge ...
195
click to vote
EUROPAR
2003
Springer
15 years 11 months ago
2003
Springer
The growing success of wireless ad hoc networks and portable hardware devices presents many interesting problems to software engineers. Particular, coordination is a challenging t...
132
click to vote
FOSSACS
2003
Springer
15 years 11 months ago
2003
Springer
rized Verification by Probabilistic Abstraction . . . . . . . . . . . . . . . . 87 Tamarah Arons, Amir Pnueli, Lenore Zuck Genericity and the π-Calculus . . . . . . . . . . . . ....
160
click to vote
ICLP
2003
Springer
15 years 11 months ago
2003
Springer
Abstract The ntcc process calculus is a timed concurrent constraint programming (ccp) model equipped with a first-order linear-temporal logic (LTL) for expressing process specifi...