Abstract
The paper consists of two parts. In the first, an analytical algebra AFPi of finite nondeterministic concurrent processes is introduced. The semantics of processes specified by a formula of AFPi is characterized by a set of partial orders with "non-actions". The notion of process equivalence is introduced and its complete axiomatization is proposed.
The "descriptive" algebra AFPo for specifying structure of finite (acyclic) Petri nets is presented. The interrelation between AFPo and AFPi is investigated.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Petri C.A. Non-sequential processes. — ISF-Report-77.05, St.Augustin: Gesellschaft fur Mathematik und Datenverarbeitung, 1971, 31 p.
Petri C.A. Concurrency as a basis for system thinking. ISP-Report 78.06, St.Augustin:Gesellschaft fur Mathematik und Datenverarbeitung, 1978, 20 p.
Best E. The relative strength of K-density. — Lecture Notes in Computer Science, Springer Verlag, Berlin, v. 84, 1980, p. 261–276.
Pratt V.R. Modelling Concurrency with Partial Orders. — International Journal of Parallel Programming, v. 15, No 1, 1987, p. 33–71.
Nielsen M., Plotkin G., Winskel G. Petri Nets, Event Structures and Domains. — Lecture Notes in Computer Science, Springer-Verlag, Berlin, v. 70, 1979, p. 266–284.
Kotov V.E., Cherkasova L.A. On structural properties of generalized processes. — Lecture Notes on Computer Science, v. 188, Springer Verlag, Berlin, 1984, p. 288–306.
Kotov V.E. An algebra for parallelism Based on Petri Nets. — Lecture Notes in Computer Science, Springer-Verlag, Berlin, v. 64, 1978, p. 39–55.
Kotov V.E., Cherkasova L.A. From Nets to Logic and Back in Specification of Process. — Concurrency and Nets. Springer-Verlag, Berlin, 1987, p. 253–268.
Kotov, V.E., Cherkasova L.A. On generalized process logic. — Lecture Notes in Computer Science, v. 278, Springer-Verlag, p. 246–250, 1987.
Milner R. A calculus for communicating systems. — Lecture Notes in Computer Science, Springer-Verlag, Berlin, v. 92, 1980.
Hoare C.A.R. Communicating sequential processes. — Prentice Hall International, 1985.
Lauer P.E., Torrigiani P.R., Shields M.W. COSY — A System Specification Language Based on Paths and Processes. Acta Informatica, vol. 12, p. 109–158, 1979.
Goltz U., Mycroft A. On the relationship of CCS and Petri Nets. Lectures Notes in Computer Science, Springer-Verlag, v. 172, p. 196–208, 1984.
Degano P., De Nicola R., Montanari U. CCS is an (Augmented) Contact-Free C/E Systems. Lecture Notes in Computer Science, Springer-Verlag, v. 280, p. 144–165, 1987.
Olderog E.R. TCSP: Theory of Communicating Sequential Processes. Lecture Notes in Computer Science, Springer-Verlag, v. 255, p. 441–465, 1987.
Brookes S.D., Hoare C.A.R., Rosque A.W. A theory of communicating sequential processes. J. ACM, v. 31, 1984, p. 560–599.
Milner R. Fully abstract models of typed-calculi. Theoretical Computer Science, v. 4, 1977, p. 1–22.
Hennessy M., Plotkin G.D. Full abstraction for a simple programming language. Lecture Notes in Computer Science, v. 74, 1979, p. 108–120.
Genrich H., Lautenbach K., Thiagarajan P.S. Elements of General Net Theory. Lecture Notes in Computer Science, v. 84, p. 21–164.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cherkasova, L.A., Kotov, V.E. (1990). Descriptive and analytical process algebras. In: Rozenberg, G. (eds) Advances in Petri Nets 1989. APN 1988. Lecture Notes in Computer Science, vol 424. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52494-0_26
Download citation
DOI: https://doi.org/10.1007/3-540-52494-0_26
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52494-6
Online ISBN: 978-3-540-46998-8
eBook Packages: Springer Book Archive