A calculus of mobile processes, II
Information and Computation
A theory of bisimulation for the &lgr;-calculus
Acta Informatica
Locality and interleaving semantics in calculi for mobile processes
Theoretical Computer Science
Some congruence properties for &pgr;-calculus bisimilarities
Theoretical Computer Science
PI-Calculus: A Theory of Mobile Processes
PI-Calculus: A Theory of Mobile Processes
A LTS Semantics of Ambients via Graph Synchronization with Mobility
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
A Petri Net Semantics for pi-Calculus
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
The Fusion Calculus: Expressiveness and Symmetry in Mobile Processes
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Concurrent and Located Synchronizations in π-Calculus
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Electronic Notes in Theoretical Computer Science (ENTCS)
Typed Event Structures and the π-Calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
PRISMA: a mobile calculus with parametric synchronization
TGC'06 Proceedings of the 2nd international conference on Trustworthy global computing
Parametric synchronizations in mobile nominal calculi
Theoretical Computer Science
Concurrent and Located Synchronizations in π-Calculus
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
On the expressiveness of polyadic and synchronous communication in higher-order process calculi
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Concurrency can't be observed, asynchronously
APLAS'10 Proceedings of the 8th Asian conference on Programming languages and systems
Is it a "good" encoding of mixed choice?
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
Network Conscious π-calculus: A Concurrent Semantics
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
We present two novel semantics for 茂戮驴-calculus. The first allows one to observe on which channel a synchronization is performed, while the second allows concurrent actions, provided that they do not compete for resources. We present both a reduction and a labeled semantics, and show that they induce the same behavioral equivalence. As our main result we show that bisimilarity is a congruence for the concurrent semantics. This important property fails for the standard semantics.