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.
Filters
Synchronizing Concurrent Objects in the Pi-Calculus
1997
Preserved Fulltext
As a first extension of our π-calculus based object model, we present in this work the integration of abstractions for synchronizing concurrent objects. ...
Our previous work has shown that the π-calculus is a promising formal foundation for modelling objects, and we have defined an object model integrating common features of object-oriented programming languages ...
Acknowledgements We thank all members of the Software Composition Group for their support of this work, especially Oscar Nierstrasz, Patrick Varone, Tamar Richner, and Franz Achermann. ...
doi:10.7892/boris.104769
fatcat:4rjwbskfcfg4loh3fgpymvvude
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.
We present the π-language for coding π-calculus process expressions in Section 4. We describe the various Java objects that support the dynamic communication mechanism of the π-calculus in Section 5. ...
Using keywords in ASCII to denote the Greek leters and other non-Implementing the π-Calculus in Java 158 J OURNAL OF OBJECT TECHNOLOGY V OL. 4, NO. 2 ASCII symbols, the π-language represents π-calculus ...
It is similar to the λcalculus as a theoretical model of sequential computation, the π-calculus can be used to model modern concurrent systems [Milner 1999 ; Sangiorgi and Walker 2001] . ...
doi:10.5381/jot.2005.4.2.a5
fatcat:k4mpsvtnnjc3xj5h4tgfxvz6y4
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.
There have been several attempts to adopt the lI'-calculus and its asynchronous version, for modelling interaction in the context of concurrent object oriented programming languages [18, 29, 23] , but ...
More recently [15, 8] also an asynchronous fragment of the 11'calculus has been studied in order to analyze also the asynchronous communication mechaniSm and its similaritiesldifferencies with the synchronous ...
Acknowledgments This research was partially supported by the Italian Ministry of Universities (MURST). We are also grateful to the anonymous referee for their helpful suggestions. ...
doi:10.1007/978-0-387-35562-7_2
fatcat:znrdz5qlfvg3bd6ej6cjvsj2w4
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.
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. ...
Most of the languages are based on process calculi or P systems. In this article, we present a general overview of the existing modelling languages based on process calculi. ...
The continuous pi-calculus [43] is an extension of the pi-calculus in which the processes evolve in continuous time. ...
arXiv:1901.10820v1
fatcat:2x5nucj7frd5nlfkrp7sszhlf4
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 also wish to acknowledge the inspiration a orded by the work of Simon Gay on the relationship between interaction nets and determinate CCS. ...
non-determinism in pi{calculus processes. ...
doi:10.1007/3-540-60043-4_59
fatcat:72bmm4uvebaadgtme2dhe3svqm
PiLib: A Hosted Language for Pi-Calculus Style Concurrency
[chapter]
2004
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 2005; you can also visit the original URL.
The file type is application/pdf.
PiLib is a library written in Scala that implements the concurrency constructs of the π-calculus. ...
Some features of the programming language Scala, examined in the paper, make it possible to use almost the same syntax as in the π-calculus. ...
The π-calculus in short The π-calculus is a model of concurrent computation in which processes can connect and disconnect dynamically by exchanging the names of the channels they use to communicate. ...
doi:10.1007/978-3-540-25935-0_11
fatcat:rbfxk3xrv5bkhgzwq5grcsuwjq
A formalism for real-time concurrent object-oriented computing
1992
conference proceedings on Object-oriented programming systems, languages, and applications - OOPSLA '92
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 2009; you can also visit the original URL.
The file type is application/pdf.
It can naturally model real-time concurrent objects as communicating processes and represent the timed properties of objects. ...
The model is an extension of CCS with the notion of time, called RtCCS(Real-time Calculus of Communication Systems). ...
Jonnson for suggestions at the early stage of this work. We thank V. Vasconcelos, T. Minohara, and K. Honda for comments on an earlier version of this paper. ...
doi:10.1145/141936.141963
dblp:conf/oopsla/SatohT92
fatcat:td3xinkasfeatd5gqx7qwbrp4a
A formalism for real-time concurrent object-oriented computing
1992
SIGPLAN notices
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 2009; you can also visit the original URL.
The file type is application/pdf.
It can naturally model real-time concurrent objects as communicating processes and represent the timed properties of objects. ...
The model is an extension of CCS with the notion of time, called RtCCS(Real-time Calculus of Communication Systems). ...
Jonnson for suggestions at the early stage of this work. We thank V. Vasconcelos, T. Minohara, and K. Honda for comments on an earlier version of this paper. ...
doi:10.1145/141937.141963
fatcat:3wdoincevvetzb7onqv6i3rmre
JoCaml: A Language for Concurrent Distributed and Mobile Programming
[chapter]
2003
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 2004; you can also visit the original URL.
The file type is application/pdf.
In these lecture notes, we give an overview of concurrent, distributed, and mobile programming using JoCaml. JoCaml is an extension of the Objective Caml language. ...
The programming model of JoCaml is based on the join calculus. ...
Many thanks to the members of the Moscova project at INRIA, and in particular Georges Gonthier, James J. Leifer, and Jean-Jacques Lévy. ...
doi:10.1007/978-3-540-44833-4_5
fatcat:ga6e75xexrdullaolf76ucffdy
Interactive foundations of computing
1998
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.
The extension of Turing to interaction machines parallels that of the lambda to the pi calculus. ...
In the final section the robustness of interactive models in expressing open systems, programming in the large, graphical user interfaces, and agent-oriented artificial intelligence is compared to the ...
P24 (pi calculus): The pi calculus has the expressive power of serializable interaction machines. The pi calculus expresses interleaving semantics but not nonserializable true concurrency. ...
doi:10.1016/s0304-3975(97)00154-0
fatcat:jfv7xn5nlveqjagut2rkidjdem
A stackless runtime environment for a Pi-calculus
2006
Proceedings of the 2nd international conference on Virtual execution environments - VEE '06
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.
The Pi-calculus is a formalism to model and reason about highly concurrent and dynamic systems. ...
We also address the main performance issues raised by the fine-grained concurrency model of the Pi-calculus. ...
According to the Pi-calculus semantics, exactly one of the CS processes will synchronize with the single output lock!(fbk). ...
doi:10.1145/1134760.1134770
dblp:conf/vee/PeschanskiH06
fatcat:jj2h3c2kmnce7mopmaeo6ofm64
A Temporal Concurrent Constraint Calculus As An Audio Processing Framework
2005
Proceedings of the SMC Conferences
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.
of express a variety of actual synchronization patterns oc-
concurrent processes. ...
In addition, the proof system described a declarative flavor to concurrency that avoids in most
in [3] gives extra mechanisms for carrying out proofs of cases dealing with complex synchronizing ...
doi:10.5281/zenodo.849250
fatcat:423w6a6fmvhpponqj4s2nhz5rm
Page 6069 of Mathematical Reviews Vol. , Issue 2002H
[page]
2002
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
The investigation is carried on in the 2é-calculus, a process calculus with explicit constructors to handle name sub- stitutions. ...
Summary: “This paper focusses on explicit substitutions in the m-calculus. ...
Concurrent and Reactive Constraint Programming
[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.
In this paper we review the main lines of research and contributions of the community in this field. 1 The origins: from concurrect logic programming to concurrent constraint programming In the 80's there ...
Additionally, concurrent constraint programming embodies an explicit characterization of the control mechanisms for communication and synchronization by means of the introduction of two kinds of actions ...
The concurrent constraint pi-calculus (cc-pi calculus) [12] is a model of Service Level Agreement negotiations that is inspired by both ccp and name-passing calculi. ...
doi:10.1007/978-3-642-14309-0_11
fatcat:jo4qnuehvfggfn3fkugqgmsqpu
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.
Our approach mimics the evolution from lambda-calculi to functional programming languages, but with the pi-calculus as a starting point. ...
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 ...
The primitive mean of synchronization in the π-calculus is the communication channel. The synchronous semantics of communications allow to encode concurrent locking very easily. ...
doi:10.1145/1926354.1926363
dblp:conf/popl/Peschanski11
fatcat:jorf5pkbx5c4vf4yeumz22sux4
« Previous
Showing results 1 — 15 out of 1,674 results