In computer science, the process calculi (or process algebras) are a diverse family of related approaches for formally modelling concurrent systems. Process calculi provide a tool for the high-level description of interactions, communications, and synchronizations between a collection of independent agents or processes. They also provide algebraic laws that allow process descriptions to be manipulated and analyzed, and permit formal reasoning about equivalences between processes (e.g., using bisimulation). Leading examples of process calculi include CSP, CCS, ACP, and LOTOS.[1] More recent additions to the family include the π-calculus, the ambient calculus, PEPA, the fusion calculus and the join-calculus.
While the variety of existing process calculi is very large (including variants that incorporate stochastic behaviour, timing information, and specializations for studying molecular interactions), there are several features that all process calculi have in common:[2]
To define a process calculus, one starts with a set of names (or channels) whose purpose is to provide means of communication. In many implementations, channels have rich internal structure to improve efficiency, but this is abstracted away in most theoretic models. In addition to names, one needs a means to form new processes from old ones. The basic operators, always present in some form or other, allow:[3]
Parallel composition of two processes P {\displaystyle {\mathit {P}}} and Q {\displaystyle {\mathit {Q}}} , usually written P | Q {\displaystyle P\vert Q} , is the key primitive distinguishing the process calculi from sequential models of computation. Parallel composition allows computation in P {\displaystyle {\mathit {P}}} and Q {\displaystyle {\mathit {Q}}} to proceed simultaneously and independently. But it also allows interaction, that is synchronisation and flow of information from P {\displaystyle {\mathit {P}}} to Q {\displaystyle {\mathit {Q}}} (or vice versa) on a channel shared by both. Crucially, an agent or process can be connected to more than one channel at a time.
Channels may be synchronous or asynchronous. In the case of a synchronous channel, the agent sending a message waits until another agent has received the message. Asynchronous channels do not require any such synchronization. In some process calculi (notably the π-calculus) channels themselves can be sent in messages through (other) channels, allowing the topology of process interconnections to change. Some process calculi also allow channels to be created during the execution of a computation.
Interaction can be (but isn't always) a directed flow of information. That is, input and output can be distinguished as dual interaction primitives. Process calculi that make such distinctions typically define an input operator (e.g. x ( v ) {\displaystyle x(v)} ) and an output operator (e.g. x ⟨ ⟨ --> y ⟩ ⟩ --> {\displaystyle x\langle y\rangle } ), both of which name an interaction point (here x {\displaystyle {\mathit {x}}} ) that is used to synchronise with a dual interaction primitive.
Should information be exchanged, it will flow from the outputting to the inputting process. The output primitive will specify the data to be sent. In x ⟨ ⟨ --> y ⟩ ⟩ --> {\displaystyle x\langle y\rangle } , this data is y {\displaystyle y} . Similarly, if an input expects to receive data, one or more bound variables will act as place-holders to be substituted by data, when it arrives. In x ( v ) {\displaystyle x(v)} , v {\displaystyle v} plays that role. The choice of the kind of data that can be exchanged in an interaction is one of the key features that distinguishes different process calculi.
Sometimes interactions must be temporally ordered. For example, it might be desirable to specify algorithms such as: first receive some data on x {\displaystyle {\mathit {x}}} and then send that data on y {\displaystyle {\mathit {y}}} . Sequential composition can be used for such purposes. It is well known from other models of computation. In process calculi, the sequentialisation operator is usually integrated with input or output, or both. For example, the process x ( v ) ⋅ ⋅ --> P {\displaystyle x(v)\cdot P} will wait for an input on x {\displaystyle {\mathit {x}}} . Only when this input has occurred will the process P {\displaystyle {\mathit {P}}} be activated, with the received data through x {\displaystyle {\mathit {x}}} substituted for identifier v {\displaystyle {\mathit {v}}} .
The key operational reduction rule, containing the computational essence of process calculi, can be given solely in terms of parallel composition, sequentialization, input, and output. The details of this reduction vary among the calculi, but the essence remains roughly the same. The reduction rule is:
The interpretation to this reduction rule is:
The class of processes that P {\displaystyle {\mathit {P}}} is allowed to range over as the continuation of the output operation substantially influences the properties of the calculus.
Processes do not limit the number of connections that can be made at a given interaction point. But interaction points allow interference (i.e. interaction). For the synthesis of compact, minimal and compositional systems, the ability to restrict interference is crucial. Hiding operations allow control of the connections made between interaction points when composing agents in parallel. Hiding can be denoted in a variety of ways. For example, in the π-calculus the hiding of a name x {\displaystyle {\mathit {x}}} in P {\displaystyle {\mathit {P}}} can be expressed as ( ν ν --> x ) P {\displaystyle (\nu \;x)P} , while in CSP it might be written as P ∖ ∖ --> { x } {\displaystyle P\setminus \{x\}} .
The operations presented so far describe only finite interaction and are consequently insufficient for full computability, which includes non-terminating behaviour. Recursion and replication are operations that allow finite descriptions of infinite behaviour. Recursion is well known from the sequential world. Replication ! P {\displaystyle !P} can be understood as abbreviating the parallel composition of a countably infinite number of P {\displaystyle {\mathit {P}}} processes:
Process calculi generally also include a null process (variously denoted as n i l {\displaystyle {\mathit {nil}}} , 0 {\displaystyle 0} , S T O P {\displaystyle {\mathit {STOP}}} , δ δ --> {\displaystyle \delta } , or some other appropriate symbol) which has no interaction points. It is utterly inactive and its sole purpose is to act as the inductive anchor on top of which more interesting processes can be generated.
Process algebra has been studied for discrete time and continuous time (real time or dense time).[4]
In the first half of the 20th century, various formalisms were proposed to capture the informal concept of a computable function, with μ-recursive functions, Turing machines and the lambda calculus possibly being the best-known examples today. The surprising fact that they are essentially equivalent, in the sense that they are all encodable into each other, supports the Church-Turing thesis. Another shared feature is more rarely commented on: they all are most readily understood as models of sequential computation. The subsequent consolidation of computer science required a more subtle formulation of the notion of computation, in particular explicit representations of concurrency and communication. Models of concurrency such as the process calculi, Petri nets in 1962, and the actor model in 1973 emerged from this line of inquiry.
Research on process calculi began in earnest with Robin Milner's seminal work on the Calculus of Communicating Systems (CCS) during the period from 1973 to 1980. C.A.R. Hoare's Communicating Sequential Processes (CSP) first appeared in 1978, and was subsequently developed into a full-fledged process calculus during the early 1980s. There was much cross-fertilization of ideas between CCS and CSP as they developed. In 1982 Jan Bergstra and Jan Willem Klop began work on what came to be known as the Algebra of Communicating Processes (ACP), and introduced the term process algebra to describe their work.[1] CCS, CSP, and ACP constitute the three major branches of the process calculi family: the majority of the other process calculi can trace their roots to one of these three calculi.
Various process calculi have been studied and not all of them fit the paradigm sketched here. The most prominent example may be the ambient calculus. This is to be expected as process calculi are an active field of study. Currently research on process calculi focuses on the following problems.
The ideas behind process algebra have given rise to several tools including:
The history monoid is the free object that is generically able to represent the histories of individual communicating processes. A process calculus is then a formal language imposed on a history monoid in a consistent fashion.[6] That is, a history monoid can only record a sequence of events, with synchronization, but does not specify the allowed state transitions. Thus, a process calculus is to a history monoid what a formal language is to a free monoid (a formal language is a subset of the set of all possible finite-length strings of an alphabet generated by the Kleene star).
The use of channels for communication is one of the features distinguishing the process calculi from other models of concurrency, such as Petri nets and the actor model (see Actor model and process calculi). One of the fundamental motivations for including channels in the process calculi was to enable certain algebraic techniques, thereby making it easier to reason about processes algebraically.
{{cite journal}}
|journal=
{{cite book}}
|work=
هذه المقالة تحتاج للمزيد من الوصلات للمقالات الأخرى للمساعدة في ترابط مقالات الموسوعة. فضلًا ساعد في تحسين هذه المقالة بإضافة وصلات إلى المقالات المتعلقة بها الموجودة في النص الحالي. (أبريل 2023) كأس دوراند 2016 تفاصيل الموسم كأس دوراند البلد الهند عدد المشاركين 12 كأس…
Sallie F. Moore Chapin Sallie Flournoy Moore Chapin (March 30, 1830 - April 19, 1896) was an American author and temperance worker. She was affiliated with the Ladies' Memorial Association, Soldiers' Relief Society, Ladies' Auxiliary Christian Association, Woman's Christian Temperance Union (W.C.T.U.), and the Woman's Press Association of the South. Early life Sarah (Sallie) Flournoy Moore was born on March 30, 1830, in Charleston, South Carolina. Her maternal ancestors, Elizabeth Martha Vignero…
В Википедии есть статьи о других людях с такой фамилией, см. Голованов; Голованов, Георгий. Георгий (Егор) Михайлович Голованов Дата рождения 1830 Дата смерти 1913 Место смерти Москва, Российская империя Георгий (Егор) Михайлович Голованов (1830 — 1913, Москва) — крупный том
Dog meat consumption in South KoreaA photo (2007) of dog meat for sale in Gyeongdong MarketKorean nameHangul개고기Revised RomanizationGaegogiMcCune–ReischauerKaegogiNorth Korean nameHangul단고기Revised RomanizationDan(-)gogiMcCune–ReischauerTan'gogi The consumption of dog meat is now heavily restricted but legal in South Korea. It is the subject of ongoing and significant controversy. In a 2020 survey of South Koreans, 83.8% of respondents reported never having consumed dog meat nor ha…
Pusat Akuatik DeodoroCentro Aquático de DeodoroDeodoro Aquatics CentreAlamatRio de JaneiroBrasilLokasiDeodoro Pusat Akuatik Deodoro adalah tempat renang di Deodoro, Rio de Janeiro, Brasil, yang menyelenggarakan acara renang di Pentathlon modern pada Olimpiade Musim Panas 2016 .[1] Referensi ^ Deodoro Aquatics Center. Rio 2016. Diarsipkan dari versi asli tanggal 5 Juli 2016. Diakses tanggal 4 Maret 2016. Parameter |url-status= yang tidak diketahui akan diabaikan (bantuan) Wiki…
Pour les articles homonymes, voir Théorème de Cartan. John von Neumann démontre en 1929 le théorème dans le cas des groupes linéaires.En mathématiques, le théorème de Cartan-von Neumann, ou théorème du sous-groupe fermé, est un théorème de la théorie des groupes de Lie. Soit H un sous-groupe fermé d'un groupe de Lie G, alors H est un groupe de Lie dont la structure différentielle (et donc la topologie du groupe) est déduite de celle de G par plongement de groupes de Lie[1], [2]…
You can help expand this article with text translated from the corresponding article in Lithuanian. (December 2010) Click [show] for important translation instructions. View a machine-translated version of the Lithuanian article. Machine translation, like DeepL or Google Translate, is a useful starting point for translations, but translators must revise errors as necessary and confirm that the translation is accurate, rather than simply copy-pasting machine-translated text into the English …
Coordenadas: 20° 26' N 101° 31' 49 O Abasolo Cidade Símbolos Brasão de armas Localização Abasolo Coordenadas 20° 26' N 101° 31' 49 O País México Estado Guanajuato História Fundação 12 de janeiro de 1870 Características geográficas Área total 601,73 km² População total 79,093 hab. Altitude 1,760 m Sítio www.abasolo.gob.mx Abasolo (Guanajuato) é um município do estado de Guanajuato, no México.[1] Referências
Arx FatalisInformación generalDesarrollador Arkane StudiosDistribuidor Microsoft WindowsJoWooD ProductionsArkane Studios (digital)XboxDreamCatcher InteractiveDiseñador Raphaël ColantonioDirector Raphaël ColantonioProductor Friis Torben TappertHolly D. KreieProgramador Cyril MeynierArtista Olivier Enselme-TrichardCompositor Kemal AmarasinghamSimon AmarasinghamDatos del juegoGénero Primera PersonaVideojuego de rol de acciónIdiomas inglés, francés, alemán, italiano, español y ruso Modos d…
1984 single by XTCAll You Pretty GirlsSingle by XTCfrom the album The Big Express Released3 September 1984 (1984-09-03)Recorded1984Length3:56LabelVirginSongwriter(s)Andy PartridgeProducer(s)David Lord, XTCXTC singles chronology Thanks for Christmas (1983) All You Pretty Girls (1984) This World Over (1984) Audio samplefilehelp All You Pretty Girls is a song written by Andy Partridge of the English rock band XTC, released on their 1984 album The Big Express. It peaked at number 55 o…
CA13Stasiun Okitsu興津駅Stasiun Okitsu pada Desember 2016LokasiOkitsu-Nakamachi, Shimizu-ku, Shizuoka-shi, Shizuoka-kenJepangKoordinat35°3′9″N 138°31′19″E / 35.05250°N 138.52194°E / 35.05250; 138.52194Koordinat: 35°3′9″N 138°31′19″E / 35.05250°N 138.52194°E / 35.05250; 138.52194Pengelola JR CentralJalur Jalur Utama TokaidoLetak dari pangkal164.3 kilometer dari TokyoJumlah peron1 peron pulau + 1 peron sampingInformasi lain…
Pour les articles homonymes, voir François et Ferdinand. François-Ferdinand d'Autriche L'archiduc François-Ferdinand d'Autriche.Titres Prince impérial d'Autriche-Hongrie 19 mai 1896 – 28 juin 1914(18 ans, 1 mois et 9 jours) Données clés Prédécesseur Charles-Louis d'Autriche Successeur Charles d'Autriche Prétendant au trône de Modène 20 novembre 1875 – 28 juin 1914(38 ans, 7 mois et 8 jours) Données clés Prédécesseur François V Successeur Charles …
IMI Radio (PM2FGD)PT Radio Swara Rhadana DuniaKotaJakartaWilayah siarJabodetabek, Kabupaten Karawang, bagian timur Kabupaten SerangFrekuensi96.7 FMMulai mengudara1993 (sebagai Radio A)2014 (sebagai Hitz FM)2022 (sebagai IMI Radio)FormatCHRBahasaIndonesianOtoritas perizinanKementerian Komunikasi dan Informatika Republik IndonesiaKelasAMakna tanda panggilIkatan Motor Indonesia RadioNama sebelumnyaRadio AHitz FMFrekuensi sebelumnya91.45 FMPemilikIndika Group (2014-2018)Indika Multimedia (2018-2022)…
District of São Paulo, Brazil You can help expand this article with text translated from the corresponding article in Portuguese. (April 2010) Click [show] for important translation instructions. View a machine-translated version of the Portuguese article. Machine translation, like DeepL or Google Translate, is a useful starting point for translations, but translators must revise errors as necessary and confirm that the translation is accurate, rather than simply copy-pasting machine-trans…
For the 2012 film, see 3 Kanya. 1961 Indian-Bengali anthology film directed by Satyajit Ray Teen KanyaFilm posterDirected bySatyajit RayWritten bySatyajit Ray (screenplay)Rabindranath Tagore (stories)Produced bySatyajit RayStarringSoumitra Chatterjee [Amulya]Aparna Sen [Samapti]Distributed bySony PicturesRelease date 5 May 1961 (1961-05-05) Running time173 min.CountryIndiaLanguageBengali Teen Kanya (English: Three Girls) is a 1961 Indian Bengali anthology film directed by Satyajit…
У Вікіпедії є статті про інші значення цього терміна: Гранітно-степове Побужжя (природний комплекс) (значення). Регіональний ландшафтний парк«Гранітно-степове Побужжя» Актовський каньйон, вигляд із вершини скеліАктовський каньйон, вигляд із вершини скелі 47°54′10″ пн.…
Part of a series onTropical cyclones Structure Central dense overcast Development Eye Effects By Region Warnings and watches Storm surge Preparedness Response Climatology and tracking Basins Climate change effects RSMCs Scales Observation Forecasting Rainfall forecasting Rainfall climatology Tropical cyclone naming History List of historical names Lists of retired names: Atlantic, Pacific hurricane, Pacific typhoon, Philippine, Australian, South Pacific Outline of tropical cyclones Tropical…
2021 superhero film directed by Basil Joseph Minnal MuraliOfficial release posterDirected byBasil JosephWritten byArun AnirudhanJustin MathewProduced bySophia PaulStarringTovino ThomasGuru SomasundaramCinematographySameer ThahirEdited byLivingston MathewMusic bySongs:Shaan RahmanSushin ShyamBackground Score:Sushin ShyamProductioncompanyWeekend BlockbustersDistributed byNetflixRelease dates 16 December 2021 (2021-12-16) (Mumbai Film Festival) 24 December 2021 (20…
Indian geneticist and molecular biologist S. GaneshBorn (1968-05-23) 23 May 1968 (age 55)Tamil Nadu, IndiaNationalityIndianAlma materUniversity of MadrasBanaras Hindu UniversityIndian Institute of ScienceKnown forStudies on Lafora progressive myoclonic epilepsyAwards2008 N-BIOS Prize2008 Scopus Young Indian Scientists Award2008 B. M. Birla Science Prize2010 DAE-SRC Outstanding Research Investigator Award2011 KU Rajib Goyal Prize2012 CDRI Award2014…
Joachim sending ambassadors to tsar Ivan IV Joachim (1448?-1567)[1] served as Greek Patriarch of Alexandria between 1486 and 1567. Joachim and Russia In 1556, Joachim sent a letter to the Russian Czar Ivan IV, asking the Orthodox monarch to provide some material assistance for the Saint Catherine's Monastery in the Sinai Peninsula, which had suffered from the Turks. In 1558, the Czar sent to Egypt a delegation led by archdeacon Gennady, who, however, died in Constantinople before he coul…
Lokasi Pengunjung: 52.15.253.104