24 search results - page 5 / 5 » Liveness and Fairness Properties in Multi-Agent Systems |
STACS
1999
Springer
13 years 9 months ago
1999
Springer
This paper presents a completeness result for a first-order interval temporal logic, called Neighbourhood Logic (NL) which has two neighbourhood modalities. NL can support the spe...
ATVA
2008
Springer
13 years 7 months ago
2008
Springer
Model checking has proven to be a useful analysis technique not only for concurrent systems, but also for the genetic regulatory networks (Grns) that govern the functioning of livi...
DC
2010
13 years 5 months ago
2010
Model checking software transactional memories (STMs) is difficult because of the unbounded number, length, and delay of concurrent transactions and the unbounded size of the memo...
CONCUR
2010
Springer
13 years 6 months ago
2010
Springer
Boolean notions of correctness are formalized by preorders on systems. Quantitative measures of correctness can be formalized by realvalued distance functions between systems, wher...