Probabilistic Process Algebra and Strategic Interleaving

Autor: Cornelis A. Middelburg

Publikováno v: Scientific Annals of Computer Science, Vol XXX, Iss 2, Pp 205-243 (2020)

We first present a probabilistic version of ACP that rests on the principle that probabilistic choices are always resolved before choices involved in alternative composition and parallel composition are resolved and then extend this probabilistic ver

Externí odkaz: https://doaj.org/article/a882917dd0e64d5fa0ab8c64e88c4777

Are Two Binary Operators Necessary to Obtain a Finite Axiomatisation of Parallel Composition?

Autor: Luca Aceto, Valentina Castiglioni, Wan Fokkink, Anna Ingólfsdóttir, Bas Luttik

Publikováno v: ACM Transactions on Computational Logic, 23(4):22, 1-56. Association for Computing Machinery (ACM)
ACM Transactions on Computational Logic, 23(4):22. Association for Computing Machinery, Inc
Aceto, L, Castiglioni, V, Fokkink, W, Ingólfsdóttir, A & Luttik, B 2022, ' Are Two Binary Operators Necessary to Obtain a Finite Axiomatisation of Parallel Composition? ', ACM Transactions on Computational Logic, vol. 23, no. 4, 22, pp. 1-56 . https://doi.org/10.1145/3529535

Bergstra and Klop have shown that bisimilarity has a finite equational axiomatisation over ACP/CCS extended with the binary left and communication merge operators. Moller proved that auxiliary operators are necessary to obtain a finite axiomatisation

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fa7910a19045e6f8fc15641b740573d0
https://doi.org/10.1145/3529535

Parallel critical graphs

Autor: Karthika, Kumarasamy

Let G1 and G2 be two undirected graphs. Let u1, v1 ∈ V ( G1 ) and u2, v2 ∈ V ( G2 ). A parallel composition forms a new graph H that combines G1 and G2 by contracting the vertices u1 with u2 and v1 with v2. A new kind of graph called a parallel c

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=od______3401::5759d0b047fa2b13784fc3c39f7f11ee
https://hdl.handle.net/11729/5482

Controllable Deadlocks in Parallel Resource-Constrained Workflows

Autor: V. A. Bashkin, N. Yu. Panfilova

Publikováno v: Моделирование и анализ информационных систем, Vol 21, Iss 6, Pp 18-30 (2014)

We study the verification of the soundness property for workflow nets extended with resources. A workflow is sound if it terminates properly (no deadlocks and livelocks are possible). A class of resource-constrained workflow nets (RCWF-nets) is consi

Externí odkaz: https://doaj.org/article/fd9a483b592747bc8e13d217c5b9515c

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.