Action Refinement for Probabilistic Processes with True Concurrency Models

In this paper, we develop techniques of action refinement for probabilistic processes within the context of a probabilistic process algebra. A semantic counterpart is carried out in a non-interleaving causality based setting, probabilistic bundle event structures. We show that our refinement notion has the following nice properties: the behaviour of the refined system can be inferred compositionally from the behaviour of the original system and from the behaviour of the systems substituted for actions; the probabilistic extensions of pomset trace equivalence and history preserving bisimulation equivalence are both congruences under the refinement; and with respect to a cpo-based denotational semantics the syntactic and semantic refinements coincide with each other up to the aforementioned equivalence relations when the internal actions are abstracted away.

[1]  Joost-Pieter Katoen,et al.  On Generative Parallel Composition , 1998, PROBMIV.

[2]  Rita Loogen,et al.  Modelling nondeterministic concurrent processes with event structures , 1991, Fundam. Informaticae.

[3]  David Murphy,et al.  Real-Timed Concurrent Refineable Behaviours , 1992, FTRTFT.

[4]  Howard Bowman,et al.  Extending LOTOS with Time: A True Concurrency Perspective , 1997, ARTS.

[5]  Jinzhao Wu,et al.  Refinement of actions in a real-time process algebra with a true concurrency model , 2002, Electron. Notes Theor. Comput. Sci..

[6]  Jinzhao Wu,et al.  Action refinement for true concurrent real time , 2001, Proceedings Seventh IEEE International Conference on Engineering of Complex Computer Systems.

[7]  Christel Baier,et al.  Metric semantics for true concurrent real time , 2001, Theor. Comput. Sci..

[8]  Maria Sorea,et al.  A Priori Verification of Reactive Systems , 2000, FORTE.

[9]  Jinzhao Wu,et al.  Bundle event structures: A revised cpo approach , 2002, Inf. Process. Lett..

[10]  Joost-Pieter Katoen,et al.  A Probabilistic Extension of UML Statecharts , 2002, FTRTFT.

[11]  Ursula Goltz,et al.  Refinement of actions and equivalence notions for concurrent systems , 2001, Acta Informatica.

[12]  Mila E. Majster-Cederbaum,et al.  Correctness by Construction: Towards Verification in Hierarchical System Development , 2000, SPIN.

[13]  Arend Rensink,et al.  Action Refinement , 1999, Handbook of Process Algebra.

[14]  John Zic.  Time-constrained buffer specifications in CSP + T and timed CSP , 1994, TOPL.

[15]  Joost-Pieter Katoen,et al.  A true concurrency semantics for ET-LOTOS , 1998, Proceedings 1998 International Conference on Application of Concurrency to System Design.

[16]  C. A. R. Hoare,et al.  Communicating Sequential Processes (Reprint) , 1983, Commun. ACM.

[17]  L. Aceto.  Action refinement in process algebras , 1992 .

[18]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[19]  Joost-Pieter Katoen,et al.  Quantitative and Qualitative Extensions of Event Structures , 1996 .

[20]  Tommaso Bolognesi,et al.  Tableau methods to describe strong bisimilarity on LOTOS processes involving pure interleaving and enabling , 1994, FORTE.

[21]  Bernhard Steffen,et al.  Reactive, Generative and Stratified Models of Probabilistic Processes , 1995, Inf. Comput..

[22]  Bernhard Steffen,et al.  Reactive, generative, and stratified models of probabilistic processes , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[23]  Luca Aceto,et al.  Adding Action Refinement to a Finite Process Algebra , 1991, Inf. Comput..

[24]  Diego Latella,et al.  On Specifying Real-Time Systems in a Causality-Based Setting , 1996, FTRTFT.

[25]  Diego Latella,et al.  Partial Order Models for Quantitative Extensions of LOTOS , 1998, Comput. Networks.