Abstract
An incremental parametric model is presented that permits to recover different descriptions of concurrent systems. Given a calculus, its semantics is defined through a privileged transition system with transitions labelled by their proofs; then computations, i.e., paths in the transition system, are given a tree structure (proved trees). Different representation of the behaviour of a process are obtained by observing, via an observation function, the proved tree associated to the process. As an example, the paper shows how the interleaving, causal, and locational semantics are recovered, and shows how the corresponding bisimulations are compared, by a simple inspection of the used observation functions. Also, an algebra of proved trees is defined, and a generalized expansion law is exhibited. Through the appropriate observation function, this generalized law originates the analogous expansion law in the selected approach.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Austry, D. and Boudol, G. Algébre de Processus et Synchronization, T.C.S. 30, 1 (1984), 91–131.
Boudol, G., Castellani, I., A non-interleaving semantics for CCS based on proved transitions, Fundaments Informaticae, XI (4) (1988), 433–452.
Boudol, G., Castellani, I., Hennessy, M., Kiehn, A., Observing Localities, MFCS'91, LNCS 520, Springer-Verlag, 93-102.
Boudol, G., Castellani, I., Hennessy, M., Kiehn, A., A Theory of Processes with Localities, INRIA Tech. Rep., 1992
Brookes, S.D., Hoare, C.A.R., Roscoe, A.D. A Theory of Communicating Sequential Processes, Journal of A.C.M., 31, 3 (1984), 560–599.
Bergstra, J.A. and Klop, J.-W. Process Algebra for Synchronous Communication, Info. & Co., 61, (1984), 109–137.
Castellani, I., Private Communication, 1991.
Darondeau, Ph., Degano, P., Causal Trees, ICALP '89, LNCS 372, Springer-Verlag, 234–248.
Degano, P., De Nicola, R., Montanari, Partial Ordering Derivations for CCS, in Proc. FCT, LNCS 199, Springer-Verlag, 1985, 520–533.
Degano, P., De Nicola, R. e Montanari, U. Observational Congruences for Concurrency Models, In: Formal Description of Programming Concepts III (M. Wirsing Ed.), North-Holland, 1987, 105–132.
Degano, P., De Nicola, R. and Montanari, U. Partial Ordering Description of Nondeterministic Concurrent Systems, in Linear Time, Branching Time and Partial Orderd in Logic and Models for Concurrency, LNCS 354, Springer-Verlag, 1989, 438–466.
Degano, P., De Nicola, R., Montanari, U. A Partial Ordering Semantics for CCS, T.C.S., 75 (1990), 223–262.
Degano, P., De Nicola, R., Montanari, U. On the Operational Semantics of Distributed Concurrent Systems, in: Declarative Systems (G. David, R.T. Boute, and B.D. Shriver Eds) Proc. IFIP 10.1 Workshop, 1988, North-Holland, Amsterdam, 3–32, 1990.
Degano, P., De Nicola, R., Montanari, U. Universal Axioms for Bisimulations, submitted for publication.
Degano, P., Montanari, U. Concurrent Histories: A Basis for Observing Distributed Systems, J.C.S.S., 34, 1987, 422–461.
Ferrari, G.L., Montanari, U., Towards the Unification of Models for Concurrency in CAAP'90, LNCS 431, Springer-Verlag, 162–176.
Ferrari, G.L., Gorrieri, R., Montanari, U., An Extended Expansion Theorem, in TAPSOFT '91, LNCS 494, Springer-Verlag, 29–48.
van Glabbeek,R.J and Weijland,W.P. Branching Time and Abstraction in Bisimulation Semantics. Proc. IFIP '89 (G.X. Ritter, ed.), 1989, 613–618.
Hennessy, M., Milner, R. Algebraic Laws for Nondeterminsm and Concurrency, Journal of ACM, 32 (1985), 137–161.
Kiehn, A., Local and Global Causes, Report Technische Universität Munchen 342/23/91 A, 1991.
Milner, R. A Calculus of Communicating Systems. LNCS 92, Springer-Verlag, 1980.
Milner, R. Communicating and Concurrency. Prentice Hall Int., London 1989.
Montanari, U., Yankelevich, D., An Algebraic View of Interleaving and Distributed Operational Semantics for CCS, Category Theory and Computer Science '89, LNCS 389, Springer-Verlag, 5–20.
Montanari, U., Yankelevich, D., An Parametric Approach to Localities, This Volume.
Park, D. Concurrency and Automata on Infinite Sequences, in Proc. GI, LNCS, 104, 1981, 167–183.
Plotkin, G. A Structural Approach to Operational Semantics. Tech. Rep. DAIMI FN-19, Aarhus Univ., 1981.
Reisig, W. Petri Nets: An Introduction, EACTS Monographs on Theoretical Computer Science, 1985.
Rabinovich, A., Trakhtenbrot, B. Nets of Processes, Fundaments Informaticae XI (4), 1988, 357–404.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Degano, P., Priami, C. (1992). Proved trees. In: Kuich, W. (eds) Automata, Languages and Programming. ICALP 1992. Lecture Notes in Computer Science, vol 623. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55719-9_110
Download citation
DOI: https://doi.org/10.1007/3-540-55719-9_110
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55719-7
Online ISBN: 978-3-540-47278-0
eBook Packages: Springer Book Archive