• Aucun résultat trouvé

[PDF] Top 20 Homotopy Bisimilarity for Higher-Dimensional Automata

Has 10000 "Homotopy Bisimilarity for Higher-Dimensional Automata" found on our website. Below are the top 20 most common "Homotopy Bisimilarity for Higher-Dimensional Automata".

Homotopy Bisimilarity for Higher-Dimensional Automata

Homotopy Bisimilarity for Higher-Dimensional Automata

... equivalence, higher-dimensional ...one, homotopy bisimilarity, which compares homotopy classes of ...Placing homotopy bisimulation on the spectrum of non-interleaving equiv- ... Voir le document complet

24

History-Preserving Bisimilarity for Higher-Dimensional Automata via Open Maps

History-Preserving Bisimilarity for Higher-Dimensional Automata via Open Maps

... Higher-dimensional automata (or HDA) is another non-interleaving formalism for reasoning about behavior of concurrent ...1991 for the purpose of a geometric interpretation to the theory ... Voir le document complet

21

History-Preserving Bisimilarity for Higher-Dimensional Automata via Open Maps

History-Preserving Bisimilarity for Higher-Dimensional Automata via Open Maps

... A cube path in a precubical set X is a morphism P → X from a path object P . Using the notion of adjacency from [7], [8], we can define what it means for two cube paths to be homotopic, i.e. to represent the same ... Voir le document complet

2

Partial Higher-Dimensional Automata

Partial Higher-Dimensional Automata

... decidable for finite partial ...into higher-dimensional trees, which are given as the equivalence classes of computation paths under a certain notion of homotopy of computations, rather ... Voir le document complet

16

Cubical categories for homotopy and rewriting

Cubical categories for homotopy and rewriting

... 1.2 Higher-dimensional rewriting 1.2.1 Squier’s theory and coherence theorems Squier’s homotopical theorem deals with the rewriting of monoids. Since then, it has been extended to other kinds of ... Voir le document complet

186

Towards a Higher-Dimensional String Theory for the Modeling of Computerized Systems

Towards a Higher-Dimensional String Theory for the Modeling of Computerized Systems

... frameworks for interactive system ...of automata and formal lan- guage theories is the domain of interactive system ...is automata, and the be- havior of these systems is commonly represented by the ... Voir le document complet

17

Higher dimensional extensions of substitutions
and their dual maps

Higher dimensional extensions of substitutions and their dual maps

... orientation). For the end of this proof, we need to check that the de nitions we gave for the substitutions are still valid for homomorphisms of free groups, see the last ...except for two ... Voir le document complet

20

The Averaging Homotopy

The Averaging Homotopy

... interesting for several reasons: it is very simple, it does kill the higher frequencies of f , and, in particular, it includes the classical averaging process for periodic functions, and it works in ... Voir le document complet

21

Weak CCP bisimilarity with strong procedures

Weak CCP bisimilarity with strong procedures

... model for con- currency that singles out the fundamental aspects of asynchronous systems whose agents (or processes) evolve by posting and querying (partial) information in a global ...medium. Bisimilarity ... Voir le document complet

43

Homotopy based algorithms for L0-regularized least-squares

Homotopy based algorithms for L0-regularized least-squares

... SBR terminates when ˆ J (S best ; λ) ≥ ˆ J (S; λ), i.e., when no single replacement can decrease the cost function. This occurs after a finite number of iterations because SBR is a descent algorithm and there are a ... Voir le document complet

39

Homotopy theory for algebras over polynomial monads

Homotopy theory for algebras over polynomial monads

... crucial for us. For a nice and instructive account of polynomial functors we recommend Kock’s article [31] from which we shall borrow the idea of representing coloured bouquets as certain special ... Voir le document complet

85

On the homotopy groups of spheres in homotopy type theory

On the homotopy groups of spheres in homotopy type theory

... 2 for every even n, which proves that all groups of the form π 4n−1 (S 2n ) are infinite and that π 4 (S 3 ) is equal to either Z/2Z or ...in homotopy type theory because defining the set of singular ... Voir le document complet

188

JohnnyVon : self-replicating Automata in continuous two-dimensional space

JohnnyVon : self-replicating Automata in continuous two-dimensional space

... Time For the discrete elements in the state vector, there is a natural relation between changes in state and increments of time, when each unit of time is one step in the execution of ...JohnnyVon. For the ... Voir le document complet

28

Bisimilarity via unique-solution techniques

Bisimilarity via unique-solution techniques

... niques for proving bisimilarity ...equations. For instance, the theorem heavily relies on the sum operator { any other operator but pre x and sum is essentially for- ...languages for ... Voir le document complet

6

Automata for Unordered Trees

Automata for Unordered Trees

... (4.46) is such that L(A) = L(ξ A ), and furthermore the annotations of A are exactly those of ξ A . Conversely, given a formula ξ, we seek to construct an automaton A ξ recognising L(ξ). A little more work is required in ... Voir le document complet

40

Higher-order interpretations for higher-order complexity

Higher-order interpretations for higher-order complexity

... As for first-order interpretations, a lot of interesting terms computing polynomial time functions will not have any polynomial interpretation, ...to higher order. Moreover, we manage to give a uniform ... Voir le document complet

18

On Higher-Dimensional Fibonacci Numbers, Chebyshev Polynomials and Sequences of Vector Convergents

On Higher-Dimensional Fibonacci Numbers, Chebyshev Polynomials and Sequences of Vector Convergents

... 1. For m ≥ 3, it is expected that in general the resulting sequence of rational numbers will converge at a slower rate than that for the simple continued fraction expansion of a (m,j) 1 /a (m,k) 1 , as ... Voir le document complet

56

Reducing Weak to Strong Bisimilarity in CCP

Reducing Weak to Strong Bisimilarity in CCP

... complete for ccp (in the sense of Definition ...barbed bisimilarity ˙ ≈ sb [2] cannot be computed using the ccp partition refinement algorithm for (strong) bisimilarity ccp wrt to this ... Voir le document complet

16

An homotopy method for global optimization of continuous models

An homotopy method for global optimization of continuous models

... To cite this document: Alloula, Karim and Belaud, Jean Pierre and Le Lann, Jean- Marc An homotopy method for global optimization of continuous models. (2011) In: ICheaP-10, 10th International Conference on ... Voir le document complet

7

An index for Brouwer homeomorphisms and homotopy Brouwer theory

An index for Brouwer homeomorphisms and homotopy Brouwer theory

... proper homotopy streamlines, and from all the forward proper homotopy streamlines that meet only one of the O i ...are homotopy translation arcs in the non generalized mean- ...proper homotopy ... Voir le document complet

39

Show all 10000 documents...