[Paper Review] Determinacy in a synchronous pi-calculus

Roberto M. Amadio, Mehdi Dogguy|arXiv (Cornell University)|Jul 4, 2007

Logic, programming, and type systems26 references3 citations

TL;DR

This paper presents a compositional semantics for the synchronous $S\pi$-calculus using labelled transition systems and bisimulation, establishing that determinacy is equivalent to confluence in this setting. It shows that for reactive programs, local confluence—combined with reactivity—guarantees determinacy, offering a practical verification criterion for deterministic behavior in synchronous concurrent systems with signal-based communication and name mobility.

ABSTRACT

The S-pi-calculus is a synchronous pi-calculus which is based on the SL model. The latter is a relaxation of the Esterel model where the reaction to the absence of a signal within an instant can only happen at the next instant. In the present work, we present and characterise a compositional semantics of the S-pi-calculus based on suitable notions of labelled transition system and bisimulation. Based on this semantic framework, we explore the notion of determinacy and the related one of (local) confluence.

Motivation & Objective

• To develop a compositional semantics for the $S\pi$-calculus based on labelled transition systems and bisimulation.
• To formalize and characterize determinacy in the context of synchronous process calculi with signal-based communication and name mobility.
• To clarify the relationship between determinacy, confluence, and reactivity in the $S\pi$-calculus.
• To provide a practical verification criterion for determinacy using local confluence and reactivity.

Proposed method

• Define a labelled transition system for the $S\pi$-calculus that captures synchronous interactions via signals and actions including input, output, and silent ($\tau$) steps.
• Introduce a notion of bisimulation over the labelled transition system to define contextual equivalence.
• Formalize confluence as a property ensuring that all diverging computation paths from a state can be rejoined up to bisimulation.
• Establish that confluence implies determinacy in the $S\pi$-calculus, leveraging the automatic commutation of input and output actions.
• Introduce local confluence as a weaker, more checkable condition that, when combined with reactivity, implies full confluence.
• Prove that for reactive programs, local confluence is equivalent to confluence and thus implies determinacy.

Experimental results

Research questions

• RQ1 How can determinacy be formally characterized in a synchronous $\pi$-calculus with signal-based communication and name mobility?
• RQ2 What is the relationship between confluence and determinacy in the $S\pi$-calculus, and does it differ from the asynchronous $\pi$-calculus?
• RQ3 Can local confluence serve as a practical criterion for verifying determinacy in reactive $S\pi$ programs?
• RQ4 How does reactivity interact with confluence and determinacy in synchronous systems?
• RQ5 What structural or typing constraints can prevent non-deterministic behavior in $S\pi$ programs?

Key findings

• Determinacy in the $S\pi$-calculus is equivalent to confluence, a stronger property than in asynchronous calculi where confluence strengthens determinacy.
• For reactive programs, local confluence is equivalent to confluence, enabling a practical verification method based on checking local divergence paths.
• The automatic commutation of input and output actions in the $S\pi$-calculus ensures that input/output actions commute with other compatible actions, simplifying confluence proofs.
• A strong commutation property of $\tau$-actions—where multiple $\tau$-derivatives can be merged—implies $\tau$-inertness and thus determinacy.
• The paper identifies two key sources of non-determinism: competing inputs on the same signal within an instant and multiple values available on a signal at the end of an instant.
• The authors propose an affine type system to prevent the first source of non-determinism and allow the second only when the continuation's behavior is order-independent.