Skip to main content

Advertisement

Springer Nature Link
Log in

Refinement of actions for real-time concurrent systems with causal ambiguity

  • Original Article
  • Published:
Acta Informatica Aims and scope Submit manuscript

Abstract

Refinement of actions is a core operation in the hierarchical design methodology for concurrent systems. In this paper, we develop an approach of action refinement for concurrent systems with not only the notation of real-time but also with causal ambiguity, which often exists and appears in real application areas. The systems are modeled in terms of a timed extension of bundle event structures with causal ambiguity. Under a certain partial order semantics, the behavior of the refined system can be inferred compositionally from the behavior of the original system and from the behavior of the systems used to refine actions with explicitly represented start points. A variant of a linear-time equivalence termed pomset trace equivalence and a variant of a branching-time equivalence termed history preserving bisimulation equivalence based on the partial order semantics are both congruences under the refinement. The refinement operation behaves thus well and meets the commonly expected properties.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Aceto, L., Murphy, D.: On the Ill-timed but well-caused. In: Concurrency, Lecture Notes in Computer Science. 715, 97–111 (1993)

    Google Scholar 

  2. Aceto, L., Murphy, D.: Timing and causality in process algebra. Acta Informatica. 33, 317–350 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  3. Alur, R., Dill, D.L.: A theory of timed automata. Theoretical Computer Science, 126, 183–235 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  4. Bolognesi, T., Ciaccio, G.: Cumulating constraints on the ‘When’ and ‘What’. FORTE'93, IFIP Trans. C-22, 433–448 (1994)

    Google Scholar 

  5. Bowman, H., Derrick, J.: Extending LOTOS with Time: A True Concurrency Perspective. Lecture Notes in Computer Science, 1231, 383–399 (1997)

    Google Scholar 

  6. Bergstra, J.A., Klop, J.W.: Algebra of communicating processes with abstraction. Theoretical Computer Science, 37(1), 77–121 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  7. Bowman, H., Katoen, J.-P.: A True Concurrency Semantics for ET-LOTOS. Proceedings Int. Conference on Applications of Concurrency to System Design, 228–239 (1998)

  8. Baier, C., Katoen, J.-P., Latella, D.: Metric Semantics for True Concurrent Real Time. In: Automata, Languages and Programming, Lecture Notes in Computer Science, 1443, 568–580, (1998)

    MathSciNet  Google Scholar 

  9. Castellano, L. Michelis, G., Pomello, L.: Concurrency vs Interleaving: An Instructive Example. Bull. EATCS, 31, 12–15 (1987)

    MATH  Google Scholar 

  10. Fecher, H. Majster-Cederbaum, M., Wu, J.: Bundle Event Structures: A Revised Cpo Approach. Information Processing Letters, 83, 7–12 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  11. Fecher, H., Majster-Cederbaum, M., Wu, J.: Refinement of actions in a real-time process algebra with a true concurrency model. Electronic Notes in Theoretical Computer Science, 70(3) (2002)

  12. Fecher, H., Majster-Cederbaum, M., Wu, J.: Action Refinement for Probabilistic Processes with True Concurrency Models. Lecture Notes in Computer Science, 2399, 77–94 (2002)

    MathSciNet  Google Scholar 

  13. Ferreira Pires, L.: Architectural Notes: A Framework for Distributed Systems Development. PhD thesis, University of Twente (1994)

  14. van Glabbeek, R.: The linear time-branching time spectrum. Lecture Notes in Computer Science, 458, 278–297 (1990)

    Google Scholar 

  15. van Glabbeek, R., Goltz, U.: Equivalence Notions for Concurrent Systems and Refinement of Actions. Lecture Notes in Computer Science, 379, 237–248 (1989)

    MathSciNet  Google Scholar 

  16. van Glabbeek, R., Goltz, U.: Refinement of actions in causality based models. In: REX Workshop on Stepwise Refinement of Distributed Systems, Lecture Notes in Computer Science, 430, 267–300 (1990)

    Google Scholar 

  17. van Glabbeek, R., Goltz, U.: Equivalences and Refinement. Lecture Notes in Computer Science, 469, 309–333 (1990)

    MathSciNet  Google Scholar 

  18. van Glabbeek, R., Goltz, U.: Refinement of Actions and Equivalence Notions for Concurrent Systems. Acta Informatica, 37, 229–327 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  19. Goltz, U., Gorrieri, R., Rensink, A.: On Syntactic and Semantic Action Refinement. Lecture Notes in Computer Science, 789, 385–404 (1994)

    Google Scholar 

  20. Gorrieri, R., Rensink, A.: Action Refinement. Handbook of Process Algebra, Elsevier Science, 1047–1147 (2001)

  21. Katoen, J.-P.: Quantitative and Qualitative Extensions of Event Structures. PhD thesis, University of Twente (1996)

  22. Katoen, J.-P., Baier, C., Latella, D.: Metric Semantics for True Concurrent Real Time. Th. Comp. Sci. 254(1–2), 501–542 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  23. Katoen, J.-P., Langerak, R., Brinksma, E., Latella, D., Bolognesi, T.: A Consistent Causality Based View on a Timed Process Algebra Including Urgent Interactions. Formal Meth. in Sys. Design, 12, 189–216 (1998)

    Article  Google Scholar 

  24. Katoen, J.-P., Langerak, R., Latella, D., Brinksma, E.: On specifying real-time systems in a causality-based setting. In: Formal Techniques in Real-Time and Fault-Tolerant Systems, Lecture Notes in Computer Science, 1135, 385–405 (1996)

    Google Scholar 

  25. Langerak, R.: Transformations and Semantics for LOTOS. PhD thesis, University of Twente (1992)

  26. Langerak, R.: Bundle Event Structures: A Non-Interleaving Semantics for LOTOS. In M. Diaz and R. Groz editors, Formal Description Techniques V, IFIP Transactions, C10, 331–346, (1993)

  27. Langerak, R., Brinksma, E., Katoen, J.-P.: Causal Ambiguity and Partial Orders in Event Structures. CONCUR'97, Lecture Notes in Computer Science, 1243, 317–331 (1997)

    MathSciNet  Google Scholar 

  28. Majster-Cederbaum, M., Wu, J.: Action Refinement for True Concurrent Real Time. Proc. ICECCS 2001, IEEE Computer Society Press, 58–68 (2001)

  29. Majster-Cederbaum, M., Wu, J.: Towards Action Refinement for True Concurrent Real Time. Acta Informatica, 39(8), 531–577 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  30. Majster-Cederbaum, M., Wu, J.: Adding Action Refinement to Stochastic True Concurrency Models. Lecture Notes in Computer Science, 2885, 226–245 (2003)

    Google Scholar 

  31. John A. McDermid. Software Hazard and Safety Analysis. Tutorial at FTRTEF 2002, Lecture Notes in Computer Science, 2469, 23–34 (2002)

  32. Murphy, D.: Time and Duration in Noninterleaving Concurrency. Fundamenta Informaticae, 19, 403–416 (1993)

    MATH  MathSciNet  Google Scholar 

  33. Nicollin, X., Sifakis, J.: An overview and synthesis on timed process algebra. in: Real-Time: Theory in Practice, Lecture Notes in Computer Science, 660, 526–548 (1992)

  34. Qin, G., Wu, J.: Action Refinement for Concurrent Processes with Urgency. J. Computer Sci. Technol. to appear (2005)

  35. Rensink, R.: Models and methods for action refinement. PhD thesis, University of Twente (1993)

  36. Rabinovich, A., Trakhtenbrot, B.A.: Behavior Structures and Nets. Fund. Info. 11(4), 357–404 (1988)

    MATH  MathSciNet  Google Scholar 

  37. van Sinderen, M., Ferreira Pires, L., Vissers, C.A., Katoen, J.-P.: A Design Model for Open Distributed Processing Systems. Computer Networks and ISDN Systems, 27, 1263–1285 (1995)

    Article  Google Scholar 

  38. de Weger, M.K., Franken, H., Vissers, C.A.: A Development Model for Distributed Information Systems. In: Proceedings of the 1st Int. Distributed Conference on High Performance Networking for Teleteaching (IDC'95) (1995)

  39. Winskel, G.: Events in Computation. PhD thesis, University of Edinburgh (1980)

  40. Winskel, G.: Event Structures. Lecture Notes in Computer Science, 255, 325–392 (1987)

    MathSciNet  Google Scholar 

  41. Winskel, G.; An introduction to event structures. Lecture Notes in Computer Science, 354, 364–397 (1989)

    MathSciNet  Google Scholar 

  42. Winskel, G., Nielsen, M.: Models for Concurrency. In Abramsky, S., Gabbay, D.M., Mailbaum, T.S.E., (eds.): Handbook of Logic in Computer Science, Vol. 4: 2–148, Oxford University Press (1995)

  43. Wu, J., Yue, H.: Towards action refinement for concurrent systems with causal ambiguity. Proc. SEFM 2004, IEEE Computer Society Press, 300–309 (2004)

  44. Yakovlev, A., Kishinevsky, M., Kondratyev, A., Lavagno, L.: On the models for asynchronous circuit behaviour with OR causality. Technical Report 463, University of Newcastle upon Tyne (1993)

Download references

Author information

Authors and Affiliations

  1. Fakultät für Mathematik und Informatik, Universität Mannheim, D7, 27, 68131, Mannheim, Germany

    Mila Majster-Cederbaum & Jinzhao Wu

  2. Chengdu Institute of Computer Applications, Chinese Academy of Sciences, Chengdu, 610041, China

    Jinzhao Wu & Houguang Yue

Authors
  1. Mila Majster-Cederbaum
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Jinzhao Wu
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Houguang Yue
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Mila Majster-Cederbaum.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Majster-Cederbaum, M., Wu, J. & Yue, H. Refinement of actions for real-time concurrent systems with causal ambiguity. Acta Informatica 42, 389–418 (2006). https://doi.org/10.1007/s00236-005-0172-4

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00236-005-0172-4

Keywords