Selected papers of the Second Workshop on Concurrency and compositionality
A calculus of mobile processes, I
Information and Computation
On reduction-based process semantics
Selected papers of the thirteenth conference on Foundations of software technology and theoretical computer science
Handbook of graph grammars and computing by graph transformation
Communication and Concurrency
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
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
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
Observational congruences for dynamically reconfigurable tile systems
Theoretical Computer Science - Process algebra
Deriving weak bisimulation congruences from reduction systems
CONCUR 2005 - Concurrency Theory
Typed polyadic pi-calculus in bigraphs
Proceedings of the 8th ACM SIGPLAN international conference on Principles and practice of declarative programming
Transition systems, link graphs and Petri nets
Mathematical Structures in Computer Science
Locating reaction with 2-categories
Theoretical Computer Science - Foundations of software science and computation structures
Adhesive DPO Parallelism for Monic Matches
Electronic Notes in Theoretical Computer Science (ENTCS)
A semantic framework for open processes
Theoretical Computer Science
Synthesising CCS bisimulation using graph rewriting
Information and Computation
On Symbolic Semantics for Name-decorated Contexts
Electronic Notes in Theoretical Computer Science (ENTCS)
Making the Unobservable, Unobservable
Electronic Notes in Theoretical Computer Science (ENTCS)
Variable Binding, Symmetric Monoidal Closed Theories, and Bigraphs
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Algebra and logic for resource-based systems modelling
Mathematical Structures in Computer Science
Deriving structural labelled transitions for mobile ambients
Information and Computation
Efficient bisimilarities from second-order reaction semantics for π-calculus
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Saturated LTSs for adhesive rewriting systems
ICGT'10 Proceedings of the 5th international conference on Graph transformations
Symbolic equivalences for open systems
GC'04 Proceedings of the 2004 IST/FET international conference on Global Computing
Model checking for nominal calculi
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Labels from reductions: towards a general theory
CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
Process bisimulation via a graphical encoding
ICGT'06 Proceedings of the Third international conference on Graph Transformations
Observing reductions in nominal calculi via a graphical encoding of processes
Processes, Terms and Cycles
A modular LTS for open reactive systems
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
| Hi-index | 0.00 |
We introduce G-relative-pushouts (GRPO) which are a 2-categorical generalisation of relative-pushouts (RPO). They are suitable for deriving labelled transition systems (LTS) for process calculi where terms are viewed modulo structural congruence. We develop their basic properties and show that bisimulation on the LTS derived via GRPOs is a congruence, provided that sufficiently many GRPOs exist. The theory is applied to a simple subset of CCS and the resulting LTS is compared to one derived using a procedure proposed by Sewell.