activity
20082019
most citedPsi-calculi: a framework for mobile processes with nominal data and logic

82 citations · 143 across the 7 of their papers we have counts for

collaborators
Showing cs.LOShow all

7 papers · 1 filter

cs.LO2019★ 4 cited

Modal Logics for Nominal Transition Systems

Joachim Parrow, Johannes Borgström, Lars-Henrik Eriksson +2

We define a general notion of transition system where states and action labels can be from arbitrary nominal sets, actions may bind names, and state predicates from an arbitrary lo…

cs.LO2016★ 10 cited

The Largest Respectful Function

Joachim Parrow, Tjark Weber

Respectful functions were introduced by Sangiorgi as a compositional tool to formulate short and clear bisimulation proofs. Usually, the larger the respectful function, the easier…

cs.LO2015★ 2 cited

A Sorted Semantic Framework for Applied Process Calculi

Johannes Borgström, Ramūnas Gutkovas, Joachim Parrow +2

Applied process calculi include advanced programming constructs such as type systems, communication with pattern matching, encryption primitives, concurrent constraints, nondetermi…

cs.LO2014★ 3 cited

Priorities Without Priorities: Representing Preemption in Psi-Calculi

Johannes Åman Pohjola, Joachim Parrow

Psi-calculi is a parametric framework for extensions of the pi-calculus with data terms and arbitrary logics. In this framework there is no direct way to represent action prioritie…

cs.LO2011★ 82 cited

Psi-calculi: a framework for mobile processes with nominal data and logic

Jesper Bengtson, Magnus Johansson, Joachim Parrow +1

The framework of psi-calculi extends the pi-calculus with nominal datatypes for data structures and for logical assertions and conditions. These can be transmitted between processe…

cs.LO2010★ 7 cited

A Fully Abstract Symbolic Semantics for Psi-Calculi

Magnus Johansson, Björn Victor, Joachim Parrow

We present a symbolic transition system and bisimulation equivalence for psi-calculi, and show that it is fully abstract with respect to bisimulation congruence in the non-symbolic…

cs.LO2008★ 35 cited

Formalising the pi-calculus using nominal logic

Jesper Bengtson, Joachim Parrow

We formalise the pi-calculus using the nominal datatype package, based on ideas from the nominal logic by Pitts et al., and demonstrate an implementation in Isabelle/HOL. The purpo…