Abstract
The hierarchical development of concurrent systems is investigated in a linguistic approach, by introducing a a new combinator for action refinement that substitutes a process for an action. In this way, the classic horizontal modularity is amalgamated with the new vertical one. The semantic definitions have been driven by two methodological criteria arising from a quest for compositionality that enforce to consider as atomic the behaviour of the processes refining actions. The first criterion requires that refinement must preserve the structure of the semantic object to be refined; the second one calls for a compositional refinement operation at the semantic level. Thus, refinement is not syntactic substitution, rather it is a compositional operation, which results to be context-free graph replacement of transition systems for transitions. The operational semantics implements this operation through states which are sort of stacks, used to make atomic the behaviour of processes refining actions; the denotational one uses tags expressing the start and the end of atomic sequences. Moreover, we define equivalences on both semantics, based on strong and rooted branching bisimulations, and we prove them congruences with respect to all the combinators of the language, and coincident.
Research partially supported by Hewlett-Packard, Pisa Science Center, Corso Italia 115, I-56100 Pisa, Italy.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Aceto L., Hennessy M., Towards Action Refinement in Process Algebra, Proc. LICS'89, 138–145, (1989).
Aceto L, Hennessy M., Adding Action Refinement to a Finite Process Algebra, Proc. ICALP'91, LNCS, (1991).
Boudol G., Atomic Actions, Bulletin of the EATCS 38, 136–144, (1989).
Boudol G., Castellani I., Concurrency and Atomicity, Theoretical Computer Science, 59, 25–84, (1988).
Bergstra J.A., Klop J.-W., Process Algebra for Synchronous Communication, Info and Co, 61, 109–137, (1984).
Castellano L., De Michelis G., Pomello L., Concurrency vs Interleaving: an Instructive Example, Bullettin of the EATCS 31, 12–15, (1987).
Darondeau Ph., Degano P., Causal Trees, in Proc. 11th ICALP, LNCS 372, 234–248, (1989).
Darondeau Ph., Degano P., Event Structures, Causal Trees, and Refinements, Proc. MFCS'90, LNCS 452, (1990).
Darondeau Ph., Degano P., About Semantic Action Refinement, Fundamenta Informaticae XIV, 221–234, (1991).
Degano, P., Gorrieri, R., Atomic Refinement for Process Description Languages, TR 17-91 HP Pisa Center, 1991.
Degano, P., Gorrieri, R., Parallel Procedure Call as Event Structure Substitution, preliminary report, March1991.
Gorrieri R., Refinement, Atomicity and Transactions, Ph.D. thesis, Uni. di Pisa, Dip. di Informatica, TD-2/91, 1991.
van Glabbeek R.J. and Goltz U., Refinement of Actions in Causality Based Models, in [26], 267–300.
Gorrieri R., Marchetti S. and Montanari U., A2CCS: Atomic Actions for CCS, T.C.S, 72, 203–223 (1990).
van Glabbeek R.J., Vaandrager F.W., Petri Nets Models for Algebraic Theories of Concurrency, Proc. PARLE, LNCS 259, 224–242, (1987).
van Glabbeek R.J., Weijland W.P., Branching Time and Abstraction in Bisimulation Semantics, Proc. IFIP'89, 613–618.
van Glabbeek R.J., Weijland W.P., Refinement in Branching Time Semantics, Proc. AMAST'89, 197–201, (1989).
Hoare C.A.R., Communicating Sequential Processes, Prentice Hall International, (1985).
Milner R., A Calculus of Communicating Systems, LNCS 92, (1980).
Milner R., Process Constructors and Interpretations, Proc. IFIP'86, (North-Holland), 507–514, (1986).
Milner R., Communication and Concurrency, Prentice Hall International, (1989).
Meseguer J., Montanari U., Petri Nets are Monoids, Information and Computation, 88 (2), 105–155, 1990.
Nielsen M., Engberg U., Larsen K.S., Fully Abstract Models for a Process Language with Refinement, Proc. REX School on Linear Time, Branching Time and Partial Order in Concurrency, LNCS 354, 523–548, (1989).
Nielsen M., Plotkin G., Winskel G., Petri Nets, Event Structures and Domains part I, TCS, 13, 85–108, (1981).
Pratt V.R., Modelling Concurrency with Partial Orders, Int. Journal of Parallel Prog., 15 (1), 33–71, 1986.
REX Workshop on Stepwise Refinement of Distributed Systems, Mook, 1989, LNCS 430, (1990).
Suzuki I, Murata T, A Method for Stepwise Refinement and Abstraction of Petri Nets, JCSS 27 (1), 51–76, (1983)
Valette R., Analysis of Petri Nets by Stepwise Refinements, J.C.S.S., 18, 47–64, (1979).
Vogler W., Fallure Semantics based on interval semiwords is a congruence for refinement, Distributed Computing 4, 139–162, (1991).
Winskel G., Synchronization Trees, Theoretical Computer Science, 34, 33–82, 1984.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Degano, P., Gorrieri, R. (1991). Atomic refinement in process description languages. In: Tarlecki, A. (eds) Mathematical Foundations of Computer Science 1991. MFCS 1991. Lecture Notes in Computer Science, vol 520. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54345-7_55
Download citation
DOI: https://doi.org/10.1007/3-540-54345-7_55
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54345-9
Online ISBN: 978-3-540-47579-8
eBook Packages: Springer Book Archive