Skip to main content
Conference Proceedings

Non interleaving process algebra

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1993) 715 LNCS 308-323
DOI: 10.1007/3-540-57208-2_22
7Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We study a non interleaving subalgebra of a reduct of a model of ACP. The model discussed uses step bisimulation semantics. We can derive identities in this model with the help of the (interleaving) ACP calculus with multi-actions. We study the connection with Petri nets, and introduce causalities and a causal state operator.

Author supplied keywords

Cite

CITATION STYLE

APA

Baeten, J. C. M., & Bergstra, J. A. (1993). Non interleaving process algebra. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 715 LNCS, pp. 308–323). Springer Verlag. https://doi.org/10.1007/3-540-57208-2_22

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free