Relevant bibliographies by topics / Process algebras / Journal articles
To see the other types of publications on this topic, follow the link: Process algebras.

Journal articles on the topic 'Process algebras'

Author: Grafiati
Published: 4 June 2021
Last updated: 13 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Process algebras.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Cleaveland, Rance, and Matthew Hennessy. "Priorities in process algebras." Information and Computation 87, no. 1-2 (July 1990): 58–77. http://dx.doi.org/10.1016/0890-5401(90)90059-q.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Parrow, Joachim. "Expressiveness of Process Algebras." Electronic Notes in Theoretical Computer Science 209 (April 2008): 173–86. http://dx.doi.org/10.1016/j.entcs.2008.04.011.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Console, Luca, Claudia Picardi, and Marina Ribaudo. "Process algebras for systems diagnosis." Artificial Intelligence 142, no. 1 (November 2002): 19–51. http://dx.doi.org/10.1016/s0004-3702(02)00292-8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Müffke, Friedger. "Process Algebras as Specification Language." Electronic Notes in Theoretical Computer Science 68, no. 5 (May 2003): 101–15. http://dx.doi.org/10.1016/s1571-0661(04)80522-x.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

van Glabbeek, Rob, and Frits Vaandrager. "Modular specification of process algebras." Theoretical Computer Science 113, no. 2 (June 1993): 293–348. http://dx.doi.org/10.1016/0304-3975(93)90006-f.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Kassem, M. S., and K. Rowlands. "Double multipliers andA*-algebras of the first kind." Mathematical Proceedings of the Cambridge Philosophical Society 102, no. 3 (November 1987): 507–16. http://dx.doi.org/10.1017/s0305004100067554.

Full text
Abstract:
LetAbe anA*-algebra and letdenote its auxiliary norm closure. The multiplier algebras of dualA*-algebras of the first kind have been studed by Tomiuk [12], [13] and Wong[15]. In this paper we study the double multiplier algebra ofA*-algebras of the first kind. In particular, we prove that, ifAis anA*-algebra of the first kind, then the double multiplier algebraM(A) ofAis *-isomorphic and (auxiliary norm) isometric to a subalgebra ofM(), extending in the process some results established by Tomiuk[12]. We also consider the embedding of the double multiplier algebra ofAin**, when the latter is regarded as an algebra with the Arens product, and, in particular, we show that, for an annihilator A*-algebra,M(A) is *-isomorphic and (auxiliary norm) isometric to**.
APA, Harvard, Vancouver, ISO, and other styles
7

Gruska, Damas P. "Quantifying Security for Timed Process Algebras." Fundamenta Informaticae 93, no. 1-3 (2009): 155–69. http://dx.doi.org/10.3233/fi-2009-0094.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Bodei, Chiara, Pierpaolo Degano, Riccardo Focardi, and Corrado Priami. "Primitives for authentication in process algebras." Theoretical Computer Science 283, no. 2 (June 2002): 271–304. http://dx.doi.org/10.1016/s0304-3975(01)00136-0.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Aceto, L., and M. Hennessy. "Towards Action-Refinement in Process Algebras." Information and Computation 103, no. 2 (April 1993): 204–69. http://dx.doi.org/10.1006/inco.1993.1019.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Corradini, Flavio. "On Performance Congruences for Process Algebras." Information and Computation 145, no. 2 (September 1998): 191–230. http://dx.doi.org/10.1006/inco.1998.2726.

Full text
APA, Harvard, Vancouver, ISO, and other styles
11

Kučera, Antonı́n, and Richard Mayr. "Simulation Preorder over Simple Process Algebras." Information and Computation 173, no. 2 (March 2002): 184–98. http://dx.doi.org/10.1006/inco.2001.3122.

Full text
APA, Harvard, Vancouver, ISO, and other styles
12

Rettelbach, M. "Probabilistic Branching in Markovian Process Algebras." Computer Journal 38, no. 7 (July 1, 1995): 590–99. http://dx.doi.org/10.1093/comjnl/38.7.590.

Full text
APA, Harvard, Vancouver, ISO, and other styles
13

Fecher, Harald. "Event Structures for Interrupt Process Algebras." Electronic Notes in Theoretical Computer Science 96 (June 2004): 113–27. http://dx.doi.org/10.1016/j.entcs.2004.04.024.

Full text
APA, Harvard, Vancouver, ISO, and other styles
14

Corradini, Flavio, and Rocco De Nicola. "Locality based semantics for process algebras." Acta Informatica 34, no. 4 (April 1, 1997): 291–324. http://dx.doi.org/10.1007/s002360050086.

Full text
APA, Harvard, Vancouver, ISO, and other styles
15

Achab, Dehbia. "Construction process for simple Lie algebras." Journal of Algebra 325, no. 1 (January 2011): 186–204. http://dx.doi.org/10.1016/j.jalgebra.2010.10.002.

Full text
APA, Harvard, Vancouver, ISO, and other styles
16

Hillston, Jane. "Stochastic process algebras and their markovian semantics." ACM SIGLOG News 5, no. 2 (April 30, 2018): 20–35. http://dx.doi.org/10.1145/3212019.3212023.

Full text
APA, Harvard, Vancouver, ISO, and other styles
17

Nicola, Rocco De, and Rosario Pugliese. "Linda-based applicative and imperative process algebras." Theoretical Computer Science 238, no. 1-2 (May 2000): 389–437. http://dx.doi.org/10.1016/s0304-3975(99)00339-4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
18

Corradini, Flavio. "Absolute versus Relative Time in Process Algebras." Electronic Notes in Theoretical Computer Science 7 (1997): 76–95. http://dx.doi.org/10.1016/s1571-0661(05)80468-2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
19

Corradini, Flavio. "Absolute versus Relative Time in Process Algebras." Information and Computation 156, no. 1-2 (January 2000): 122–72. http://dx.doi.org/10.1006/inco.1999.2821.

Full text
APA, Harvard, Vancouver, ISO, and other styles
20

Curcin, Vasa, Paolo Missier, and David De Roure. "Simulating Taverna workflows using stochastic process algebras." Concurrency and Computation: Practice and Experience 23, no. 16 (June 2, 2011): 1920–35. http://dx.doi.org/10.1002/cpe.1757.

Full text
APA, Harvard, Vancouver, ISO, and other styles
21

Hillston, J., M. Tribastone, and S. Gilmore. "Stochastic Process Algebras: From Individuals to Populations." Computer Journal 55, no. 7 (September 20, 2011): 866–81. http://dx.doi.org/10.1093/comjnl/bxr094.

Full text
APA, Harvard, Vancouver, ISO, and other styles
22

Hennessy, M., and H. Lin. "Proof systems for message-passing process algebras." Formal Aspects of Computing 8, no. 4 (July 1996): 379–407. http://dx.doi.org/10.1007/bf01213531.

Full text
APA, Harvard, Vancouver, ISO, and other styles
23

Corradini, Flavio, Domenicantonio D'Ortenzio, and Paola Inverardi. "On the Relationships among four Timed Process Algebras." Fundamenta Informaticae 38, no. 4 (1999): 377–95. http://dx.doi.org/10.3233/fi-1999-38403.

Full text
APA, Harvard, Vancouver, ISO, and other styles
24

Corradini, Flavio, Maria Rita Di Berardini, and Walter Vogler. "Read Operators and their Expressiveness in Process Algebras." Electronic Proceedings in Theoretical Computer Science 64 (August 20, 2011): 31–43. http://dx.doi.org/10.4204/eptcs.64.3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
25

Bernardo, Marco, and Mario Bravetti. "Performance measure sensitive congruences for Markovian process algebras." Theoretical Computer Science 290, no. 1 (January 2003): 117–60. http://dx.doi.org/10.1016/s0304-3975(01)00090-1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
26

Hermanns, H., U. Herzog, and V. Mertsiotakis. "Stochastic process algebras – between LOTOS and Markov chains." Computer Networks and ISDN Systems 30, no. 9-10 (May 1998): 901–24. http://dx.doi.org/10.1016/s0169-7552(97)00133-5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
27

Benson, David B., and Jerzy Tiuryn. "Fixed points in free process algebras, part I." Theoretical Computer Science 63, no. 3 (March 1989): 275–94. http://dx.doi.org/10.1016/0304-3975(89)90010-8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
28

Tiuryn, Jerzy, and David B. Benson. "Fixed points in free process algebras, part II." Theoretical Computer Science 70, no. 2 (January 1990): 179–92. http://dx.doi.org/10.1016/0304-3975(90)90121-w.

Full text
APA, Harvard, Vancouver, ISO, and other styles
29

Herzog, Ulrich. "Process algebras are getting mature for performance evaluation?!" ACM SIGMETRICS Performance Evaluation Review 27, no. 3 (December 1999): 15–18. http://dx.doi.org/10.1145/340242.340303.

Full text
APA, Harvard, Vancouver, ISO, and other styles
30

Bernardo, Marco, Paolo Ciancarini, and Lorenzo Donatiello. "Architecting families of software systems with process algebras." ACM Transactions on Software Engineering and Methodology (TOSEM) 11, no. 4 (October 2002): 386–426. http://dx.doi.org/10.1145/606612.606614.

Full text
APA, Harvard, Vancouver, ISO, and other styles
31

Petersson, Holger P., and Michel L. Racine. "Classification of algebras arising from the Tits process." Journal of Algebra 98, no. 1 (January 1986): 244–79. http://dx.doi.org/10.1016/0021-8693(86)90025-6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
32

Honda, Kohei. "Process Algebras in the Age of Ubiquitous Computing." Electronic Notes in Theoretical Computer Science 162 (September 2006): 217–20. http://dx.doi.org/10.1016/j.entcs.2006.01.032.

Full text
APA, Harvard, Vancouver, ISO, and other styles
33

Petersson, Holger P., and Maneesh Thakur. "The étale Tits process of Jordan algebras revisited." Journal of Algebra 273, no. 1 (March 2004): 88–107. http://dx.doi.org/10.1016/j.jalgebra.2002.10.002.

Full text
APA, Harvard, Vancouver, ISO, and other styles
34

Gilmore, S. "Process Algebras and Their Application to Performance Modelling: Proceedings of the Third Workshop on Process Algebra and Performance Modelling." Computer Journal 38, no. 7 (July 1, 1995): 489–91. http://dx.doi.org/10.1093/comjnl/38.7.489.

Full text
APA, Harvard, Vancouver, ISO, and other styles
35

Watanabe, Noboru. "An Entropy Based Treatment of Gaussian Communication Process for General Quantum Systems." Open Systems & Information Dynamics 20, no. 03 (September 2013): 1340009. http://dx.doi.org/10.1142/s123016121340009x.

Full text
Abstract:
The quantum entropy introduced by von Neumann around 1932 describes the amount of information of the quantum state itself. It was extended by Ohya for C*-systems before Conne-Narnhoffer-Thirring (CNT) entropy. The quantum relative entropy was first defined by Umegaki for σ-finite von Neumann algebras and it was subsequently extended by Araki and Uhlmann for general von Neumann algebras and *-algebras, respectively. By introducing a new notion, the so-called compound state, in 1983 Ohya succeeded to construct the mutual entropy in a complete quantum mechanical system (i.e., input state, output state and channel are all quantum mechanical) describing the amount of information correctly transmitted through the quantum channel. In this paper, we briefly review Ohya's S-mixing entropy and the quantum mutual entropy for general quantum systems. Based on a concept of structure equivalent, we apply the general framework of quantum communication to the Gaussian communication processes.
APA, Harvard, Vancouver, ISO, and other styles
36

WALICKI, MICHAŁ, MAGNE HAVERAAEN, and SIGURD MELDAL. "Computation Algebras." Mathematical Structures in Computer Science 11, no. 5 (September 25, 2001): 597–636. http://dx.doi.org/10.1017/s0960129501003292.

Full text
Abstract:
We introduce a framework that generalizes algebraic specifications by equipping algebras with descriptions of evaluation strategies. The resulting abstract mathematical description allows one to model the implementation of algebras on various platforms in a way that is independent of the function-oriented specifications.We study algebras with associated data dependencies. The latter provide separate means for modelling computational aspects apart from the functional specifications captured by an algebra. The formalization of evaluation strategies (1) introduces increased portability among different hardware platforms, and (2) allows a potential increase in execution efficiency, since a chosen evaluation strategy may be tailored to a particular platform. We present the development process where algebraic specifications are equipped with data dependencies, the latter are refined, and, finally, mapped to actual hardware architectures.
APA, Harvard, Vancouver, ISO, and other styles
37

Moy, Allen. "Distribution Algebras on p-adic Groups and Lie Algebras." Canadian Journal of Mathematics 63, no. 5 (October 18, 2011): 1137–60. http://dx.doi.org/10.4153/cjm-2011-025-3.

Full text
Abstract:
Abstract When F is a p-adic field, and is the group of F-rational points of a connected algebraic F-group, the complex vector space of compactly supported locally constant distributions on G has a natural convolution product that makes it into a ℂ-algebra (without an identity) called the Hecke algebra. The Hecke algebra is a partial analogue for p-adic groups of the enveloping algebra of a Lie group. However, has drawbacks such as the lack of an identity element, and the process is not a functor. Bernstein introduced an enlargement . The algebra consists of the distributions that are left essentially compact. We show that the process is a functor. If is a morphism of p-adic groups, let be the morphism of ℂ-algebras. We identify the kernel of in terms of Ker. In the setting of p-adic Lie algebras, with g a reductive Lie algebra, m a Levi, and the natural projection, we show that maps G-invariant distributions on to NG(m)-invariant distributions on m. Finally, we exhibit a natural family of G-invariant essentially compact distributions on g associated with a G-invariant non-degenerate symmetric bilinear form on g and in the case of SL(2) show how certain members of the family can be moved to the group.
APA, Harvard, Vancouver, ISO, and other styles
38

ABRAMS, GENE, and P. N. ÁNH. "SOME ULTRAMATRICIAL ALGEBRAS WHICH ARISE AS INTERSECTIONS OF LEAVITT ALGEBRAS." Journal of Algebra and Its Applications 01, no. 04 (December 2002): 357–63. http://dx.doi.org/10.1142/s0219498802000227.

Full text
Abstract:
Two known constructions of rings R, each having the property that different sized matrix rings Mn(R) and Mm(R) are isomorphic but the free left R-modules RRn and RRm are not, are shown to be isomorphic. The first construction utilizes a direct limit, while the second involves an intersection process.
APA, Harvard, Vancouver, ISO, and other styles
39

An, Jing, Zhi Liu, and Lu Feng Qian. "Development of Research on Process Algebra." Applied Mechanics and Materials 635-637 (September 2014): 1555–60. http://dx.doi.org/10.4028/www.scientific.net/amm.635-637.1555.

Full text
Abstract:
Process algebra is an algebra method of concurrency theory. Based on the relevant theories of process algebra, it is set forth several class process algebras and the important role they played in the development history of research on process algebra according to two breakthrough of process algebra. Finally it is introduced the applications of algebra process in the protocol verification, workflow description and other areas.
APA, Harvard, Vancouver, ISO, and other styles
40

PARVATHI, M., and B. SIVAKUMAR. "THE KLEIN-4 DIAGRAM ALGEBRAS." Journal of Algebra and Its Applications 07, no. 02 (April 2008): 231–62. http://dx.doi.org/10.1142/s0219498808002795.

Full text
Abstract:
In this paper we study a new class of diagram algebras, the Klein-4 diagram algebras denoted by Rk(n). These algebras are the centralizer algebras of the group Gn := (ℤ2 × ℤ2)≀Sn acting on V⊗k, where V is the signed permutation module for Gn These algebras have been realized as subalgebras of the extended G-vertex colored partition algebras introduced by Parvathi and Kennedy in [7]. In this paper we give a combinatorial rule for the decomposition of the tensor powers of the signed permutation representation of Gn by explicitly constructing the basis for the irreducible modules. In the process we also give the basis for the irreducible modules appearing in the decomposition of V⊗k in [5]. We then use this rule to describe the Bratteli diagram of Klein-4 diagram algebras.
APA, Harvard, Vancouver, ISO, and other styles
41

Pavlakos, Panaiotis K. "Integral representation theorems in partially ordered vector spaces." Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics 51, no. 2 (October 1991): 187–215. http://dx.doi.org/10.1017/s1446788700034194.

Full text
Abstract:
AbstractDefining a Radon-type integration process we extend the Alexandroff, Fichtengolts-KantorovichHildebrandt and Riesz integral representation theorems in partially ordered vector spaces.We also identify some classes of operators with other classes of operator-valued set functions, the correspondence between operator and operator-valued set function being given by integration.All these established results can be immediately applied in C* -algebras (especially in W* -algebras and AW* -algebras of type I), in Jordan algebras, in partially ordered involutory (O*-)algebras, in semifields, in quantum probability theory, as well as in the operator Feynman-Kac formula.
APA, Harvard, Vancouver, ISO, and other styles
42

Bortolussi, Luca, and Alberto Policriti. "Hybrid approximation of stochastic process algebras for systems biology." IFAC Proceedings Volumes 41, no. 2 (2008): 12599–606. http://dx.doi.org/10.3182/20080706-5-kr-1001.02132.

Full text
APA, Harvard, Vancouver, ISO, and other styles
43

StříAbrná, Jitka. "Hardness results for weak bisimilarity of simple process algebras." Electronic Notes in Theoretical Computer Science 18 (1998): 179–90. http://dx.doi.org/10.1016/s1571-0661(05)80259-2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
44

Gorrieri, Roberto, Ulrich Herzog, and Jane Hillston. "Unified specification and performance evaluation using stochastic process algebras." Performance Evaluation 50, no. 2-3 (November 2002): 79–82. http://dx.doi.org/10.1016/s0166-5316(02)00100-1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
45

Bremner, Murray, and Irvin Hentzel. "IDENTITIES FOR ALGEBRAS OBTAINED FROM THE CAYLEY-DICKSON PROCESS." Communications in Algebra 29, no. 8 (June 30, 2001): 3523–34. http://dx.doi.org/10.1081/agb-100105036.

Full text
APA, Harvard, Vancouver, ISO, and other styles
46

Sereno, M. "Towards a Product Form Solution for Stochastic Process Algebras." Computer Journal 38, no. 7 (July 1, 1995): 622–32. http://dx.doi.org/10.1093/comjnl/38.7.622.

Full text
APA, Harvard, Vancouver, ISO, and other styles
47

Bernardo, Marco, Paolo Ciancarini, and Lorenzo Donatiello. "On the formalization of architectural types with process algebras." ACM SIGSOFT Software Engineering Notes 25, no. 6 (November 2000): 140–48. http://dx.doi.org/10.1145/357474.355064.

Full text
APA, Harvard, Vancouver, ISO, and other styles
48

SKRYPNYUK, NATALIYA, and FLEMMING NIELSON. "REACHABILITY FOR FINITE-STATE PROCESS ALGEBRAS USING HORN CLAUSES." International Journal of Foundations of Computer Science 24, no. 02 (February 2013): 283–302. http://dx.doi.org/10.1142/s0129054113400121.

Full text
Abstract:
In this work we present an algorithm for solving the reachability problem in finite systems that are modelled with process algebras. Our method is based on Static Analysis, in particular, Data Flow Analysis, of the syntax of a process algebraic system with multi-way synchronisation. The results of the Data Flow Analysis are used in order to build a set of Horn clauses whose least model corresponds to an overapproximation of the reachable states. The computed model can be refined after each transition, and the algorithm runs until either a state whose reachability should be checked is encountered or it is not in the least model for all constructed states and thus is definitely unreachable. The advantages of the algorithm are that in many cases only a part of the Labelled Transition System will be built which leads to lower time and memory consumption. Also, it is not necessary to save all the encountered states which leads to further reduction of the memory requirements of the algorithm.
APA, Harvard, Vancouver, ISO, and other styles
49

Petersson, Holger P., and Michel L. Racine. "Jordan algebras of degree 3 and the Tits process." Journal of Algebra 98, no. 1 (January 1986): 211–43. http://dx.doi.org/10.1016/0021-8693(86)90024-4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
50

Gustavsson, Rune, and Martin Fredriksson. "Process algebras as support for sustainable systems of services." Applicable Algebra in Engineering, Communication and Computing 16, no. 2-3 (June 20, 2005): 179–203. http://dx.doi.org/10.1007/s00200-005-0175-y.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the bibliographies on the topic 'Process algebras' for other source types:
Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography