Modal Logics for Nominal Transition Systems

Parrow, Joachim; Borgström, Johannes; Eriksson, Lars-Henrik; Gutkovas, Ramūnas; Weber, Tjark

doi:10.4230/lipics.concur.2015.198

Cited by 8 publications

(3 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…TSSs do not include syntax for binding (and neither does [14]). We plan to integrate the nominal transition systems of Parrow et al [24] in our calculus, which can accommodate binders in SOS specifications. With such an addition, we would like to make examples with the π-calculus and its variants as TSSs that can be sent/received.…”

Section: Discussionmentioning

confidence: 99%

Lang-n-Send Extended: Sending Regular Expressions to Monitors

Cimini

2022

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

In prior work, Cimini has presented LANG-N-SEND, a π-calculus with language definitions.In this paper, we present an extension of this calculus called LANG-N-SEND +m . First, we revise LANG-N-SEND to work with transition system specifications rather than its language specifications. This revision allows the use of negative premises in deduction rules. Next, we extend LANG-N-SEND with monitors and with the ability of sending and receiving regular expressions, which then can be used in the context of larger regular expressions to monitor the execution of programs.We present a reduction semantics for LANG-N-SEND +m , and we offer examples that demonstrate the scenarios that our calculus captures.

show abstract

Section: Discussionmentioning

confidence: 99%

Lang-n-Send Extended: Sending Regular Expressions to Monitors

Cimini

2022

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

show abstract

“…4. A notion of nominal transition system was proposed by Parrow et al [19]. Nominal transition systems satisfy the requirements of transition systems with atoms naturally.…”

Section: Discussionmentioning

confidence: 99%

Reactive Turing Machines with Infinite Alphabets

Luttik,

Yang

2016

Preprint

View full text Add to dashboard Cite

The notion of Reactive Turing machine (RTM) was proposed as an orthogonal extension of Turing machines with interaction. RTMs are used to define the notion of executable transition system in the same way as Turing machines are used to define the notion of computable function on natural numbers. RTMs inherited finiteness of all sets involved from Turing machines, and as a consequence, in a single step, an RTM can only communicate elements from a finite set of data. Some process calculi, such as the π-calculus, essentially depend on an infinite alphabet of actions, and hence it immediately follows that transition systems specified in these calculi are not executable. On closer inspection, however, the π-calculus does not appear to use the infinite data in a non-computable manner.In this paper, we investigate several ways to relax the finiteness requirement. We start by considering a variant of RTMs in which all sets are allowed to be countable, and we get a notion of infinitary RTM. Infinitary RTMs are extremely expressive such that we can hardly use them as a expressiveness criterion. Then, we refine the model by adding extra restrictions. As a result, we define a notion of RTM with atoms. It is a more restricted variant of RTMs in which the sets of actions and data symbols are still allowed to be infinite. We propose a notion of of nominal executability based on RTMs with atoms, and show that every effective transition system with atoms is nominally executable. It will follow that processes definable in the π-calculus are nominally executable. In contrast, in the process specification language mCRL2 it is possible to specify processes that are not nominally executable. Thus, nominal executability provides a new expressiveness criterion for process calculi.

show abstract

“…The classical modal logic provided in that work is quite different from the classical variant of FM, obtained by removing the requirement that implication and box are preserved under reachability. Other work [Parrow et al 2017], introduces a more abstract classical modal logic characterising weak bisimilarities, that may be instantiated for the applied π -calculus [Parrow et al 2015]. The intuitionistic modal logic FM, in Sec.…”

Section: Comparison To Related Work On Labelled Bisimilaritymentioning

confidence: 99%

A Bisimilarity Congruence for the Applied pi-Calculus Sufficiently Coarse to Verify Privacy Properties

Horne

2018

Preprint

View full text Add to dashboard Cite

This paper is the first thorough investigation into the coarsest notion of bisimilarity for the applied π -calculus that is a congruence relation: open barbed bisimilarity. An open variant of labelled bisimilarity (quasi-open bisimilarity), better suited to constructing bisimulations, is proven to coincide with open barbed bisimilarity. These bisimilary congruences are shown to be characterised by an intuitionistic modal logic that can be used, for example, to describe an attack on privacy whenever a privacy property is violated. Open barbed bisimilarity provides a compositional approach to verifying cryptographic protocols, since properties proven can be reused in any context, including under input prefix. Furthermore, open barbed bisimilarity is sufficiently coarse for reasoning about security and privacy properties of cryptographic protocols; in constrast to the finer bisimilarity congruence, open bisimilarity, which cannot verify certain privacy properties.

show abstract

Modal Logics for Nominal Transition Systems

Cited by 8 publications

References 20 publications

Lang-n-Send Extended: Sending Regular Expressions to Monitors

Lang-n-Send Extended: Sending Regular Expressions to Monitors

Reactive Turing Machines with Infinite Alphabets

A Bisimilarity Congruence for the Applied pi-Calculus Sufficiently Coarse to Verify Privacy Properties

Contact Info

Product

Resources

About