• Aucun résultat trouvé

[PDF] Top 20 On the Complexity of Concurrent Multiset Rewriting

Has 10000 "On the Complexity of Concurrent Multiset Rewriting" found on our website. Below are the top 20 most common "On the Complexity of Concurrent Multiset Rewriting".

On the Complexity of Concurrent Multiset Rewriting

On the Complexity of Concurrent Multiset Rewriting

... While the complexity of the digital infrastructures surrounding us seems to increase continuously, autonomic computing appears as a promising paradigm to be ...explored. The quest for ... Voir le document complet

21

On the Complexity of Concurrent Multiset Rewriting

On the Complexity of Concurrent Multiset Rewriting

... in the runtime complexity of programs based on multiset ...rewriting. The motivation behind this work is the study of the complexity of ... Voir le document complet

18

Complexity of Acyclic Term Graph Rewriting

Complexity of Acyclic Term Graph Rewriting

... Graph Rewriting A graph rewrite rule over the signature F is a triple (G, l, r) where G is a TG over F and l, r ∈ N G are two distinguished nodes, denoting the root of the left- and ... Voir le document complet

19

Termination of Priority Rewriting - Extended version

Termination of Priority Rewriting - Extended version

... Second, the semantics of a PRS is not always clearly ...notion of unique sound and complete set of closed instances of the rules of the PRS, and it is shown that ... Voir le document complet

23

On Semi-Completeness of Term Rewriting Systems

On Semi-Completeness of Term Rewriting Systems

... Unit´e de recherche INRIA Lorraine, Technopˆole de Nancy-Brabois, Campus scientifique, ` NANCY 615 rue du Jardin Botanique, BP 101, 54600 VILLERS LES Unit´e de recherche INRIA Rennes, Ir[r] ... Voir le document complet

15

Computational semantics of terms rewriting systems

Computational semantics of terms rewriting systems

... L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignemen[r] ... Voir le document complet

101

Church-Rosser Properties of Normal Rewriting

Church-Rosser Properties of Normal Rewriting

... State of the art. Rewriting with rules only (when E and S are both empty) is called plain rewrit- ...Confluence of plain rewriting reduces, under a termination assumption, to the ... Voir le document complet

16

Generic Encodings of Constructor Rewriting Systems

Generic Encodings of Constructor Rewriting Systems

... Pierre-Etienne.Moreau@loria.fr Rewriting is a formalism widely used in computer science and mathematical ...logic. The classical formalism has been extended, in the context of functional ... Voir le document complet

20

Concurrent aspects

Concurrent aspects

... number of approaches for AOP of sequential programs have been proposed, most notably AspectJ ...tion of crosscutting concerns, are woven into a base application resulting in an executable sequential ... Voir le document complet

22

On Probabilistic Term Rewriting

On Probabilistic Term Rewriting

... plays the role of a reduction sequence, usually a (possibly infinite) sequence a1 → a2 → .... of states, is a sequence µ1 µ 2 . . . of (multi)distributions over the set of ... Voir le document complet

17

The State-of-the-Art in Concurrent, Distributed Configuration Management

The State-of-the-Art in Concurrent, Distributed Configuration Management

... periods of time, to allow a developer to experiment temporarily with a creative idea (later expanded to a full feature or thrown away), for quick bug fixes (later combined with other layers), or even as a sketch ... Voir le document complet

17

On the complexity of skew arithmetic

On the complexity of skew arithmetic

... eld of constants of characteristic zero, so that all eld operations can be carried out by ...and the derivation  = x @, where @ = @ /@x, it is well known [ 26 , 8 , 12 , 28 , 29 ] that the ... Voir le document complet

16

On Decidability of Concurrent Kleene Algebra

On Decidability of Concurrent Kleene Algebra

... in the literature are similar to those presented in Section ...some of them, highlighting the differences between these developments and our ...include the series-rational languages we use ... Voir le document complet

20

Complexity of the satisfactory partition problem

Complexity of the satisfactory partition problem

... graph, complexity, polynomial algorithm, ...GK00] the problem of deciding if a given graph has a vertex partition into two nonempty parts such that each vertex has at least as many neighbors in its ... Voir le document complet

13

On the Complexity of the Plantinga-Vegter Algorithm

On the Complexity of the Plantinga-Vegter Algorithm

... each of these three levels, hopefully showing the usefulness of the ...that the techniques in this paper can be readily applied to other subdivision based algorithms in computational ... Voir le document complet

33

The Complexity of the California Recall Election

The Complexity of the California Recall Election

... as the absolute vote of the top candidate decreases (McClintock < Bustamante < ...is the causal mechanism producing the vertical proximity effect? One possible answer, is voter ... Voir le document complet

12

On the communication complexity of multilateral trading

On the communication complexity of multilateral trading

... is the price to pay for the sim- plicity of our agent model based on the notion of rational- ...view of potential future rewards), then deals involving any number of ... Voir le document complet

8

Realizability of Concurrent Recursive Programs

Realizability of Concurrent Recursive Programs

... Introduction The analysis of a concurrent recursive program where several recursive threads access a shared memory is a difficult task due to the typically high complexity of ... Voir le document complet

16

On the complexity of partial derivatives

On the complexity of partial derivatives

... Organization of the paper In Section 2 we set up the notation for the rest of the paper, and give some elementary ...on the consideration of a single extremal ... Voir le document complet

19

On the complexity of the model checking problem

On the complexity of the model checking problem

... ON THE COMPLEXITY OF THE MODEL CHECKING PROBLEM ∗ FLORENT ...Abstract. The complexity of the model checking problem for various fragments of first-order ... Voir le document complet

30

Show all 10000 documents...