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
Journal of Computer Science and Technology
Operational Semantics for Real-Time Processes with Action Refinement
SEFM '05 Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods
Action Refinement for Real-Time Concurrent Processes with Urgency
Electronic Notes in Theoretical Computer Science (ENTCS)
SDL'03 Proceedings of the 11th international conference on System design
A non-interleaving denotational semantics of value passing CCS with action refinement
FAW'07 Proceedings of the 1st annual international conference on Frontiers in algorithmics
| Hi-index | 0.00 |
Abstract: Action refinement is an essential operation in the design of concurrent systems, real-time or not. In this paper we develop action refinement technique in a real-time non-interleaving causality based setting, a timed extension of bundle event structures that allows for urgent interactions to model timeout. Syntactic action refinement operation is presented in a timed process algebra based on the internationally standardised specification language LOTOS. We show that the behavior of the refined system can be inferred compositionally from the behavior of the original system and from the behaviors of the processes substituted for actions with explicitly represented start points, the timed versions of a linear-time equivalence, pomset trace equivalence, and a branching-time equivalence, history preserving bisimulation equivalence, are both congruences under our refinement, and the syntactic and semantic action refinements we developed coincide under these equivalence notions with respect to a metric and a c.p.o. based denotational semantics. Therefore our refinement operations behave well. They meet the commonly expected properties.