Communicating sequential processes
Communicating sequential processes
Theoretical Computer Science
Selected papers of the Second Workshop on Concurrency and compositionality
Dynamic congruence vs. progressing bisimulation for CCS
Fundamenta Informaticae - Special issue on mathematical foundations of computer science '91
On reduction-based process semantics
Selected papers of the thirteenth conference on Foundations of software technology and theoretical computer science
The reflexive CHAM and the join-calculus
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
On bisimulations of the asynchronous &pgr;-calculus
Theoretical Computer Science
Communication and Concurrency
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
⊤⊤-closed relations and admissibility
Mathematical Structures in Computer Science
Parametric polymorphism and operational equivalence
Mathematical Structures in Computer Science
Recursive Polymorphic Types and Parametricity in an Operational Framework
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
CMSB'04 Proceedings of the 20 international conference on Computational Methods in Systems Biology
Towards a Unified Approach to Encodability and Separation Results for Process Calculi
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
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
On the Relative Expressive Power of Ambient-Based Calculi
Trustworthy Global Computing
On Convergence-sensitive Bisimulation and the Embedding of CCS in Timed CCS
Electronic Notes in Theoretical Computer Science (ENTCS)
On the Relative Expressive Power of Calculi for Mobility
Electronic Notes in Theoretical Computer Science (ENTCS)
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Deriving bisimulation congruences in the presence of negative application conditions
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Towards a unified approach to encodability and separation results for process calculi
Information and Computation
Deriving structural labelled transitions for mobile ambients
Information and Computation
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
Concurrency can't be observed, asynchronously
APLAS'10 Proceedings of the 8th Asian conference on Programming languages and systems
Deriving labels and bisimilarity for concurrent constraint programming
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
A timed calculus for wireless systems
Theoretical Computer Science
A timed calculus for wireless systems
FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
Towards a general theory of barbs, contexts and labels
APLAS'11 Proceedings of the 9th Asian conference on Programming Languages and Systems
| Hi-index | 0.00 |
We use the framework of biorthogonality to introduce a novel semantic definition of the concept of barb (basic observable) for process calculi. We develop a uniform basic theory of barbs and demonstrate its robustness by showing that it gives rise to the correct observables in specific process calculi which model synchronous, asynchronous and broadcast communication regimes.