• Aucun résultat trouvé

[PDF] Top 20 Probabilistic pi-calculus and Event Structures

Has 10000 "Probabilistic pi-calculus and Event Structures" found on our website. Below are the top 20 most common "Probabilistic pi-calculus and Event Structures".

Probabilistic pi-calculus and Event Structures

Probabilistic pi-calculus and Event Structures

... free event structures are also known as concrete data structures [ 4 ], and their domain-theoretic counterpart are the concrete domains [ 17 ...localised and are independent from any ... Voir le document complet

17

A projective formalism applied to topoligical and probabilistic event structures

A projective formalism applied to topoligical and probabilistic event structures

... of event structures from a topological point of view and with probabilistic ...necessary and sufficient condition for Ω to be a projective limit of finite ...applies, and provides ... Voir le document complet

20

Moving from Event-B to Probabilistic Event-B

Moving from Event-B to Probabilistic Event-B

... Morgan and McIver [18] par- tially answer these ...refinement calculus where the refinement of probabilis- tic guarded commands (≡ assignements) is worked ...Method and the underlying guarded ... Voir le document complet

9

On differential interaction nets and the pi-calculus

On differential interaction nets and the pi-calculus

... machine, and arrows correspond to interactions between input and output prefixes of processes (and are labelled by the occurrences of these prefixes, specified by pairs of labels taken in a set L; ... Voir le document complet

52

Fully Abstract Models of the Probabilistic λ-calculus

Fully Abstract Models of the Probabilistic λ-calculus

... C), and likewise for (Π 2 x) T ...a probabilistic ∼-strategy, because σ and τ play on dual versions of B, making ambiguous the polarity of some ...S and T is obtained after hiding those moves ... Voir le document complet

18

Moving from Event-B to probabilistic Event-B

Moving from Event-B to probabilistic Event-B

... for Event-B: introducing probabilities in the three places where non-determinism appears in standard Event-B (between enabled events, on the parameter values choice and on non-deterministic ... Voir le document complet

23

A compositional semantics for the reversible pi-calculus

A compositional semantics for the reversible pi-calculus

... left and the empty stack being denoted by ...any event e = hi, k, αi, we say that i is the identifier of e, k is the identifier of its contextual cause and α its ...an event is used to record ... Voir le document complet

11

Intersection Types and Runtime Errors in the Pi-Calculus

Intersection Types and Runtime Errors in the Pi-Calculus

... -completeness) and Theorem ...Lago and Gaboardi 2011 ] is possible here, which would yield more practical type systems, necessarily sacrificing completeness but hopefully still of remarkable ... Voir le document complet

30

On the Representation of References in the pi-calculus

On the Representation of References in the pi-calculus

... such that P | `hni and Q | `hni are well-typed. We write P − `hni[m] −−−− → P 0 if P − `hni −− → P 00 and 418 P 0 = `hmi | P 00 , for some P 00 ; similarly for P − (νn)`hni[m] −−−−−−− → P 0 . Then, as ... Voir le document complet

27

On the Representation of References in the Pi-Calculus

On the Representation of References in the Pi-Calculus

... Transitions are defined in Figure 3. The symmetric versions of rules PAR, COM and CLOSE 727 are omitted. Weak transitions are defined by = ⇒ def = − → τ ∗ , = ⇒ µ def = = ⇒ − →= µ ⇒, and = ⇒ µ ˆ def = = ⇒ ... Voir le document complet

21

The Applied Pi Calculus: Mobile Values, New Names, and Secure Communication

The Applied Pi Calculus: Mobile Values, New Names, and Secure Communication

... study, and use an analogous uniform extension of the pi calculus, which we call the applied pi calculus (by analogy with “applied lambda ...pure pi calculus, we inherit ... Voir le document complet

111

Games and Strategies as Event Structures

Games and Strategies as Event Structures

... nets and in the adjunction laws (β and η-conversion) of cartesian closed or symmetric closed monoidal ...∗-autonomous, and a model of MLL [Gir87]): setting A ⊸ B = A ∗ ⊗ B, we have the adjunction A ⊗ ... Voir le document complet

50

Type Inference for the receptive distributed Pi-calculus

Type Inference for the receptive distributed Pi-calculus

... The type system we used is a simplified version of the simple type system of [HR98]; that is we use location types : : that records the names and types that may be used to communicate[r] ... Voir le document complet

34

Typechecking in the lambda-Pi-Calculus Modulo : Theory and Practice

Typechecking in the lambda-Pi-Calculus Modulo : Theory and Practice

... rewriting and typing are mutually ...reduction and systems with an untyped reduction is not easy to ...[Ada06] and Siles and Herbelin ...(typed and untyped) are equivalent: the set of ... Voir le document complet

169

Introducing Probabilistic Reasoning within Event-B

Introducing Probabilistic Reasoning within Event-B

... previous Event-B model a new event FailureDL , given in Fig ...download and incoming is chosen otherwise. This new event has the same guard as the event FinishDB ...time and the ... Voir le document complet

53

New applications of fractional calculus on probabilistic random variables

New applications of fractional calculus on probabilistic random variables

... S. and Roumeliotis J., Some inequalities for the ex- pectation and variance of a random variable whose PDF is n-time differentiable, ...S. and Roumeliotis ... Voir le document complet

9

A Fully Probabilistic Extension of Event-B

A Fully Probabilistic Extension of Event-B

... 4: Probabilistic plugin to the Rodin platform 5 Conclusion In this paper, we present an extension to Event-B that allows us to specify fully prob- abilistic ...probabilities and Event-B ... Voir le document complet

18

A lambda-calculus foundation for universal probabilistic programming

A lambda-calculus foundation for universal probabilistic programming

... imperative probabilistic pro- grams as partial measurable functions from infinite random traces to final states, which serves as the model for our trace ...Cousot and Monerau (2012) generalise Kozen’s ... Voir le document complet

15

Types for Complexity of Parallel Computation in Pi-Calculus

Types for Complexity of Parallel Computation in Pi-Calculus

... The methodology of our work is inspired by implicit computational com- plexity, which aims at characterizing complexity classes by means of dedicated programming languages, mainly in the sequential setting, for instance ... Voir le document complet

29

An Interpretation of Typed Objects Into Typed $\pi$-calculus

An Interpretation of Typed Objects Into Typed $\pi$-calculus

... Unite´ de recherche INRIA Lorraine, Technopoˆle de Nancy-Brabois, Campus scientifique, 615 rue du Jardin Botanique, BP 101, 54600 VILLERS LE`S NANCY Unite´ de recherche INRIA Rennes, Iri[r] ... Voir le document complet

44

Show all 10000 documents...