681 search results - page 81 / 137 » A Logic for True Concurrency |
173
click to vote
POPL
2009
ACM
16 years 16 days ago
2009
ACM
A concurrent data-structure implementation is considered nonblocking if it meets one of three following liveness criteria: waitfreedom, lock-freedom, or obstruction-freedom. Devel...
CEC
2008
IEEE
15 years 6 months ago
2008
IEEE
Abstract— Model Checking is a well-known and fully automatic technique for checking software properties, usually given as temporal logic formulae on the program variables. Most o...
IFIP
2004
Springer
15 years 5 months ago
2004
Springer
We introduce a new synchronization problem in mobile ad-hoc systems: the Driving Philosophers. In this problem, an unbounded number of driving philosophers (processes) access a rou...
107
click to vote
GECCO
2007
Springer
15 years 3 months ago
2007
Springer
Model Checking is a well-known and fully automatic technique for checking software properties, usually given as temporal logic formulae on the program variables. Most model checke...
ACSD
2008
IEEE
15 years 1 months ago
2008
IEEE
The design of complex concurrent systems often involves intricate performance and dependability considerations. Continuous-time Markov chains (CTMCs) are widely used models for co...