Abstract
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 in real application areas. The systems are modeled in terms of a timed extension of 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 chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bowman, H., Katoen, J.-P.: A True Concurrency Semantics for ET-LOTOS. In: Proceedings Int. Conference on Applications of Concurrency to System Design, pp. 228–239 (1998)
Castellano, L., Michelis, G., Pomello, L.: Concurrency vs Interleaving: An Instructive Example. Bull. EATCS 31, 12–15 (1987)
Fecher, H., Majster-Cederbaum, M., Wu, J.: Bundle Event Structures: A Revised Cpo Approach. Information Processing Letters 83, 7–12 (2002)
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)
Fecher, H., Majster-Cederbaum, M., Wu, J.: PROBMIV 2002, PAPM-PROBMIV 2002, and PAPM 2002. LNCS, vol. 2399, pp. 77–94 (2002)
van Glabbeek, R., Goltz, U.: Refinement of Actions and Equivalence Notions for Concurrent Systems. Acta Informatica 37, 229–327 (2001)
Goltz, U., Gorrieri, R., Rensink, A.: In: TACS 1994. LNCS, vol. 789, pp. 385–404 (1994)
Gorrieri, R., Rensink, A.: Action Refinement. In: Handbook of Process Algebra, pp. 1047–1147. Elsevier, Amsterdam (2001)
Katoen, J.-P.: Quantitative and Qualitative Extensions of Event Structures. PhD thesis, University of Twente (1996)
Katoen, J.-P., Baier, C., Latella, D.: Metric Semantics for True Concurrent Real Time. Th. Comp. Sci. 254(1-2), 501–542 (2001)
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)
Katoen, J.-P., Langerak, R., Latella, D., Brinksma, E.: On Specifying Real-Time Systems in a Causality-Based Setting. In: Jonsson, B., Parrow, J. (eds.) FTRTFT 1996. LNCS, vol. 1135, pp. 385–405. Springer, Heidelberg (1996)
Langerak, R.: Bundle Event Structures: A Non-Interleaving Semantics for LOTOS. In: Diaz, M., Groz, R. (eds.) Formal Description Techniques V. IFIP Transactions, vol. C-10, pp. 331–346 (1993)
Langerak, R., Brinksma, E., Katoen, J.-P.: Causal Ambiguity and Partial Orders in Event Structures. In: Mazurkiewicz, A., Winkowski, J. (eds.) CONCUR 1997. LNCS, vol. 1243, pp. 317–331. Springer, Heidelberg (1997)
Majster-Cederbaum, M., Wu, J.: Action Refinement for True Concurrent Real Time. In: Proc. ICECCS 2001, pp. 58–68. IEEE Computer Society Press, Los Alamitos (2001)
Majster-Cederbaum, M., Wu, J.: Towards Action Refinement for True Concurrent Real Time. Acta Informatica 39(8), 531–577 (2003)
Majster-Cederbaum, M., Wu, J.: Adding Action Refinement to Stochastic True Concurrency Models. In: Dong, J.S., Woodcock, J. (eds.) ICFEM 2003. LNCS, vol. 2885, pp. 226–245. Springer, Heidelberg (2003)
Murphy, D.: Time and Duration in Noninterleaving Concurrency. Fundamenta Informaticae 19, 403–416 (1993)
Rabinovich, A., Trakhtenbrot, B.A.: Behavior Structures and Nets. Fund. Info. 11(4), 357–404 (1988)
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)
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 1995) (1995)
Wu, J., Yue, H.: Towards Action Refinement for Concurrent Systems with Causal Ambiguity. In: Proc. SEFM 2004. IEEE Computer Society Press, Los Alamitos (2004) (to appear)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Majster-Cederbaum, M., Wu, J., Yue, H., Zhan, N. (2004). Refinement of Actions for Real-Time Concurrent Systems with Causal Ambiguity. In: Davies, J., Schulte, W., Barnett, M. (eds) Formal Methods and Software Engineering. ICFEM 2004. Lecture Notes in Computer Science, vol 3308. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30482-1_37
Download citation
DOI: https://doi.org/10.1007/978-3-540-30482-1_37
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23841-6
Online ISBN: 978-3-540-30482-1
eBook Packages: Springer Book Archive