The following pages link to Objects in the \(\pi\)-calculus (Q1891152):
Displayed 22 items.
- \(\pi\)-calculus, internal mobility, and agent-passing calculi (Q671684) (← links)
- Locality and interleaving semantics in calculi for mobile processes (Q672123) (← links)
- Process algebras as support for sustainable systems of services (Q814902) (← links)
- Creol: A type-safe object-oriented model for distributed concurrent systems (Q854164) (← links)
- An interpretation of typed objects into typed \(\pi\)-calculus (Q1271311) (← links)
- Partial confluence of processes and systems of objects (Q1274970) (← links)
- On transformations of concurrent-object programs (Q1276245) (← links)
- Symmetric \(\pi\)-calculus (Q1389093) (← links)
- On the decidability of process equivalences for the \(\pi\)-calculus (Q1391099) (← links)
- Bisimulation congruence of \(\chi\)-calculus (Q1398380) (← links)
- Inheritance in the join calculus. (Q1426056) (← links)
- Actor languages. Their syntax, semantics, translation, and equivalence (Q1575845) (← links)
- Names of the \(\pi\)-calculus agents handled locally (Q1589648) (← links)
- A calculus for reasoning about software composition (Q1770365) (← links)
- Tile formats for located and mobile systems. (Q1854326) (← links)
- Decoding choice encodings (Q1854385) (← links)
- A formal semantics for DAI language NUML (Q1894325) (← links)
- Variations on mobile processes (Q1960530) (← links)
- The name discipline of uniform receptiveness (Q1960533) (← links)
- Mobile objects as mobile processes (Q2497145) (← links)
- Structured coalgebras and minimal HD-automata for the \(\pi\)-calculus (Q2566037) (← links)
- Minimality and separation results on asynchronous mobile processes -- representability theorems by concurrent combinators (Q5958469) (← links)