725 search results - page 68 / 145 » Complexity of Computing with Extended Propositional Logic Pr... |
182
click to vote
ICCS
2009
Springer
16 years 17 days ago
2009
Springer
We present a modular approach to realizing fine-grained adaptation of program behavior in a parallel environment. Using a compositional framework based on function call intercepti...
163
click to vote
AUTOMATICA
2008
15 years 6 months ago
2008
This paper focuses on the NP-hard problem of reducing the complexity of piecewise polyhedral systems (e.g. polyhedral piecewise affine (PWA) systems). The results are fourfold. Fi...
165
click to vote
ICALP
2005
Springer
15 years 11 months ago
2005
Springer
Bigraphs are emerging as a (meta-)model for concurrent calculi, like CCS, ambients, πcalculus, and Petri nets. They are built orthogonally on two structures: a hierarchical place...
203
click to vote
CONCUR
1991
Springer
15 years 9 months ago
1991
Springer
Abstract. A syntax-directed formal system for the development of totally correct programs with respect to an (unfair) shared-state parallel programming language is proposed. The pr...
153
click to vote
LPNMR
1997
Springer
15 years 10 months ago
1997
Springer
We present a bottom-up algorithm for the computation of the well-founded model of non-disjunctive logic programs which is based on the set of elementary program transformations stu...