445 search results - page 59 / 89 » Model Checking Quantitative Linear Time Logic |
136
click to vote
COCOON
2003
Springer
15 years 8 months ago
2003
Springer
We study the complexity of the reachability problem for a new subclass of Petri nets called simple-circuit Petri nets, which properly contains several well known subclasses such as...
137
Voted
FMCO
2007
Springer
15 years 9 months ago
2007
Springer
This article considers the coordination language Reo, a Petri net variant called zero-safe nets, and intuitionistic temporal linear logic (ITLL). The first part examines the seman...
123
Voted
CAV
2009
Springer
15 years 10 months ago
2009
Springer
The DPLL approach to the Boolean satisfiability problem (SAT) is a combination of search for a satisfying assignment and logical deduction, in which each process guides the other....
125
Voted
TLCA
2005
Springer
15 years 9 months ago
2005
Springer
We explore foundational typing support for strong updates — updating a memory cell to hold values of unrelated types at different points in time. We present a simple, but expres...
120
Voted
CSR
2008
Springer
15 years 5 months ago
2008
Springer
We define a denotational semantics for Light Affine Logic (LAL) which has the property that denotations of functions are polynomial time computable by construction of the model. Th...