Synthesising CCS bisimulation using graph rewriting (Q1004288)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Synthesising CCS bisimulation using graph rewriting	scientific article

Statements

scholarly article

0 references

Synthesising CCS bisimulation using graph rewriting (English)

0 references

0 references

0 references

0 references

Information and Computation

0 references

publication date

2 March 2009

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.ic.2008.10.005

0 references

0 references

Composition and Decomposition of DPO Transformations with Borrowed Context

0 references

The chemical abstract machine

0 references

Process Bisimulation Via a Graphical Encoding

0 references

Labelled Transitions for Mobile Ambients (As Synthesized via a Graphical Encoding)

0 references

Mobile ambients

0 references

An algebraic presentation of term graphs, via gs-monoidal categories

0 references

0 references

Fundamentals of algebraic graph transformation

0 references

Graph Transformations

0 references

Foundations of Software Science and Computation Structures

0 references

Deriving bisimulation congruences in the DPO approach to graph rewriting with borrowed contexts

0 references

Multisets and structural congruence of the pi-calculus with replication

0 references

Programming Languages and Systems

0 references

0 references

0 references

A Concurrent Graph Semantics for Mobile Ambients1 1Research partly supported by the EC TMR Network General Theory of Graph Transformation Systems (GETGRATS); by the EC Esprit WG Applications of Graph Transformations (APPLIGRAPH); and by the Italian MURST Project Teoria della Concorrenza, Linguaggi di Ordine Superiore e Strutture di Tipi (TOSCA).

0 references

Formal Methods in Software and Systems Modeling

0 references

Reactive Systems over Directed Bigraphs

0 references

Bigraphs and transitions

0 references

Adhesive and quasiadhesive categories

0 references

0 references

Behavioral theory for mobile ambients

0 references

0 references

Pure bigraphs: structure and dynamics

0 references

0 references

From rewrite rules to bisimulation congruences

0 references

Deriving Structural Labelled Transitions for Mobile Ambients

0 references

Explicit fusions

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

10.1016/J.IC.2008.10.005

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1004288

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1004288&oldid=38577054"