PI-Calculus: A Theory of Mobile Processes
PI-Calculus: A Theory of Mobile Processes
A type system for lock-free processes
Information and Computation - IFIP TCS2000
POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Computer
A generic type system for the Pi-calculus
Theoretical Computer Science
Axioms for bigraphical structure
Mathematical Structures in Computer Science
A general framework for types in graph rewriting
Acta Informatica - Special issue: Types in concurrency. Part II , Guest Editor: R. De Nicola, D. Sangiorgi
Typed polyadic pi-calculus in bigraphs
Proceedings of the 8th ACM SIGPLAN international conference on Principles and practice of declarative programming
Nordic Journal of Computing - Selected papers of the 17th nordic workshop on programming theory (NWPT'05), October 19-21, 2005
Transition systems, link graphs and Petri nets
Mathematical Structures in Computer Science
Local Bigraphs and Confluence: Two Conjectures
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
Bigraphical Semantics of Higher-Order Mobile Embedded Resources with Local Names
Electronic Notes in Theoretical Computer Science (ENTCS)
Pure bigraphs: Structure and dynamics
Information and Computation
Bigraphical models of context-aware systems
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
A new type system for deadlock-free processes
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
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 |
We propose a novel and uniform approach to type systems for (process) calculi, which roughly pushes the challenge of designing type systems and proving properties about them to the meta-model of bigraphs . Concretely, we propose to define type systems for the term language for bigraphs, which is based on a fixed set of elementary bigraphs and operators on these. An essential elementary bigraph is an ion , to which a control can be attached modelling its kind (its ordered number of channels and whether it is a guard), e.g. an input prefix of *** -calculus. A model of a calculus is then a set of controls and a set of reaction rules , collectively a bigraphical reactive system (BRS). Possible advantages of developing bigraphical type systems include: a deeper understanding of a type system itself and its properties; transfer of the type systems to the concrete family of calculi that the BRS models; and the possibility of modularly adapting the type systems to extensions of the BRS (with new controls). As proof of concept we present a model of a *** -calculus, develop an i/o-type system with subtyping on this model, prove crucial properties (including subject reduction) for this type system, and transfer these properties to the (typed) *** -calculus.