R. Bruni, D. de Frutos-Escrig, N. Mart-Oliet, and U. Montanari. Tile bisimilarity congruences for open terms and term graphs. Technical Report TR-00-06, Computer Science Department, University of Pisa, 2000.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....inference rules. In comparison with sos formats, tile logic o ers a straightforward extension of observational equivalence for open systems, which is ner and more elegant than the one obtained by closure under all ground substitutions. This point is made clear in [BdFEMOM00a] full version in [BdFEMOM00b]) 15 where, by analogy with the theory of sos formats, the meta theory of tile logic is investigated de ning several formats guaranteeing that tile bisimilarity is a congruence. Since con gurations and observations come equipped with the same basic algebraic operations, tile logic is suitable ....

R. Bruni, D. de Frutos-Escrig, N. Mart-Oliet, and U. Montanari. Tile bisimilarity congruences for open terms and term graphs. Technical Report TR-00-06, Computer Science Department, University of Pisa, 2000.

.... category D is an eight tuple (C; e; r; such that both the six tuples (C; e; r; and (C op ; e; are gs monoidal categories (where C op is the dual category of C) and satisfy a ; r a = id a r a ; a id a r a ; a = id a a ; a = id e 1 [1] 2 [2] 1 2 [1] 1 [1] 2] 1 [1] s 1 n . 1 [1] id 1 1;1 r 1 1 1 edge s : n 0 1 Fig. 3. P monoidal operators In order to model graphs we use a P monoidal category where the objects are of the form n, n 2 lN, e = 0 and n m is de ned as n m. If is a set of symbols each associated with a ....

.... (C; e; r; such that both the six tuples (C; e; r; and (C op ; e; are gs monoidal categories (where C op is the dual category of C) and satisfy a ; r a = id a r a ; a id a r a ; a = id a a ; a = id e 1 [1] 2 [2] 1 2 [1] 1 [1] [2] 1 [1] s 1 n . 1 [1] id 1 1;1 r 1 1 1 edge s : n 0 1 Fig. 3. P monoidal operators In order to model graphs we use a P monoidal category where the objects are of the form n, n 2 lN, e = 0 and n m is de ned as n m. If is a set of symbols each associated with a sort n 0, then ....

[Article contains additional citation context not shown here]

R. Bruni, D. Frutos-Escrig, N. Mart-Oliet, and U. Montanari. Tile bisimilarity congruences for open terms and term graphs. Technical Report TR-00-06, Dipartimento di Informatica, Universita di Pisa, 2000.

No context found.

Roberto Bruni, David de Frutos-Escrig, Narciso Mart'i-Oliet, and Ugo Montanari. Tile bisimilarity congruences for open terms and term graphs. Technical Report TR-00-06, Dipartimento di Informatica, Universit`a di Pisa, 2000. ftp://ftp.di.unipi.it/pub/techreports/TR-00-06.ps.Z.

....sets A and B is defined as the union of f0g A and f1g B. 20 BRUNI, MONTANARI AND SASSONE format, since the two formats are essentially the same. Moreover, for the monoidal and term tile formats the proof for a stronger result (namely that tile bisimilarity is a congruence) can be found e.g. in [5]. Note that in the presence of structural axioms on states, Proposition 3.3 cannot be applied unless all the tiles associated to structural axioms satisfy the basic source property (i.e. structural axioms must have the form f( x) g( x) for f; g 2 ) 4. DYNAMIC TILE BISIMULATION When the ....

R. Bruni, D. de Frutos-Escrig, N. Mart-Oliet, and U. Montanari. Tile bisimilarity congruences for open terms and term graphs. Technical Report TR-00-06, Computer Science Department, University of Pisa, 2000.

....in a mild way. Sections 3, 4 and 5 deal with mtf, ttf and gstf respectively, showing the main results of the paper, namely that for all of them the basic source implies that tile bisimilarity is a congruence. Due to space limitation, we omit all proofs, which can be found in the technical report [3]. Section 6 compares our approach with Rensink s proposal in [19] 1 Tiles and Bisimulation Notation. To ease the presentation we will consider only one sorted signatures, though our results extend to the many sorted case. A one sorted signature is a set of operators together with an arity ....

....The gstf provides a sound formal framework for the treatment of resource aware systems, previously missing in the literature. In many such cases the congruence proofs (via the decomposition property) can be carried out at the pictorial level as tile pastings (see details in the technical report [3]) Though at a rst look open systems seem just the natural extensions of closed systems, we have noted an initial classi cation that would distinguish between incomplete systems, which de ne the behavior (at the top level) of the system to be re ned by providing the corresponding components, and ....

R. Bruni, D. de Frutos-Escrig, N. Mart-Oliet, and U. Montanari. Tile bisimilarity congruences for open terms and term graphs. Technical Report TR-00-06, Computer Science Department, University of Pisa, 2000.

No context found.

R. Bruni, D. de Frutos-Escrig, N. Mart-Oliet, and U. Montanari. Tile bisimilarity congruences for open terms and term graphs. Technical Report TR-00-06, Computer Science Department, University of Pisa, 2000.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC