G. L. Cattani and P. Sewell. Models for namepassing processes: Interleaving and causal. Technical report, Cambridge University Computer Laboratory, 2000.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....what it means for an equivalence to be a congruence. For this reason, I do not discuss them further and confine my attention to process calculi with compositional syntax. Hoare s work on Communicating Sequential Processes (CSP) Hoa78, Hoa85] and Milner s on Communicating Concurrent Systems (CCS) Mil80, Mil88] addressed the problem of comparing computations in a way that is sensitive to non determinism, and hence distinguishes a from b (the examples I gave earlier) Hoare s approach in CSP was to present every agent as an explicit set theoretic construction including, amongst other data, ....

....C 1 a 1 . The embeddings category is the right setting for analysing this: each embedding is a tuple of functions mapping the nodes and ports of one action graph into another. Thus, given two embeddings # i : a i b into the same action graph b = C 0 a 0 = C 1 a 1 , it is clear how the nodes and arcs of a 0 and a 1 overlap. The chapter defines embeddings and gives necessary and su#cient conditions for the existence of relative coproducts. A simple corollary then shows that su#cient RPOs exist in the contexts category provided that the redexes satisfy a constraint on their wiring. As a result, all of ....

[Article contains additional citation context not shown here]

G. L. Cattani and P. Sewell. Models for name-passing processes: interleaving and causal. In 15th Annual IEEE Symposium on Logic in Computer Science, 26--29 June

....be interesting to deal with unguarded recursion along the lines of [31] hence working with variable cpos instead of variable sets. Finally, there seems to be a tight correspondence between the coalgebras of our new behaviour for early bisimulation and the indexed labelled transition systems of [7]. We would like to investigate this for sheaves (in the Schanuel topos) rather than presheaves over I. 1. Basic syntactic and semantic structures 1.1. Expressions Syntax. Consider the following abstract grammar of expressions for integers e : x z e 1 plus e 2 e 1 minus e 2 (7) ....

G.-L. Cattani and P. Sewell. Models for name-passing processes: Interleaving and causal. In Proc. 15 th LICS Conf., pages 322--333. IEEE, Computer Society Press, 2000.

.... Marshalling could be addressed in the language semantics (though MiniCaml does not) If one wished to deal with marshallable values of extensible types (e.g. new channel names or cryptographic keys) then the de nition of thread LTS should be extended with renaming structure, along the lines of [CS00] 2.2.6 Network Operational Semantics Now we de ne an SOS to glue things together, making precise the synchronisations between threads, hosts, and network datagrams that were described informally above. The labels of a network are as those of threads and hosts, together with crash for machine ....

Gian Luca Cattani and Peter Sewell. Models for name-passing processes: Interleaving and causal (extended abstract). In Proceedings of LICS 2000: the 15th IEEE Symposium on Logic in Computer Science (Santa Barbara), pages 322-333, June 2000.

....structures which allow transitions as well as states to be indexed; the pay o for the extra complication being e.g. the possibility of using the notion of internal category to formally relate our Indexed Transition Systems with the standard ones. This paper is a full and extended version of [11]. 6 Out A xv:P xv P In A xp:P xv f v = p gP Tau A :P P Sum A P P 0 A P Q P 0 Par A P P 0 A P j Q P 0 j Q Com A P xv P 0 A Q xv Q 0 A P j Q ( fvg n A) P 0 j Q 0 ) Res A; x P P 0 x 62 ....

....inputs of old names when moving from a name set to a larger one. Finally, condition 4 ensures that the transitions out of a state which has been injectively renamed are 11 determined by those of the state itself (cf. the example properties of Section 2) Clause 4b di ers from that stated in [11] by requiring z 62 ran(f) in the presence of the other axioms the two are equivalent, but this version is more elegant and supports the de nition of N inj LTS in Section 7. In fact the de nition contains some redundancy: Proposition 3.5 Condition 3b shifting is implied by conditions 2a ....

G. L. Cattani and P. Sewell. Models for name-passing processes: Interleaving and causal (extended abstract). In LICS 2000, Proceedings of the Fifteenth Annual IEEE Symposium on Logic in Computer Science, pages 322-333. IEEE Computer Society Press, 2000.

....Asynchronous Transition Systems model for CCS like calculi [Bed88, Shi85, WN95] In each case we give a denotational semantics of a calculus; we prove the operational early and causal bisimulations [San93, BS98] coincide with model theoretic notions. In the full version of this extended abstract [CS00], we also investigate the properties of and relationship between categories of the two models, and give the omitted proofs. This is a rst step towards a uniform understanding of the semantics and operations of name passing calculi. Interleaving The standard notion of labelled transition system ....

....and independence relations. We discuss how the constructions of Section 5 can be extended to N LATS, de ne history preserving bisimulation and a name dependency aware variant (respectively distinguishing and identifying the example two processes above) and prove correspondence results. In [CS00] an abstract study of the structures de ned in this paper is initiated. Categories N LTS I of Indexed LTS and N LATS I of Indexed LATS (each for initial nameset I) are de ned. Their properties and mutual relationship are studied, as the rst step towards an abstract understanding of the ....

[Article contains additional citation context not shown here]

G. L. Cattani and P. Sewell. Models for namepassing processes: Interleaving and causal. Technical report, Cambridge University Computer Laboratory, 2000.

No context found.

G. L. Cattani and P. Sewell. Models for namepassing processes: Interleaving and causal. Technical report, Cambridge University Computer Laboratory, 2000.

No context found.

G.-L. Cattani and P. Sewell. Models for name-passing processes: Interleaving and causal. In Proc. 15 LICS Conf., pages 322--333. IEEE, Computer Society Press, 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