? 1 2 1 2
نویسندگان
چکیده
Tiles are rewrite rules with side e ects, reminiscent of both Plotkin SOS and Meseguer rewriting logic rules. They are well suited for modeling coordination languages, since they can be composed both statically and dynamically via possibly complex synchronization and workow mechanisms. In this paper, we give a tile-based bisimilarity semantics for the asynchronous -calculus of Honda and Tokoro and prove it equivalent to the ordinary semantics. Two kinds of tiles are provided: and . Activity tiles specify the basic interactions sequential processes are able to perform, without considering the operational environment where they live. Instead, coordination tiles control the global evolution of programs.
منابع مشابه
A Note on Dirac Spinors in a Non-flat Space-time of General Relativity
Some aspects of Dirac spinors are resumed and studied in order to interpret mathematically the P and T operations in a gravitational field. 1. Algebra and geometry of two-component spinors. From a mathematical point of view two-component spinors naturally arise when one tries to understand geometrically the well-known group homomorphism φ : SL(2,C) → SO(1, 3,R) (1.1) given by the following expl...
متن کاملDataset. Relationship between Urinary Level of Phytate and Valvular Calcification in an Elderly Population: a Cross-Sectional Study
Subject Urinary volume (mL) pH Phytate (mg/L) SEM Age (years) Sex (H:male; M:female) Height (m) Weight (kg) BMI (kg/m2) Diabetes_ 1yes_2not HTA_ 1yes_ 2not HCol_ 1yes_ 2not IRC_1 yes_2 not RenalLit _1yes_2 not ACV_ 1yes_ 2not IAM_ 1yes_ 2not EVPer_ 1yes_2 not Artr _1ye s_2n ot OPor. _1yes _2not Gout_ 1yes_ 2not C.Colon_ 1yes_2no t Cancer_ 1yes_2n ot AAS_ 1yes _2no t Ticlopid._ 1yes_2no t Estati...
متن کاملDECOMPOSITION OF PASCAL ’ S KERNELS MOD p s Richard
For a prime p we define Pascal’s Kernel K(p, s) = [k(p, s)ij] ∞ i,j=0 as the infinite matrix satisfying k(p, s)ij = 1 ps ( i+j j ) mod p if ( i+j j ) is divisible by p and k(p, s)ij = 0 otherwise. While the individual entries of Pascal’s Kernel can be computed using a formula of Kazandzidis that has been known for some time, our purpose here will be to use that formula to explain the global geo...
متن کاملAmicable orthogonal designs of order 8 for complex space-time block codes
New amicable orthogonal designs AODs(8; 1, 1, 1; 2, 2, 2), AODs(8; 1, 1, 4; 1, 2, 2), AODs(8; 1, 2, 2; 2, 2, 4), AODs(8; 1, 2, 2; 1, 2, 4), AODs(8; 1, 1, 2; 1, 2, 4), AODs(8; 1, 2, 4; 2, 2, 2), AODs(8; 1, 1, 4; 1, 1, 2, 2), AODs(8; 2, 2, 2, 2; 2, 2, 2, 2) and AODs(8; 1, 1, 1, 2; 1, 2, 2, 2) are found by applying a new theorem or by an exhaustive search. Also some previously undecided cases of a...
متن کاملEnhanced Symplectic Synchronization between Two Different Complex Chaotic Systems with Uncertain Parameters
and Applied Analysis 3 Equation (8) can be expressed as ̇ e 1 = − 2y 1 x 1 [a (x 2 − x 1 ) + x 4 ] − (1 + x 2 1 ) × [a 1 (y 2 − y 1 ) + y 4 ] − u 1 + 3x 2 4 (rx 4 + x 2 x 3 ) , ̇ e 2 = − 2y 2 x 2 (dx 1 + cx 2 − x 1 x 3 ) − (1 + x 2 2 ) × (b 1 y 1 − y 2 − y 1 y 3 ) − u 2 + 3x 2 1 [a (x 2 − x 1 ) + x 4 ] , ̇ e 3 = − 2y 3 x 3 (−bx 3 + x 1 x 2 ) − (1 + x 2 3 ) × (−c 1 y 3 + y 1 y 2 ) − u 3 + 3x 2 2 (d...
متن کاملLecture 11 – Two-level Constructions
For example, the case r = 2 corresponds to the construction R(2) = 1 SEQ(1) 2 SEQ(1 + 2) ∪ 2 SEQ(2) 1 SEQ(1 + 2) while the case r = 3 can be constructed as R(3) = 1 SEQ(1) 2 SEQ(1 + 2) 3 SEQ(1 + 2 + 3) ∪ 1 SEQ(1) 3 SEQ(1 + 3) 2 SEQ(1 + 2 + 3) ∪ 2 SEQ(2) 1 SEQ(1 + 2) 3 SEQ(1 + 2 + 3) ∪ 2 SEQ(2) 3 SEQ(2 + 3) 1 SEQ(1 + 2 + 3) ∪ 3 SEQ(2) 1 SEQ(1 + 3) 2 SEQ(1 + 2 + 3) ∪ 3 SEQ(2) 3 SEQ(2 + 3) 1 SEQ(1...
متن کامل