Resource access control in systems of mobile agents
Information and Computation
POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Global/Local Subtyping and Capability Inference for a Distributed pi-calculus
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Deriving bisimulation congruences using 2-categories
Nordic Journal of Computing
Typed behavioural equivalences for processes in the presence of subtyping
Mathematical Structures in Computer Science
Towards an algebraic theory of typed mobile processes
Theoretical Computer Science - Automata, languages and programming: Logic and semantics (ICALP-B 2004)
Pure bigraphs: structure and dynamics
Information and Computation
Locating reaction with 2-categories
Theoretical Computer Science - Foundations of software science and computation structures
Bigraphical models of context-aware systems
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
Labels from reductions: towards a general theory
CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
Electronic Notes in Theoretical Computer Science (ENTCS)
On the Construction of Sorted Reactive Systems
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Electronic Notes in Theoretical Computer Science (ENTCS)
Trustworthy Global Computing
An algebraic approach to image schemas for geographic space
COSIT'09 Proceedings of the 9th international conference on Spatial information theory
A graph syntax for processes and services
WS-FM'09 Proceedings of the 6th international conference on Web services and formal methods
An algebra of hierarchical graphs
TGC'10 Proceedings of the 5th international conference on Trustworthly global computing
Hierarchical models for service-oriented systems
Rigorous software engineering for service-oriented systems
Proceedings of the 27th Annual ACM Symposium on Applied Computing
A verification environment for bigraphs
Innovations in Systems and Software Engineering
| Hi-index | 0.00 |
Bigraphs have been introduced with the aim to provide a topographical meta-model for mobile, distributed agents that can manipulate their own communication links and nested locations. In this paper we examine a presentation of type systems on bigraphical systems using the notion of sorting. We focus our attention on the typed polyadic π-calculus with capability types à la Pierce and Sangiorgi, which we represent using a novel kind of link sorting called subsorting. Using the theory of relative pushouts we derive a labelled transition system which yield a coinductive characterisation of a behavioural congruence for the calculus. The results obtained in this paper constitute a promising foundation for the presentation of various type systems for the (polyadic) π-calculus as sortings in the setting of bigraphs