Filters








50 Hits in 4.7 sec

An Abstract Machine for a Higher-Order Distributed Process Calculus

Florence Germain, Marc Lacoste, Jean-Bernard Stefani
2002 Electronical Notes in Theoretical Computer Science  
The M-calculus can be understood as an extension of the Join calculus that realizes an original combination of the following features: programmable localities, higher-order functions and processes, process  ...  This paper presents the formal specification of an abstract machine for the M-calculus, a new distributed process calculus.  ...  Conclusion We have presented the M-calculus, a new higher-order distributed process calculus, together with a supporting abstract machine.  ... 
doi:10.1016/s1571-0661(04)80420-1 fatcat:xqlypuombvbx5durj5qq66woym

The Kell Calculus: A Family of Higher-Order Distributed Process Calculi [chapter]

Alan Schmitt, Jean-Bernard Stefani
2005 Lecture Notes in Computer Science  
This paper presents the Kell calculus, a family of distributed process calculi, parameterized by languages for input patterns, that is intended as a basis for studying component-based distributed programming  ...  The Kell calculus is built around a π-calculus core, and follows five design principles which are essential for a foundational model of distributed and mobile programming: hierarchical localities, local  ...  Acknowledgments This paper has benefited from several discussions on the Kell calculus, over the past year, with David Teller, Daniel Hirschkoff, Tom Hirschowitz, Matthew Hennessy, Vasco Vasconcelos, Eugenio  ... 
doi:10.1007/978-3-540-31794-4_9 fatcat:bbeuy3dikrbghnybn4kpaeeut4

The m-calculus

Alan Schmitt, Jean-Bernard Stefani
2003 SIGPLAN notices  
This paper presents a new distributed process calculus, called the M-calculus, that can be understood as a higher-order version of the Distributed Join calculus with programmable localities.  ...  The calculus is equipped with a polymorphic type system that guarantees the unicity of locality names, even in presence of higher-order communications -a crucial property for the determinacy of message  ...  Since the M-calculus is a direct offspring of the Distributed Join calculus, a translation of a Distributed Join calculus process into an M-calculus process is relatively straightforward.  ... 
doi:10.1145/640128.604136 fatcat:x64e2vf32raitowi3fhdlec534

The m-calculus

Alan Schmitt, Jean-Bernard Stefani
2003 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '03  
This paper presents a new distributed process calculus, called the M-calculus, that can be understood as a higher-order version of the Distributed Join calculus with programmable localities.  ...  The calculus is equipped with a polymorphic type system that guarantees the unicity of locality names, even in presence of higher-order communications -a crucial property for the determinacy of message  ...  Since the M-calculus is a direct offspring of the Distributed Join calculus, a translation of a Distributed Join calculus process into an M-calculus process is relatively straightforward.  ... 
doi:10.1145/604131.604136 fatcat:6qolkpbiczhijjnzxm5fs32oeu

The Kell Calculus: Operational Semantics and Type System [chapter]

Philippe Bidinger, Jean-Bernard Stefani
2003 Lecture Notes in Computer Science  
This paper 1 presents the Kell calculus, a new distributed process calculus that retains the original insights of the Seal calculus (local actions, process replication) and of the M-calculus (higher-order  ...  The calculus is equipped with a type system that enforces a unicity property for location names that is crucial for the efficient implementation of the calculus.  ...  process migration is a side-effect of higher-order communication.  ... 
doi:10.1007/978-3-540-39958-2_8 fatcat:odgtnlldj5glbhix45gshwsjoq

A calculus of Kells

Jean-Bernard Stefani
2003 Electronical Notes in Theoretical Computer Science  
This paper introduces the Kell calculus, a new process calculus that retains the original insights of the M-calculus (local actions, higher-order processes and programmable membranes) in a much simpler  ...  The calculus is shown expressive enough to provide a direct encoding of several recent distributed process calculi such as Mobile Ambients and the Distributed Join calculus. stefani still requires a rendez-vous  ...  This is why we follow instead the lead of higher-order calculi such as D [23] and the M-calculus [18] , where process migration is a side-effect of higher-order communication.  ... 
doi:10.1016/s1571-0661(05)80087-8 fatcat:x4m6bpvxkfbdxnzrphh53rgesm

THE IMPLEMENTATION OF M-LEARNING IN LEARNING CALCULUS II

Yayu Laila Sulastri, Zubaedah Wiji Lestari, Luki Luqmanul Hakim
2017 PEOPLE International Journal of Social Sciences  
The purpose of this paper is (a) to describe the implementation of m-learning in learning calculus II, and (b) to determine and obtain an overview of the mobile-based learning process.  ...  In m-learning process, the students learn the material ordered by the lecturer, who then held online quizzes on each chapter.  ...  Figure 3: Learning menu in m-calculus In this window the user can select the desired learning menu.  ... 
doi:10.20319/pijss.2015.s11.531541 fatcat:eyu4qi4ajzeyncdiswpudipsha

Concurrency in Intuitionistic Linear-Time μ-Calculus: A Case study of Manufacturing System

Ilyas Fakhir, Syed Asad Raza Kazmi, Awais Qasim, Imran Rafique
2016 Indian Journal of Science and Technology  
For verification of such systems, intuitionistic linear-time m-calculus (ImTL) will be applied, which is based on Heyting algebra. ImTL is the extension of linear-time m-calculus.  ...  The goal of this work is to introduce a common formalized framework to improve the shortcomings of existing models of concurrency, most of which use an oversimplified model of time.  ...  Semantics of Intuitionistic Linear-Time μ-Calculus (IμTL) Intuitionistic Linear-Time m-calculus is an extension of the linear-time m-calculus in linear intuitionistic logic.  ... 
doi:10.17485/ijst/2016/v9i6/82655 fatcat:zueaor2ogbbdnccxyx5ueixzxi

An Abstract Machine for the Kell Calculus [chapter]

Philippe Bidinger, Alan Schmitt, Jean-Bernard Stefani
2005 Lecture Notes in Computer Science  
The Kell Calculus is a family of process calculi intended as a basis for studying distributed component-based programming.  ...  This allows to separate the proof of correctness of the abstract machine per se, from the proof of correctness of higher-level communication and migration protocols which can be implemented on the machine  ...  Introduction The Kell calculus [17, 18] is a family of higher-order process calculi with hierarchical localities and locality passivation, which is indexed by the pattern language used in input constructs  ... 
doi:10.1007/11494881_3 fatcat:y7zrjbkdfve77jtfvxvplbygsq

Page 10273 of Mathematical Reviews Vol. , Issue 2004m [page]

2004 Mathematical Reviews  
We explain the importance of types in the m-calculus on a concrete example: the termination property.  ...  Summary: “The z-calculus is the paradigmatic calculus of mobile processes.  ... 

Page 7840 of Mathematical Reviews Vol. , Issue 2003j [page]

2003 Mathematical Reviews  
models, defining a meta-language for these models, and translating the m-calculus into the metalanguage.”  ...  declarations inside blocks in imperative languages (as acknowledged by the authors), and recently exploited by Fiore and others in a series of papers concerning the semantics of abstract-syntax for higher-order  ... 

A Generic Membrane Model (Note) [chapter]

Gérard Boudol
2005 Lecture Notes in Computer Science  
In this note we introduce a generic model for controlling migration in a network of distributed processes.  ...  To this end, we equip the membrane of a domain containing processes with some computing power, including in particular some specific primitives to manage the movements of entities from the inside to the  ...  Since processes may be arguments in a message, the controller model is of higher-order with respect to the process model.  ... 
doi:10.1007/978-3-540-31794-4_11 fatcat:ce5scjd2encpddqcwamgvexhji

Page 472 of Mathematical Reviews Vol. , Issue 98A [page]

1998 Mathematical Reviews  
Sangiorgi, A fully-abstract model for the m-calculus (extended abstract) (43-54); Gian Luca Cattani and Vladimiro Sassone, Higher-dimensional transition systems (55- 62); V.  ...  Amadio, Lone Leth and Bent Thomsen, From a concurrent 4-calculus to the z-calculus (106-115); Valentin Antimirov [V. M.  ... 

Page 1097 of Mathematical Reviews Vol. , Issue 96b [page]

1996 Mathematical Reviews  
Higher order processes of CHOCS could be considered as a justified alternative for mobil- ity (ie. transmission and reception of communication links) of m-calculus.  ...  The author of this paper has introduced a calculus of higher order communicating systems (CHOCS) as an extension of CCS by allowing processes which can exchange processes as data.  ... 

Page 1290 of Mathematical Reviews Vol. , Issue 2003B [page]

2003 Mathematical Reviews  
The authors observe that many theories treating location or distribution, which have been recently proposed, are extensions or close relatives of the m-calculus, as for instance the Distributed Join Calculus  ...  and the Distributed z-calculus [see M.  ... 
« Previous Showing results 1 — 15 out of 50 results