Selected papers of the Second Workshop on Concurrency and compositionality
A calculus of mobile processes, I
Information and Computation
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
From rewrite rules to bisimulation congruences
Theoretical Computer Science
PI-Calculus: A Theory of Mobile Processes
PI-Calculus: A Theory of Mobile Processes
An inductive view of graph transformation
WADT '97 Selected papers from the 12th International Workshop on Recent Trends in Algebraic Development Techniques
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
On Asynchronous Communication Semantics
ECOOP '91 Proceedings of the Workshop on Object-Based Concurrent Computing
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
A Mobile Computational model for Internet programming
ACM-SE 42 Proceedings of the 42nd annual Southeast regional conference
Axioms for bigraphical structure
Mathematical Structures in Computer Science
Typed polyadic pi-calculus in bigraphs
Proceedings of the 8th ACM SIGPLAN international conference on Principles and practice of declarative programming
Pure bigraphs: structure and dynamics
Information and Computation
Concurrent nets: a study of prefixing in process calculi
Theoretical Computer Science - Expressiveness in concurrency
Transition systems, link graphs and Petri nets
Mathematical Structures in Computer Science
Deriving bisimulation congruences in the DPO approach to graph rewriting with borrowed contexts
Mathematical Structures in Computer Science
Locating reaction with 2-categories
Theoretical Computer Science - Foundations of software science and computation structures
Electronic Notes in Theoretical Computer Science (ENTCS)
Mapping Fusion and Synchronized Hyperedge Replacement into logic programming
Theory and Practice of Logic Programming
Interactive Systems with Registers and Voices
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Local Bigraphs and Confluence: Two Conjectures
Electronic Notes in Theoretical Computer Science (ENTCS)
An Algebra for Directed Bigraphs
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
AGAPIA v0.1: A Programming Language for Interactive Systems and Its Typing System
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
Synthesising CCS bisimulation using graph rewriting
Information and Computation
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
Reactive systems, (semi-)saturated semantics and coalgebras on presheaves
Theoretical Computer Science
Relationally Staged Computations in Calculi of Mobile Processes
Electronic Notes in Theoretical Computer Science (ENTCS)
Synchronization Algebras with Mobility for Graph Transformations
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
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
Deriving bisimulation congruences: 2-categories vs precategories
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
Deriving bisimulation congruences with borrowed contexts
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
Interpreting a finitary pi-calculus in differential interaction nets
Information and Computation
DBtk: a toolkit for directed bigraphs
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
Efficient bisimilarities from second-order reaction semantics for π-calculus
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Bigraphical models of context-aware systems
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
Model checking for nominal calculi
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Synchronized hyperedge replacement for heterogeneous systems
COORDINATION'05 Proceedings of the 7th international conference on Coordination Models and Languages
Composition and decomposition of DPO transformations with borrowed context
ICGT'06 Proceedings of the Third international conference on Graph Transformations
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
Formalising business process execution with bigraphs and reactive XML
COORDINATION'06 Proceedings of the 8th international conference on Coordination Models and Languages
Interactive Systems with Registers and Voices
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Reactive systems over directed bigraphs
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
| Hi-index | 0.00 |
A bigraphical reactive system (BRS) involves bigraphs, in which the nesting of nodes represents locality, independently of the edges connecting them. BRSs represent a wide variety of calculi for mobility, including λ-calculus and ambient calculus. A labelled transition system (LTS) for each BRS is here derived uniformly, adapting previous work of Leifer and Milner, so that under certain conditions the resulting bisimilarity is automatically a congruence. For an asynchronous λ-calculus, this LTS and its bisimilarity agree closely with the standard.