
	Where results make sense

Topic: Process calculi

	Process calculi - Wikipedia, the free encyclopedia
		The process calculi (or process algebras) are a diverse family of related approaches to 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.
		For process calculi, the celebrated results are that the synchronous π-calculus is more expressive than its asynchronous variant, has the same expressive power as the higher-order π-calculus, but less than the Ambient calculus.
	en.wikipedia.org /wiki/Process_calculus (1713 words)

	[No title] (Site not responding. Last check: 2007-10-14)
		Di#erent applications for process calculi have di#erent informal requirements for when the patterns of labelled transitions for two agents are the same (in the case of equiva lences) or refine one another (in the case of preorders).
		These calculi were the first to employ a lightweight quotient of the agent terms, called a structural congruence, in order to make their reaction rules easy to define.
		The syntax of action calculi is su#ciently rich to embrace process calculi such as #calculus, the #calculus, and the ambient calculus.
	brion.inria.fr /~leifer/articles/leifer-synlt1.txt (18075 words)

	Society Fresh : Article 'Process calculus' (Site not responding. Last check: 2007-10-14)
		Petri-Nets and calculi such as Tony Hoare's CSP, Robin Milner's CCS and the π-calculus by Milner, Joachim Parrow and David Walker are currently the most prominent calculi to have emerged from this line of enquiry.
		The process calculus approach gathered momentum in the 1970s when it became increasingly clear that the then dominant approaches to modelling computation were unlikely to yield satisfactory accounts of non-deterministic, non-terminating and interacting agents.
		Dually, the process x(v).Q receives that message on channel x to become Q[y/v], which is Q with the place-holder v substituted by y, the data received on x.
	www.society-fresh.net /DisplayArticleFull712343.html (1521 words)

	Propositions de stage de Dea Programmation (Site not responding. Last check: 2007-10-14)
		Process calculi are usually based on point-to-point communication because it is considered more basic than other forms of communication.
		There are a number of restrictions on the specification of operational semantics of process calculi that guarantee that the resulting bisimulation relation is a congruence.
		While a number of higher-order process calculi and calculi for mobility of names and links have been studied, no general syntactic restrictions are know for such calculi that parallel the results for first-order systems.
	www.cse.psu.edu /~catuscia/DEA/stages.html (1038 words)

	Nominal Calculi for Security and Mobility
		If P and Q are processes, process P par Q consists of P and Q running in parallel, possibly communicating with each other or with the outside world along communication channels.
		The pi calculus was published as a ``A Calculus of Mobile Processes'' [12] because, unlike almost all previous process calculi, its mobile restrictions can model the passage of knowledge of a communications channel from one process to another.
		Process migration is not one of the primitives of the pi calculus.
	www.cs.nps.navy.mil /research/languages/statements/gordon.html (2167 words)

	Business Processes (Site not responding. Last check: 2007-10-14)
		In computing, a process is, roughly speaking, a task being run by acomputer, often simultaneously with many other tasks.
		Processes are often called tasks in embedded operatingsystems.
		The sense of 'process' is 'something that takes up time', as opposed to 'memory', which is 'something that takes upspace'.
	www.relativeaccess.com /File/26199-Business.Processes.Html (636 words)

	Process calculi
		Process calculi are simple mathematical formalisms that allow us to reason about the behaviour of programs in an implementation-independent fashion.
		The spi calculus is a process calculus due to Martin Abadi and Andrew Gordon.
		-calculus is a process language that makes it easy to describe processes that exchange the names of communication channels and to describe the scopes of channel names.
	www.cs.auc.dk /~hans/Dat5/Konsul/approach.html (720 words)

	Ambient calculus - Wikipedia, the free encyclopedia
		In computer science, the ambient calculus is a process calculus devised by Luca Cardelli and Andrew D. Gordon in 1998, and used to describe and theorise about concurrent systems that include mobility.
		It is used to model interactions in such concurrent systems as the Internet.
		Since its inception, the ambient calculus has grown into a family of closely related ambient calculi.
	en.wikipedia.org /wiki/AmbientCalculiOnline (554 words)

	Algebraic Process Calculi: The First Twenty Five Years and Beyond
		Algebraic process calculi have been the subject of active research for about a quarter of century.
		Some of the ideas underlying CCS were influenced by Hoare's earlier proposal of the language "Communicating Sequential Processes" (CSP) in a seminal 1978 paper in Communications of the ACM, whose underlying semantic theory was elaborated upon in a paper by Brookes, Hoare and Roscoe published in the Journal of the ACM in 1984.
		The algebraic aspects in process theory became central in the development of the theory of ACP, initiated by Bergstra and Klop with their report entitled "Fixed point semantics in process algebras" from 1982.
	www.cs.auc.dk /~luca/BICI/PA-05 (639 words)

	ARC CPBIO Process Calculi and Biology of Molecular Networks (Site not responding. Last check: 2007-10-14)
		This effort of disassembling per identification and measurement of certain characteristics of the elementary components (genes and proteins) starts to be used as a basis for the opposite systematic effort: the reconstitution of the biological mechanisms in which these components exhibit a function.
		Process calculi in the broad sense are particularly well adapted to this task.
		Moreover the work of G. Berry and G. Boudol on the Chemical Abstract Machine, that is used nowadays as an intermediate language for process calculi, invoked already explicitly the chemical metaphor.
	contraintes.inria.fr /cpbio (1059 words)

	Specification, Construction and Verification of Concurrent Systems
		For process calculi, such attempts are best exemplified by OCCAM and the transputer [45], by ESTEREL [], and by the enormous effort around LOTOS [96].
		Most process calculi model concurrency by interleaving: communication actions are taken as atomic, and the observer is assumed to be incapable of perceiving more than one such at a time; thus actions occurring ``simultaneously'' are seen as occurring sequentially in some order.
		For the important subcase of time-stop free, extensible processes, the denotational semantics is shown to be the largest congruence smaller than trace equivalence.
	www.cs.chalmers.se /ComputingScience/Research/Overview/section3_5.html (1583 words)

	Presheaf Models and Process Calculi (ResearchIndex)
		Abstract: Introduction Process calculi like CCS have been motivated and studied operationally, thus from the outset lacking the abstract mathematical treatment provided by a domain theory.
		The study of presheaf models of processes [3, 14] can be seen as an attempt to bring concurrency back within...
		27 A presheaf semantics of value-passing processes - Winskel ACM DBLP
	citeseer.ist.psu.edu /667134.html (515 words)

	University of Birmingham SoCS - Research in CS and AI - 1999 (Site not responding. Last check: 2007-10-14)
		In many cases, however, it is desirable to model a probabilistic choice operator, which allows to specify the probability for each of the alternatives to be selected, in addition to the usual internal/external choices already present in the language.
		For applications such as audio or multimedia protocols, which process and transmit continuous media data, it is often necessary to allow stochastic timing, in the sense that the user could specify that packets are sent according to exponential or normal distribution.
		Stochastic process algebras (SPAs) are based on calculi such as Milner's CCS and Hoare's CSP, except that actions have duration, instead of being instantaneous.
	www.cs.bham.ac.uk /research/booklet_99/projects/node9.html (1493 words)

	Process Calculi and the Verification of Security Properties (Site not responding. Last check: 2007-10-14)
		Process Calculi and the Verification of Security Properties
		Some recent approaches take advantage of concepts and techniques from the field of process calculi.
		Process calculi can be given a formal yet simple semantics, which permits rigorous definitions of such concepts as `attacker', `secrecy' and `authentication'.
	www.dsi.uniroma1.it /~gorla/abstracts/JTIT02.htm (155 words)

	Calculi for Mobile Processes
		The Pi-Calculus - A Theory of Mobile Processes (by Davide Sangiorgi and David Walker), June 2001.
		Asynchronous process calculi: the first-order and higher-order paradigms (Tutorial) (by Davide Sangiorgi).
		A chapter of a handbook for engineers, in which where the potential role of calculi for mobile processes as the core of high-level concurrent programming languages (in analogy to the role of lambda calculi as the core of functional programming languages) is explained.
	lampwww.epfl.ch /mobility (359 words)

	"Congruence Proofs for Weak Bisimulation Equivalences on Higher-Order Process Calculi" (Site not responding. Last check: 2007-10-14)
		Congruence proofs for bisimulation equivalences on higher-order process calculi tend to be significantly more complex than their counterparts in first-order process algebra frameworks.
		The reason is that it renders standard first-order proof techniques circular in the higher-order case, and this situation is difficult to deal with.
		Our contribution is that we use Howe-style techniques to prove that three forms of weak bisimulation equivalence on variants of Thomsen's Plain CHOCS and CHOCS second-order process calculi are congruences.
	uebb.cs.tu-berlin.de /~thofra/papers/TR95-21-tf.html (249 words)

	Process calculi
		The choice of equivalence depends upon how a process interacts with its context.
		reduce the state space of processes where a pair of transitions are order independent (not a global property) and
		LC99] gives algorithms for the automatic analysis of processes but is limited to those processes for which 1.
	www.cs.usyd.edu.au /~dstr/node6.html (255 words)

	Instant polymorphic type systems for mobile process calculi: Just add reduction rules and close : dart-reports : ... (Site not responding. Last check: 2007-10-14)
		Many different mobile process calculi have been invented, and for each some number of type systems has been developed.
		We present the generic polymorphic type system Poly which works for a wide range of mobile process calculi, including the pi-calculus and Mobile Ambients.
		For any calculus satisfying some general syntactic conditions, well-formedness rules for types are derived automatically from the reduction rules and Poly works otherwise unchanged.
	www.cee.hw.ac.uk /DART/publications/auto/Mak+Wel:ESOP-2005.html (214 words)

	Computer Science: Publication: Modelling Concurrent Cognitive Architectures Using Process Calculi
		Furthermore, a number of existing theories of cognitive science are concurrent in nature.
		Thus, we investigate the application of a (process calculi based) concurrency theory to modelling Interacting Cognitive Subsystems, which is such a (concurrent) cognitive theory.
		Then we consider the capabilities of the cognitive system to perform combinations of speech and gesture in multi-modal human computer interaction.
	www.cs.kent.ac.uk /pubs/1999/931 (159 words)

	Process calculi (Site not responding. Last check: 2007-10-14)
		At the moment, research activities covering project- and diploma-works deal with process algebras for the specification of concurrent processes in communication systems.
		The processes have to be specified and tested for consistency afterwards.
		Further refinement of the processes shows up non desirable features of the calculus wich results in suggestions for improvement.
	www.fernuni-hagen.de /DVT/Mitarbeiter/scheler/prozesskalkuele.eng.html (247 words)

	BRICS Mini-Course: Process Calculi: Communication, Mobility, and Constraints (Site not responding. Last check: 2007-10-14)
		The minicourse is brief introduction to some representative process calculi in concurrency.
		We shall discusss Process calculi for Communicating Systems (CCS), for Mobility (Pi Calculus) and for shared-memory (CCP: Concurrent Constraint Programming).
		His research is within Concurrency Theory; in particular Process Calculi, Concurrent Constraint Programming and Temporal Logics.
	www.brics.dk /MC/04/ProcessCalculi (134 words)

	Publications (Site not responding. Last check: 2007-10-14)
		An operational non-interleaved process graph semantics of CCSP, abstract in: Combining Compositionality and Concurrency, summary of a GMD-workshop, Königswinter, March 1988 (E.-R Olderog, U. Goltz & R.J. van Glabbeek, eds.), Arbeitspapiere der GMD 320, Sankt Augustin, Germany 1988, pp.
		On the expressiveness of ACP (extended abstract), available from Boole.stanford.edu; in: ACP94, Workshop on Algebra of Communicating Processes, Utrecht, The Netherlands, May 1994, (A. Ponse, C. Verhoef & S.F.M. van Vlijmen, eds.), Workshops in Computing, Springer-Verlag, 1994, pp.
		A Characterisation of Weak Bisimulation Congruence, available from Boole.stanford.edu; in: Processes, Terms and Cycles: Steps on the Road to Infinity: Essays Dedicated to Jan Willem Klop on the Occasion of His 60th Birthday (Aart Middeldorp, Vincent van Oostrom, Femke van Raamsdonk & Roel de Vrijer, eds.), LNCS 3838, Springer 2005, pp.
	icml.stanford.edu /~rvg/papers.html (2738 words)

	Luís Soares Barbosa
		Program semantics and calculi applied to systems understanding and rigorous software construction.
		Main: Mathematical semantics, program calculi and formal methods applied to systems understanding and rigorous software construction.
		[Theme: Process Calculi (emphasis on the use of algebraic and coalgebraic structures in program construction)]
	www.di.uminho.pt /~lsb (479 words)

Try your search on: Qwika (all wikis)