Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

Search 250 million research papers

Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.

About 7,168 papers for “Process calculus”

Process Calculus

Robert Harper · Cambridge University Press eBooks · 2016

A summary is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.

Cited by 0

An algebraic process calculus

Emmanuel Beffara · HAL (Le Centre pour la Communication Scientifique Directe) · 2008

International audience

Cited by 0

M-Calculus: A Higher-Order Distributed Process Calculus

Alan Schmitt, Jean-Bernard Stefani · HAL (Le Centre pour la Communication Scientifique Directe) · 2001

This report presents a new distributed process calculus, called the M-calculus. Key insights for the calculus are similar to those laid out by L. Cardelli for its calculus of ambients. Mobile Ambients and other recent distributed process calculi such as the Join calculus or the D-calculus introduce notions of distributed locations or localities, corresponding to a spatial partitioning of computations and embodying different features of distributed computations (e.g. failures, access control, process migration, etc). However these calculi remain unsatisfactory in that they account for a single predefined behavior associated with a locality: in a large distributed system, localities may be of different types and exhibit a wide range of behaviors. This report tries to remedy to this limitation in defining a distributed programming model that allows the explicit programming of locality behavior. More precisely, the M-calculus can be understood as a generalization of the Join calculus and of G. Boudol's blue calculus that provides: distributed localities with programmable behavior (cells), higher-order processes, process mobility, and dynamic binding features.

Cited by 4Open access

Liu process and uncertain calculus

Xiaowei Chen, Dan A. Ralescu · Journal of Uncertainty Analysis and Applications · 2013

Uncertain calculus is a branch of mathematics that deals with the integral and differential of functions of uncertain processes. This paper first introduces the Liu process as an uncertain process defined by the Liu integral. Some properties of Liu processes are investigated such as sample continuity property, finite variation property, and the fact that a continuously differentiable function of the Liu process is another Liu process, among others. Based on the Liu process, the uncertain integral is extended. Furthermore, some mathematical properties are proved, including the fundamental theorem, change of variable theorem, and integration by parts theorem. Finally, uncertain calculus with respect to multiple Liu processes is discussed.

Cited by 101Open access

Dialectical logic: the Process Calculus

Robert E. Kent · arXiv (Cornell University) · 2018

Dialectical logic is the logic of dialectical processes. The goal of dialectical logic is to reveal the dynamical notions inherent in logical computational systems. The fundamental notions of proposition and truth-value in standard logic are subsumed by the notions of process and flow in dialectical logic. Standard logic motivates the core sequential aspect of dialectical logic. Horn-clause logic requires types and nonsymmetry and also motivates the parallel aspect of dialectical logic. The process logics of Milner and Hoare reveal the internal/external aspects of dialectical logic. The sequential internal aspect of dialectical logic should be viewed as a typed or distributed version of Girard's linear logic with nonsymmetric tensor. The simplest version of dialectical logic is inherently intuitionistic. However, by following Glivenko's approach in standard logic using double negation closure, we can define a classical version of dialectical logic.

Cited by 0Open access

Uncertain Calculus With Yao Process

Xiangfeng Yang, Jinwu Gao, Samarjit Kar · IEEE Transactions on Fuzzy Systems · 2016

Uncertain calculus is a branch of mathematics that deals with the differentiation and integration of functions of uncertain processes. This paper investigates the Yao process defined by the Yao integral and extends the uncertain calculus on the Yao process. Some important results are developed for finite variation and linearity of integral. Moreover, this paper proposes a concept of the multifactor Yao process and also gives a fundamental theorem for it.

Cited by 18

Cap: An Actor dedicated process calculus

J-L. Colaço, M. Pantel, P. Sallé · 1996

This paper presents a process calculus in which actors and asynchronous communications are primitives [7]. This calculus has been designed with the aim of studying type inference for actor based languages. For this purpose we took inspiration in existing concurrent calculus: Milner's -calculus [12], Vasconcelos' concurrent objects [15] and Cardelli's primitive objects [1]

Cited by 0

A Process Calculus of Atomic Commit

Laura Bocchi, Lucian Wischik · Electronic Notes in Theoretical Computer Science · 2004

This article points out a strong connection between process calculi and atomic commit. Process calculus rendezvous is an abstract semantics for atomic commitment. An implementation of process-calculus rendezvous is an atomic commit protocol. Thus, the traditional correctness properties for atomic commit are entailed by a bisimulation proof of a calculus implementation. Actually, traditional rendezvous as found in the pi calculus corresponds to just a special case of atomic commit called a binary cohesion. If we take the general case of atomic commit, this induces a richer form of calculus rendezvous similar to the join calculus [Fournet, C. and G. Gonthier, The reflexive chemical abstract machine and the join-calculus, in: Proceedings of POPL '96, ACM (1996), pp. 372–385. URL http://research.microsoft.com/~fournet/papers/reflexive-cham-join-calculus.ps]. As an extended example of the analogy between calculus and atomic commit, we use the induced calculus to reformulate an earlier 2PCP correctness result by Berger and Honda [Berger, M. and K. Honda, The two-phase commitment protocol in an extended pi-calculus, in: EXPRESS '00, Electronic Notes in Theoretical Computer Science 39 (2000). URL ftp://ftp.dcs.qmw.ac.uk/lfp/martinb/express00.ps.gz].

Cited by 7Open access

A Process Calculus with Logical Operators

Yan Zhang, Zhaohui Zhu, Jinjin Zhang et al. · arXiv (Cornell University) · 2012

In order to combine operational and logical styles of specifications in one unified framework, the notion of logic labelled transition systems (Logic LTS, for short) has been presented and explored by Lüttgen and Vogler in [TCS 373(1-2):19-40; Inform. & Comput. 208:845-867]. In contrast with usual LTS, two logical constructors $\wedge$ and $\vee$ over Logic LTSs are introduced to describe logical combinations of specifications. Hitherto such framework has been dealt with in considerable depth, however, process algebraic style way has not yet been involved and the axiomatization of constructors over Logic LTSs is absent. This paper tries to develop Lüttgen and Vogler's work along this direction. We will present a process calculus for Logic LTSs (CLL, for short). The language CLL is explored in detail from two different but equivalent views. Based on behavioral view, the notion of ready simulation is adopted to formalize the refinement relation, and the behavioral theory is developed. Based on proof-theoretic view, a sound and ground-complete axiomatic system for CLL is provided, which captures operators in CLL through (in)equational laws.

Cited by 1Open access

Stochastic Calculus for the Theta Process

Francesco Cellarosi, Zachary Selk · arXiv (Cornell University) · 2024

The theta process is a stochastic process of number theoretical origin arising as a scaling limit of quadratic Weyl sums. It can be described in terms of the geodesic flow and an automorphic function on a homogeneous space. This process has several properties in common with Brownian motion such as its Hölder regularity, uncorrelated increments and quadratic variation. However, crucially, we show that the theta process is not a semimartingale, making Itô calculus techniques inapplicable. Instead, we use the celebrated rough paths theory to develop the stochastic calculus for the theta process. We do so by constructing the iterated integrals - the ``rough path" - above the theta process. Rough paths theory takes a signal and its iterated integrals and produces a vast and robust theory of stochastic differential equations. In addition, the rough path we construct can be described in terms of higher rank theta sums, via equidistribution of horocycle lifts.

Cited by 0Open access

A Process Calculus for Distributed Objects

Jody Threet, John Hale, Sujeet Shenoi · 1996

Distributed system specification and verification are active areas of research. Object technologies have shown great promise for managing the complexities of distributed systems. However, existing formal models for object systems do not capture the concurrency inherent in parallel and distributed systems, and available concurrency formalisms do not easily model objects. This paper describes the Robust Object Calculus (ROC) -- a process calculus for modeling concurrent and distributed objects. ROC supports complex message-passing and promotes agent encapsulation which make it ideal for modeling distributed object systems. A formal notion of behavioral equivalence is provided for ROC. This represents an important first step in developing a practical verification scheme for distributed object systems. Contact Author: John Hale, hale@euler.mcs.utulsa.edu Tracks: long presentation Student paper: yes, John Hale and Jody Threet are full-time students. To whom correspondence should be addre...

Cited by 0

A process calculus SMrCaIT for IoT

Ningning Chen, Huibiao Zhu · Journal of Software Evolution and Process · 2023

Abstract With the rapid popularization of smart devices, the applications and technologies of the Internet of Things (IoT) are in high demand worldwide, especially in improving development efficiency and ensuring system quality, reliability, and security. Formal methods have been successfully used to specify, verify, and analyze software and hardware systems, effectively alleviating the above problems in these systems. However, most of the existing works mainly focus on the practical applications of IoT, and there is a lack of research on modeling and analyzing IoT systems from the perspective of formal methods. In this paper, we first propose a secure mobile real‐time process calculus for specifying and reasoning about IoT systems, called SMrCaIT, which supports not only value‐passing communication but also name‐passing communication. In addition, this calculus can strictly separate process actions and mobility modeling by providing parametric mobility models. Subsequently, we present the operational semantics of this calculus, in particular, the rules on how to secure channel communication by closing the scope of a channel and handling scope extrusion. Taking vehicle ad hoc network (VANET) as a case, the application details of SMrCaIT and its operational semantics are fully demonstrated. By using the rewrite engine Real‐Time Maude, we further implement SMrCaIT and its operational semantics and verify some properties of the VANET case to indicate the effectiveness of our calculus in real‐world scenes.

Cited by 3Open access

A Generalized Deadlock-Free Process Calculus

Eijiro Sumii, Naoki Kobayashi · Electronic Notes in Theoretical Computer Science · 1998

Deadlock is one of the most serious problems in concurrent programming. Recently, Kobayashi proposed a static type system for a process calculus which ensures that communication over some special channels never causes deadlock. However, since the class of such channels was fixed ad hoc by the type system, the deadlock-free fragment of the calculus was limited and the essence of the type system was not so clear. In this paper, we generalize his type system in order to extend the deadlock-free part of his calculus. For that purpose, we annotate each channel type with an expression called a usage, which specifies how the channel can and must be used. It is automatically checked by the type system that the usage does not cause deadlock and that the channel is indeed used along the specification. As a result, the deadlock-freedom property is treated more uniformly and guaranteed more extensively.

Cited by 34Open access