A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Filters
A New-type Pi Calculus with Buffers and Its Bisimulation
2012
Journal of Computers
Preserved Fulltext
The study shows that compared with Pi calculus, Buffer-Pi calculus can provide more powerful support for asynchronous behavior modeling in systems. ...
propositions and properties of Buffer-Pi calculus are given. ...
] , and the other is the synchronous port action, denoted as <port>(Buffer-Pi calculus syntax will be described further in the following). ...
doi:10.4304/jcp.7.12.2931-2938
fatcat:qgp7kkqn2zglpht6ld34oovv64
A General Overview of Formal Languages for Individual-Based Modelling of Ecosystems
[article]
2019
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Each modelling language offers a distinct view and techniques for analyzing systems. Most of the languages are based on process calculi or P systems. ...
Various formal languages have been proposed in the literature for the individual-based modelling of ecological systems. These languages differ in their treatment of time and space. ...
Stochastic pi-calculus. The stochastic pi-calculus is an extension of the picalculus with rates associated to the actions, developed by Corrado Priami in 1995. ...
arXiv:1901.10820v1
fatcat:2x5nucj7frd5nlfkrp7sszhlf4
Implementing the π-Calculus in Java
2005
Journal of Object Technology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Thus, we implement the π-calculus in the Java language. We present an ASCII-based language called π-language for coding π-calculus process expressions. ...
We can compile the translated π-calculus process expressions into Java to explore the multithreading and synchronization mechanism of Java. ...
For example, it has been shown that the π-calculus is powerful enough to model various data structures, object-oriented programs, and communicating systems. ...
doi:10.5381/jot.2005.4.2.a5
fatcat:k4mpsvtnnjc3xj5h4tgfxvz6y4
Causality and true concurrency: A data-flow analysis of the Pi-Calculus
[chapter]
1995
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
This paper owes a great deal to the work and ideas of Samson Abramsky | indeed this work is a ushing out (in the setting of the pi{calculus) of the analysis of computation in the geometry of interaction ...
The authors are of course responsible for any errors and omissions. ...
Introduction The pi{calculus 18, 17] is a process algebra for describing networks of processes with dynamically evolving communication structure. ...
doi:10.1007/3-540-60043-4_59
fatcat:72bmm4uvebaadgtme2dhe3svqm
Parametric synchronizations in mobile nominal calculi
2008
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
However, P-PRISMA and F-PRISMA can easily accommodate many other high-level synchronization mechanisms than the basic ones available in π-calculus and Fusion, hence allowing for the development of a general ...
Finally, we show that basic categorical tools can help to relate and to compose SAMs and PRISMA processes in an elegant way. ...
Suppose that S is a P-SAM such that for each action a there is an action synchronization allowing to synchronize a and . ...
doi:10.1016/j.tcs.2008.04.029
fatcat:dynj6gaoaraippuqyx5gduevky
A Randomized Distributed Encoding of the π-Calculus with Mixed Choice
[chapter]
2002
Foundations of Information Technology in the Era of Network and Mobile Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Although it has been shown that this is not possible with an exact encoding, we suggest a randomized approach using a probabilistic extension of the asynchronous 71'-calculus, and we show that our solution ...
-calculus with mixed choice) into the asynchronous 71'-calculus via a uniform translation preserving a reasonable semantics. ...
Corollary 5 For every 1r-calculus processes P and Q, if[P) -:::::.p [Q) then P-:::::. Q. ...
doi:10.1007/978-0-387-35608-2_44
dblp:conf/ifipTCS/PalamidessiH02
fatcat:qxec76n36vbgrb7bsphziiesxu
REASONING ABOUT MUTUAL-BELIEF AMONG MULTIPLE COOPERATIVE AGENTS
2001
Intelligent Agent Technology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Believing mutually is an important premise to ensure that cooperation among multiple agents goes smoothly. However, mutual belief among agents is always considered for granted. ...
To reason about mutual belief formally, we first use a process algebra approach, the pi-calculus, to formalize cooperation plans and agents, and then bind the position-exchange principle into the inference ...
In the pi-calculus, actions of the pi-calculus processes occur in pairs and are mainly for communicating. ...
doi:10.1142/9789812811042_0015
fatcat:gh4pzw3df5cebddpmrwnvmr334
Event Structure Semantics of Parallel Extrusion in the Pi-Calculus
[chapter]
2012
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
The correctness of our true concurrent semantics is shown by an operational adequacy theorem with respect to the standard late semantics of the π-calculus. ...
We give a compositional event structure semantics of the π-calculus. The main issues to deal with are the communication of free names and the extrusion of bound names. ...
We also thank Giotto, for his wonderful frescos, and seaside greek iced coffes, for their mind-refreshing power. The third author is partially supported by EPSRC EP/F003757/01 and G015635/01. ...
doi:10.1007/978-3-642-28729-9_15
fatcat:hf32y7wxm5be5ekp5cplmthfoa
Parallel computing with the Pi-calculus
2011
Proceedings of the sixth workshop on Declarative aspects of multicore programming - DAMP '11
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
To fill the gap between the abstract calculus and its implementations, we introduce the pi-threads: an intermediate language and its abstract machine.The stackless architecture of the abstract machine ...
Our approach mimics the evolution from lambda-calculi to functional programming languages, but with the pi-calculus as a starting point. ...
The rule (step) gives an interpretation for the tau action as the first branch of a choice. ...
doi:10.1145/1926354.1926363
dblp:conf/popl/Peschanski11
fatcat:jorf5pkbx5c4vf4yeumz22sux4
Welcome to the Jungle: A Subjective Guide to Mobile Process Calculi
[chapter]
2006
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
The original Pi Calculus arose out of a reformulation and extension of CCS. In turn, it boosted the invention and study of a whole zoo of further process calculi. ...
Jos Baeten and Holger Hermanns for discussing related issues at the social event of CONCUR 2001. ...
The members of the moca mailing list, in particular Martin Berger, for some discussion in July/August 2003. ...
doi:10.1007/11817949_4
fatcat:lrvgax7zcndafe64u2norsz2qu
Computational flux
2001
Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '01
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
But a graphical reduction model was devised by Wadsworth [15] for the lambda calculus, the essence of parametric (functional) computing. ...
Meanwhile, Patti nets [13] made a breakthrough in understanding synchronization and concurrent control flow. ...
Acknowledgement I would like to thank my colleagues Luca Cattani, Philippa Gardner, Jamey Leifer and Peter Sewell for their co-operation, inspiration and patience. ...
doi:10.1145/360204.360222
dblp:conf/popl/Milner01
fatcat:y36wr2wvnjapvkx2xhjph6pw3q
An Algebra of Actors
[chapter]
1999
Formal Methods for Open Object-Based Distributed Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
for object creation; an actor has tlie same structural and interaction properties as an object. ...
In fact, it has been introduced as a calculus for mobile processes, i.e., processes witli a dynamically changing linkage structure. ...
We are also grateful to the anonymous referee for their helpful suggestions. ...
doi:10.1007/978-0-387-35562-7_2
fatcat:znrdz5qlfvg3bd6ej6cjvsj2w4
Probabilistic Asynchronous π-Calculus
[chapter]
2000
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
We propose an extension of the asynchronous π-calculus with a notion of random choice. ...
Finally, we show an implementation of the probabilistic asynchronous π-calculus in a Java-like language. ...
Acknowledgments We would like to thank Dale Miller and the anonymous FOSSACS referees for their helpful comments on a preliminary version of this paper. ...
doi:10.1007/3-540-46432-8_10
fatcat:pknwal42ffdgrpffcs62h2ysjy
Probabilistic asynchronous pi-calculus
[article]
2001
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
We propose an extension of the asynchronous pi-calculus with a notion of random choice. ...
Finally, we show an implementation of the probabilistic asynchronous pi-calculus in a Java-like language. ...
The output action synchronizes with all matching input actions of a partner, with the same probability of the input action. ...
arXiv:cs/0109002v1
fatcat:kzd6g2lp7rf73dusfisn5wsoqq
Translating Pi-Calculus into LOTOS NT
[chapter]
2010
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Process calculi supporting mobile communication, such as the π-calculus, are often seen as an evolution of classical value-passing calculi, in which communication between processes takes place along a ...
transition systems corresponding to the input π-calculus and the output Lotos NT specifications. ...
Pi-Calculus and LOTOS NT We briefly present below the syntax and semantics of π-calculus and of the Lotos NT fragment that serves as target language for the translation. Pi-Calculus. ...
doi:10.1007/978-3-642-16265-7_17
fatcat:c6oa73g44bavvcpj6djezqko54
« Previous
Showing results 1 — 15 out of 2,725 results