Journal of Automated Reasoning
Dynamic congruence vs. progressing bisimulation for CCS
Fundamenta Informaticae - Special issue on mathematical foundations of computer science '91
MFPS '92 Selected papers of the meeting on Mathematical foundations of programming semantics
A formal basis for architectural connection
ACM Transactions on Software Engineering and Methodology (TOSEM)
Anytime, anywhere: modal logics for mobile ambients
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Information and Computation - Special issue on EXPRESS 1997
Proof, language, and interaction
A Calculus of Communicating Systems
A Calculus of Communicating Systems
A Spatial Logic for Concurrency
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
Towards a Verification Logic for Rewriting Logic
WADT '99 Selected papers from the 14th International Workshop on Recent Trends in Algebraic Development Techniques
Symbolic Trace Analysis of Cryptographic Protocols
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
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
Bisimilarity Congruences for Open Terms and Term Graphs via Tile Logic
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Deriving Bisimulation Congruences for Reactive Systems
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
A Spatial Logic for Concurrency (Part II)
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Coordination for Orchestration
COORDINATION '02 Proceedings of the 5th International Conference on Coordination Models and Languages
PROCOMET '98 Proceedings of the IFIP TC2/WG2.2,2.3 International Conference on Programming Concepts and Methods
FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
Computing Symbolic Models for Verifying Cryptographic Protocols
CSFW '01 Proceedings of the 14th IEEE workshop on Computer Security Foundations
Observational congruences for dynamically reconfigurable tile systems
Theoretical Computer Science - Process algebra
A semantic framework for open processes
Theoretical Computer Science
G-Reactive Systems as Coalgebras
Electronic Notes in Theoretical Computer Science (ENTCS)
A Coalgebraic Theory of Reactive Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
On Symbolic Semantics for Name-decorated Contexts
Electronic Notes in Theoretical Computer Science (ENTCS)
Reactive systems, (semi-)saturated semantics and coalgebras on presheaves
Theoretical Computer Science
Deducing interactions in partially unspecified biological systems
AB'07 Proceedings of the 2nd international conference on Algebraic biology
Symbolic equivalences for open systems
GC'04 Proceedings of the 2004 IST/FET international conference on Global Computing
| Hi-index | 0.00 |
We propose a methodology for the analysis of open systems based on process calculi and bisimilarity. Open systems are seen as coordinators (i.e. terms with place-holders), that evolve when suitable components (i.e. closed terms) fill in their place-holders. The distinguishing feature of our approach is the definition of a symbolic operational semantics for coordinators that exploits spatial/modal formulae as labels of transitions and avoids the universal closure of coordinators w.r.t. all components. Two kinds of bisimilarities are then defined, called strict and large, which differ in the way formulae are compared. Strict bisimilarity implies large bisimilarity which, in turn, implies the one based on universal closure. Moreover, for process calculi in suitable formats, we show how the symbolic semantics can be defined constructively, using unification. Our approach is illustrated on a toy process calculus with ccs-like communication within ambients.