Repository landing page

We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
oaioai:doaj.org/article:a3c81d928d584cd0a6980edff7a9b355

A Decidable Characterization of a Graphical Pi-calculus with Iterators

Authors
Publication date
1 October 2010
Publisher
'Open Publishing Association'
Doi

    Abstract

    This paper presents the Pi-graphs, a visual paradigm for the modelling and verification of mobile systems. The language is a graphical variant of the Pi-calculus with iterators to express non-terminating behaviors. The operational semantics of Pi-graphs use ground notions of labelled transition and bisimulation, which means standard verification techniques can be applied. We show that bisimilarity is decidable for the proposed semantics, a result obtained thanks to an original notion of causal clock as well as the automatic garbage collection of unused names

    Similar works

    Full text

    thumbnail-image

    Directory of Open Access Journals

    redirect
    oaioai:doaj.org/article:a3c81d928...
    Last time updated on 17/12/2014

    This paper was published in Directory of Open Access Journals.

    Having an issue?

    Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.