J. Parrow

Publications105
h-index29
Citations9,073
Highly Influential Citations395
Claim Author Page
Author pages are created from data sourced from our academic publisher partnerships and public sources.

Recommended Authors

  • D. Sangiorgi
  • 222 Publications • 11,188 Citations
  • B. Victor
  • 133 Publications • 1,262 Citations
  • R. Milner
  • 248 Publications • 49,792 Citations
  • J. Borgström
  • 52 Publications • 794 Citations
  • Publications
  • Influence
A calculus of mobile processes, II
A Calculus of Mobile Processes, II
Calculus of Mobile Processes
TLDR
The a-calculus is presented, a calculus of communicating systems in which one can naturally express processes which have changing structure, including the algebraic theory of strong bisimilarity and strong equivalence, including a new notion of equivalence indexed by distinctions.
The concurrency workbench: a semantics-based tool for the verification of concurrent systems
TLDR
The Concurrency Workbench is an automated tool for analyzing networks of finite-state processes expressed in Milner's Calculus of Communicating Systems and a large number of interesting verification methods can be formulated as combinations of a small number of primitive algorithms.
The fusion calculus: expressiveness and symmetry in mobile processes
  • J. Parrow, B. Victor
  • Computer Science
    Proceedings. Thirteenth Annual IEEE Symposium on…
  • 21 June 1998
TLDR
The fusion calculus contains the polyadic /spl pi/-calculus as a proper subcalculus and thus inherits all its expressive power, and is presented as a significant step towards a canonical calculus of concurrency.
Modal Logics for Mobile Processes
An Introduction to the π-Calculus
  • J. Parrow
  • Computer Science
    Handbook of Process Algebra
  • 2001
Psi-calculi: a framework for mobile processes with nominal data and logic
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 processes and their names…
A Semantics Based Verification Tool for Finite State Systems
Algebraic Theories for Name-Passing Calculi
TLDR
This work provides complete axiomatisations of late and early bisimulation equivalences in such calculi as a calculus of deterministic processes which is reminiscent of sequential functional programs with a conditional construct.
...
1
2
3
4
5
...