A non-interleaving denotational semantics of value passing CCS with action refinement

Authors:
Guang Zheng;Shaorong Li;Jinzhao Wu;Lian Li
Affiliations:
School of Information Science and Engineering, Lanzhou University, Lanzhou, China;College of opto-electronic Information, University of Electronic Science and Technology of China, Chengdu, China;College of opto-electronic Information, University of Electronic Science and Technology of China, Chengdu, China;School of Information Science and Engineering, Lanzhou University, Lanzhou, China
Venue:
FAW'07 Proceedings of the 1st annual international conference on Frontiers in algorithmics
Year:
2007

Citing 14
Cited 0

Communicating sequential processes

Communicating sequential processes
Action refinement in process algebras

Action refinement in process algebras
Towards action-refinement in process algebras

Information and Computation
Adding action refinement to a finite process algebra

Information and Computation
Program development by stepwise refinement

Communications of the ACM
Refinement of actions and equivalence notions for concurrent systems

Acta Informatica
Communication and Concurrency

Communication and Concurrency
Action Refinement for Probabilistic Processes with True Concurrency Models

PAPM-PROBMIV '02 Proceedings of the Second Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Local Model Checking for Value-Passing Processes (Extended Abstract)

TACS '97 Proceedings of the Third International Symposium on Theoretical Aspects of Computer Software
Adding Action Refinement to a Finite Process Algebra

ICALP '91 Proceedings of the 18th International Colloquium on Automata, Languages and Programming
On the Refinement and Simulation of Data Types and Processes

IFM '99 Proceedings of the 1st International Conference on Integrated Formal Methods
Refinement of Actions in Causality Based Models

Stepwise Refinement of Distributed Systems, Models, Formalisms, Correctness, REX Workshop
Action Refinement for True Concurrent Real Time

ICECCS '01 Proceedings of the Seventh International Conference on Engineering of Complex Computer Systems
Extended Symbolic Transition Graphs with Assignment

COMPSAC '05 Proceedings of the 29th Annual International Computer Software and Applications Conference - Volume 01

Quantified Score

Hi-index	0.00

Visualization

Abstract

Process algebra provides essential tools for studying concurrent systems. An important branch of process algebra is value passing CCS. However, value passing CCS lacks not only action refinement, which is an essential operation in the design of concurrent systems, but also non-interleaving semantics, which is appropriate to specify the partial order and equivalence relations. In this paper, we will define action refinement and non-interleaving semantics by valued stable event structures and valued labeled configuration structures in which special valued actions will be executed. The refinement operation and semantics are useful for the hierarchical design methodology in value passing CCS, e.g. top-down system design.