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, II
Information and Computation
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
From Rewrite to Bisimulation Congruences
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Deriving Bisimulation Congruences for Reactive Systems
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
From Process Calculi to Process Frameworks
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
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
Tutorial Introduction to Graph Transformation: A Software Engineering Perspective
ICGT '02 Proceedings of the First International Conference on Graph Transformation
Bigraphs as a Model for Mobile Interaction
ICGT '02 Proceedings of the First International Conference on Graph Transformation
Signaling-pathway-based molecular computing for efficient 3-SAT problem solving
Information Sciences—Informatics and Computer Science: An International Journal - Special issue: FEA 2002
Computation in networks of passively mobile finite-state sensors
Distributed Computing - Special issue: PODC 04
Transition systems, link graphs and Petri nets
Mathematical Structures in Computer Science
Electronic Notes in Theoretical Computer Science (ENTCS)
Encoding Distributed Process Calculi into LMNtal
Electronic Notes in Theoretical Computer Science (ENTCS)
Congruence Results of Scope Equivalence for a Graph Rewriting Model of Concurrent Programs
Proceedings of the 5th international colloquium on Theoretical Aspects of Computing
Network Applications of Graph Bisimulation
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
Open Petri Nets: Non-deterministic Processes and Compositionality
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
Abstract Semantics by Observable Contexts
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
Formal Aspects in Security and Trust
KES'10 Proceedings of the 14th international conference on Knowledge-based and intelligent information and engineering systems: Part I
Saturated LTSs for adhesive rewriting systems
ICGT'10 Proceedings of the 5th international conference on Graph transformations
The edge of graph transformation: graphs for behavioural specification
Graph transformations and model-driven engineering
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
The BRITNeY suite animation tool
ICATPN'06 Proceedings of the 27th international conference on Applications and Theory of Petri Nets and Other Models of Concurrency
Abstract machines of systems biology
Transactions on Computational Systems Biology III
LMNtal: a language model with links and membranes
WMC'04 Proceedings of the 5th international conference on Membrane Computing
Labels from reductions: towards a general theory
CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
Complete axioms for stateless connectors
CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
Observing reductions in nominal calculi via a graphical encoding of processes
Processes, Terms and Cycles
Formalising business process execution with bigraphs and reactive XML
COORDINATION'06 Proceedings of the 8th international conference on Coordination Models and Languages
Formally modeling the electricity grid with bigraphs
Proceedings of the Seventh Annual Workshop on Cyber Security and Information Intelligence Research
Static BiLog: a Unifying Language for Spatial Structures
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
Rule-based modelling of cellular signalling
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Coalgebraic models for reactive systems
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Reactive systems over directed bigraphs
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
BigActors: a model for structure-aware computation
Proceedings of the ACM/IEEE 4th International Conference on Cyber-Physical Systems
| Hi-index | 0.00 |
A notion of bigraph is introduced as a model of mobile interaction. A bigraph consists of two independent structures: a topograph representing locality and an edge net representing connectivity. Bigraphs are equipped with reaction rules to form bigraphical reactive systems (BRSs), which include versions of the π-calculus and the ambient calculus. A behavioural theory is established, using the categorical notion of relative pushout; it allows labelled transition systems to be derived uniformly for a wide variety of BRSs, in such a way that familiar behavioural preorders and equivalences, in particular bisimilarity, are congruential. An example of the derivation is discussed.