A Theory of Communicating Sequential Processes
Journal of the ACM (JACM)
Communicating sequential processes
Communicating sequential processes
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Selected papers of the Second Workshop on Concurrency and compositionality
A calculus of mobile processes, I
Information and Computation
The reflexive CHAM and the join-calculus
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Bisimulation congruences in safe ambients
POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Information Processing Letters
A Calculus of Communicating Systems
A Calculus of Communicating Systems
POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A Spatial Logic for Concurrency
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
From Rewrite to Bisimulation Congruences
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Introduction to the Algebraic Theory of Graph Grammars (A Survey)
Proceedings of the International Workshop on Graph-Grammars and Their Application to Computer Science and Biology
FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
Nomadic Pict: Language and Infrastructure Design for Mobile Agents
ASAMA '99 Proceedings of the First International Symposium on Agent Systems and Applications Third International Symposium on Mobile Agents
The Fusion Calculus: Expressiveness and Symmetry in Mobile Processes
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Axioms for bigraphical structure
Mathematical Structures in Computer Science
Transition systems, link graphs and Petri nets
Mathematical Structures in Computer Science
Business Process Management: The Third Wave
Business Process Management: The Third Wave
Bisimulation proof methods for mobile ambients
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
The φ-calculus: a language for distributed control of reconfigurable embedded systems
HSCC'03 Proceedings of the 6th international conference on Hybrid systems: computation and control
Electronic Notes in Theoretical Computer Science (ENTCS)
Petri Nets, Discrete Physics, and Distributed Quantum Computation
Concurrency, Graphs and Models
On the Construction of Sorted Reactive Systems
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
A Decentralized Implementation of Mobile Ambients
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
Security, Cryptography and Directed Bigraphs
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
Reactive Systems, Barbed Semantics, and the Mobile Ambients
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Trustworthy Global Computing
A Higher-Order Graph Calculus for Autonomic Computing
Graph Theory, Computational Intelligence and Thought
Dynamic Compartments in the Imperative Π-Calculus
CMSB '09 Proceedings of the 7th International Conference on Computational Methods in Systems Biology
Formalising policies of a mLearning system using CCA
Proceedings of the 4th ACM International Workshop on Context-Awareness for Self-Managing Systems
Systemic computation using graphics processors
ICES'10 Proceedings of the 9th international conference on Evolvable systems: from biology to hardware
Environmental bisimulations for higher-order languages
ACM Transactions on Programming Languages and Systems (TOPLAS)
An algebra of hierarchical graphs
TGC'10 Proceedings of the 5th international conference on Trustworthly global computing
The Calculus of Context-aware Ambients
Journal of Computer and System Sciences
The edge of graph transformation: graphs for behavioural specification
Graph transformations and model-driven engineering
On GS-monoidal theories for graphs with nesting
Graph transformations and model-driven engineering
Hierarchical models for service-oriented systems
Rigorous software engineering for service-oriented systems
Bigraphical models of context-aware systems
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
Functorial boxes in string diagrams
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Process bisimulation via a graphical encoding
ICGT'06 Proceedings of the Third international conference on Graph Transformations
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Proceedings of the 27th Annual ACM Symposium on Applied Computing
Static BiLog: a Unifying Language for Spatial Structures
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
Toward a target and coupling function of three different Information Security Management Systems
Concurrency and Computation: Practice & Experience
Reactive systems over directed bigraphs
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
A verification environment for bigraphs
Innovations in Systems and Software Engineering
Hi-index | 0.00 |
Bigraphs are graphs whose nodes may be nested, representing locality, independently of the edges connecting them. They may be equipped with reaction rules, forming a bigraphical reactive system (Brs) in which bigraphs can reconfigure themselves. Following an earlier paper describing link graphs, a constituent of bigraphs, this paper is a devoted to pure bigraphs, which in turn underlie various more refined forms. Elsewhere it is shown that behavioural analysis for Petri nets, @p-calculus and mobile ambients can all be recovered in the uniform framework of bigraphs. The paper first develops the dynamic theory of an abstract structure, a wide reactive system (Wrs), of which a Brs is an instance. In this context, labelled transitions are defined in such a way that the induced bisimilarity is a congruence. This work is then specialised to Brss, whose graphical structure allows many refinements of the theory. The latter part of the paper emphasizes bigraphical theory that is relevant to the treatment of dynamics via labelled transitions. As a running example, the theory is applied to finite pure CCS, whose resulting transition system and bisimilarity are analysed in detail. The paper also mentions briefly the use of bigraphs to model pervasive computing and biological systems. computing and biological systems.