process algebras
Recently Published Documents


TOTAL DOCUMENTS

183
(FIVE YEARS 1)

H-INDEX

20
(FIVE YEARS 0)

Author(s):  
Luca Aceto ◽  
Elli Anastasiadi ◽  
Valentina Castiglioni ◽  
Anna Ingolfsdottir ◽  
Bas Luttik


Author(s):  
Xudong Qin ◽  
Yuxin Deng ◽  
Wenjie Du

Abstract One important application of quantum process algebras is to formally verify quantum communication protocols. With a suitable notion of behavioural equivalence and a decision method, one can determine if an implementation of a protocol is consistent with its specification. Ground bisimulation is a convenient behavioural equivalence for quantum processes because of its associated coinduction proof technique. We exploit this technique to design and implement two on-the-fly algorithms for the strong and weak versions of ground bisimulation to check if two given processes in quantum CCS are equivalent. We then develop a tool that can verify interesting quantum protocols such as the BB84 quantum key distribution scheme.





10.29007/whn1 ◽  
2018 ◽  
Author(s):  
Luca Bortolussi ◽  
Alberto Policriti

Building on a technique for associating Hybrid Systems (HS) to stochastic programs written in a stochastic extension of Concurrent Constraint Programming (sCCP), we will discuss several aspects of performing such association. In particular, as we proved an sCCP program can be mapped in a HS varying in a lattice at a level depending on the amount of actions to be simulated continuously, we will discuss what are the problems involved in a semi-automatic choice of such level. Decidability, semantic, and efficiency issues will be taken into account, with special emphasis on their links with biological applications. We will also discuss about the role of constraints and of the constraint store is this construction.



2017 ◽  
Vol 28 (7) ◽  
pp. 1126-1168
Author(s):  
EMMANUEL BEFFARA

A quantitative model of concurrent interaction is introduced. The basic objects are linear combinations of partial order relations, acted upon by a group of permutations that represents potential non-determinism in synchronisation. This algebraic structure is shown to provide faithful interpretations of finitary process algebras, for an extension of the standard notion of testing semantics, leading to a model that is both denotational (in the sense that the internal workings of processes are ignored) and non-interleaving. Constructions on algebras and their subspaces enjoy a good structure that make them (nearly) a model of differential linear logic, showing that the underlying approach to the representation of non-determinism as linear combinations is the same.



Author(s):  
Roberto Gorrieri
Keyword(s):  


2015 ◽  
Vol 26 (6) ◽  
pp. 933-968 ◽  
Author(s):  
JOS C. M. BAETEN ◽  
BAS LUTTIK ◽  
TIM MULLER ◽  
PAUL VAN TILBURG

The languages accepted by finite automata are precisely the languages denoted by regular expressions. In contrast, finite automata may exhibit behaviours that cannot be described by regular expressions up to bisimilarity. In this paper, we consider extensions of the theory of regular expressions with various forms of parallel composition and study the effect on expressiveness. First we prove that adding pure interleaving to the theory of regular expressions strictly increases its expressiveness modulo bisimilarity. Then, we prove that replacing the operation for pure interleaving by ACP-style parallel composition gives a further increase in expressiveness, still insufficient, however, to facilitate the expression of all finite automata up to bisimilarity. Finally, we prove that the theory of regular expressions with ACP-style parallel composition and encapsulation is expressive enough to express all finite automata up to bisimilarity. Our results extend the expressiveness results obtained by Bergstra, Bethke and Ponse for process algebras with (the binary variant of) Kleene's star operation.



2014 ◽  
Vol 26 (6) ◽  
pp. 969-992 ◽  
Author(s):  
UGO DAL LAGO ◽  
SIMONE MARTINI ◽  
DAVIDE SANGIORGI

We show that the techniques for resource control that have been developed by the so-calledlight logicscan be fruitfully applied also to process algebras. In particular, we present a restriction of higher-order π-calculus inspired by soft linear logic. We prove that any soft process terminates in polynomial time. We argue that the class of soft processes may be naturally enlarged so that interesting processes are expressible, still maintaining the polynomial bound on executions.



Sign in / Sign up

Export Citation Format

Share Document