Conditional rewriting logic as a unified model of concurrency
Selected papers of the Second Workshop on Concurrency and compositionality
Selected papers of the Second Workshop on Concurrency and compositionality
An algebraic semantics for structured transition systems and its application to logic programs
Theoretical Computer Science - Selected papers of the 7th Annual Symposium on theoretical aspects of computer science (STACS '90) Rouen, France, February 1990
Dynamic congruence vs. progressing bisimulation for CCS
Fundamenta Informaticae - Special issue on mathematical foundations of computer science '91
Structured operational semantics and bisimulation as a congruence
Information and Computation
A calculus of mobile processes, II
Information and Computation
Journal of the ACM (JACM)
A theory of bisimulation for the &lgr;-calculus
Acta Informatica
Tile formats for located and mobile systems
Information and Computation - Special issue on EXPRESS 1997
Information and Computation - Special issue on EXPRESS 1997
Proof, language, and interaction
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Dynamic connectors for concurrency
Theoretical Computer Science
Comparing logics for rewriting: rewriting logic, action calculi and tile logic
Theoretical Computer Science - Rewriting logic and its applications
Executable Tile Specifications for Process Calculi
FASE '99 Proceedings of the Second Internationsl Conference on Fundamental Approaches to Software Engineering
Mapping tile logic into rewriting logic
WADT '97 Selected papers from the 12th International Workshop on Recent Trends in Algebraic Development Techniques
AMAST '02 Proceedings of the 9th International Conference on Algebraic Methodology and Software Technology
Compositionality Through an Operational Semantics of Contexts
ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
From Rewrite to Bisimulation Congruences
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
The Polyadic Pi-calculus (Abstract)
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
A Congruence Theorem for Structured Operational Semantics of Higher-Order Languages
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Cartesian Closed Double Categories, Their Lambda-Notation, and the Pi-Calculus
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Deriving bisimulation congruences using 2-categories
Nordic Journal of Computing
Symmetric monoidal and cartesian double categories as a semantic framework for tile logic
Mathematical Structures in 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
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Deriving weak bisimulation congruences from reduction systems
CONCUR 2005 - Concurrency Theory
Transition systems, link graphs and Petri nets
Mathematical Structures in Computer Science
Models of Computation: A Tribute to Ugo Montanari's Vision
Concurrency, Graphs and Models
| Hi-index | 0.00 |
The SOS formats that ensure that bisimilarity is a congruence tail in the presence ot structural axioms on states. Dynamic bisimulation, introduced to characterize the coarsest congruence for CCS which is also a weak bisimulation, reconciles the 'bisimilarity is a congruence' property with structural axioms and also with the specification of open ended systems, where states can be reconfigured at runtime. We show that the compositional framework offered by tile logic handles structural axioms and specifications of reconfigurable systems successfully. This allows for a finitary presentation of dynamic context closure, as internalized in the tile language. The case study of the π-calculus illustrates the main features of our approach. Moreover, duality is exploited to model a second kind of reconfiguration: dynamic specialization.