A fully abstract semantics for value-passing CCS for trees
Abstract
References
Index Terms
- A fully abstract semantics for value-passing CCS for trees
Recommendations
Value-passing CCS with noisy channels
Value-passing CCS, a full version of Milner's CCS, is a process algebra in which actions consist of sending and receiving values through noiseless communication channels. The full calculus is a succinct yet expressive language for the specification and ...
Normal Bisimulation for Higher Order Pi-Calculus with Unguarded Choice
TASE '13: Proceedings of the 2013 International Symposium on Theoretical Aspects of Software EngineeringIn this paper, we present a normal bisimulation for higher order p-calculus with unguarded choice and prove the coincidence between such normal bisimulation and context bisimulation for higher order p-calculus with unguarded choice. To achieve this aim, ...
Normal Bisimulation for Higher Order Pi-Calculus with Unguarded Choice
TASE '14: Proceedings of the 2014 Theoretical Aspects of Software Engineering Conference (tase 2014)In this paper, we present a normal bisimulation for higher order pi-calculus with unguarded choice and prove the coincidence between such normal bisimulation and context bisimulation for higher order pi-calculus with unguarded choice. To achieve this ...
Comments
Information & Contributors
Information
Published In
Publisher
Springer-Verlag
Berlin, Heidelberg
Publication History
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Other Metrics
Citations
View Options
View options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in