1032 search results - page 77 / 207 » Extended Computation Tree Logic |
154
Voted
CONCUR
1992
Springer
15 years 7 months ago
1992
Springer
The states of a computing system bear information and change time, while its events bear time and change information. We develop a primitive algebraic model of this duality of tim...
152
click to vote
FCSC
2010
15 years 1 months ago
2010
Abstract Read-write locking is an important mechanism to improve concurrent granularity, but it is difficult to reason about the safety of concurrent programs with read-write locks...
148
Voted
WLP
1997
Springer
15 years 7 months ago
1997
Springer
eduction strategies for logic programs often use an abstraction operator to guarantee the niteness of the set of goals for which partial deductions are . Findingan abstraction ope...
125
Voted
CMSB
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. This paper presents a method for regulatory network reconstruction from experimental data. We propose a mathematical model for regulatory interactions, based on the work ...
154
Voted
CORR
2008
Springer
15 years 3 months ago
2008
Springer
The paper introduces the notion of off-line justification for Answer Set Programming (ASP). Justifications provide a graph-based explanation of the truth value of an atom w.r.t. a ...