A partially deadlock-free typed process calculus

2002 ◽  
Author(s):  
N. Kobayashi
Keyword(s):  
Process Calculus

scholarly journals An Abstract Machine for a Higher-Order Distributed Process Calculus

2002 ◽  
Vol 66 (3) ◽  
pp. 145-169 ◽  
Author(s):  
Florence Germain ◽  
Marc Lacoste ◽  
Jean-Bernard Stefani
Keyword(s):  
Higher Order ◽  
Process Calculus ◽  
Abstract Machine ◽  
Distributed Process

scholarly journals Modeling Consensus in a Process Calculus

2003 ◽  
pp. 399-414 ◽  
Author(s):  
Uwe Nestmann ◽  
Rachele Fuzzati ◽  
Massimo Merro
Keyword(s):  
Process Calculus

scholarly journals Mapping Fusion and Synchronized Hyperedge Replacement into logic programming

2007 ◽  
Vol 7 (1-2) ◽  
pp. 123-151 ◽  
Author(s):  
IVAN LANESE ◽  
UGO MONTANARI
Keyword(s):  
Logic Programming ◽  
Mobile Systems ◽  
Intermediate Step ◽  
Process Calculus ◽  
Graph Transformations ◽  
Hyperedge Replacement

AbstractIn this paper we compare three different formalisms that can be used in the area of models for distributed, concurrent and mobile systems. In particular we analyze the relationships between a process calculus, the Fusion Calculus, graph transformations in the Synchronized Hyperedge Replacement with Hoare synchronization (HSHR) approach and logic programming. We present a translation from Fusion Calculus into HSHR (whereas Fusion Calculus uses Milner synchronization) and prove a correspondence between the reduction semantics of Fusion Calculus and HSHR transitions. We also present a mapping from HSHR into a transactional version of logic programming and prove that there is a full correspondence between the two formalisms. The resulting mapping from Fusion Calculus to logic programming is interesting since it shows the tight analogies between the two formalisms, in particular for handling name generation and mobility. The intermediate step in terms of HSHR is convenient since graph transformations allow for multiple, remote synchronizations, as required by Fusion Calculus semantics.

Algebra and logic for resource-based systems modelling

2009 ◽  
Vol 19 (5) ◽  
pp. 959-1027 ◽  
Author(s):  
MATTHEW COLLINSON ◽  
DAVID PYM
Keyword(s):  
Mathematical Modelling ◽  
Parallel Programming ◽  
Programming Language ◽  
Discrete Event ◽  
Specification Language ◽  
Explicit Representation ◽  
Process Calculus ◽  
Science And Engineering ◽  
Logical Foundations ◽  
Systems Modelling

Mathematical modelling is one of the fundamental tools of science and engineering. Very often, models are required to be executable, as a simulation, on a computer. In this paper, we present some contributions to the process-theoretic and logical foundations of discrete-event modelling with resources and processes. We present a process calculus with an explicit representation of resources in which processes and resources co-evolve. The calculus is closely connected to a logic that may be used as a specification language for properties of models. The logic is strong enough to allow requirements that a system has a certain structure: for example, that it is a parallel composite of subsystems. This work consolidates, extends and improves upon aspects of earlier work of ours in this area. An extended example, consisting of a semantics for a simple parallel programming language, indicates a connection with separating logics for concurrency.

scholarly journals Automated Verification of Equivalence on Quantum Cryptographic Protocols

10.29007/95pj ◽  
2018 ◽  
Author(s):  
Takahiro Kubota ◽  
Yoshihiko Kakutani ◽  
Go Kato ◽  
Yasuhito Kawano ◽  
Hideki Sakurada
Keyword(s):  
Formal Methods ◽  
Software Tool ◽  
Parallel Systems ◽  
Cryptographic Protocols ◽  
Automated Verification ◽  
Process Calculus ◽  
Quantum Process ◽  
Process Calculi ◽  
Security Proofs ◽  
Security Proof

t is recognized that security verification of cryptographic protocols tends to be difficult and in fact, some flaws on protocol designs or security proofs were found after they had been presented. The use of formal methods is a way to deal with such complexity. Especially, process calculi are suitable to describe parallel systems. Bisimilarity, which denotes that two processes behave indistinguishably from the outside, is a key notion in process calculi. However, by-hand verification of bisimilarity is often tedious when the processes have many long branches in their transitions. We developed a software tool to automatically verify bisimulation relation in a quantum process calculus qCCS and applied it to Shor and Preskill's security proof of BB84. The tool succeeds to verify the equivalence of BB84 and an EDP-based protocol, which are discussed in their proof.

Sign in / Sign up

Export Citation Format

Share Document