English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

In the logic programming paradigm, it is difficult to develop an elegantsolution for generating distinguishing formulae that witness the failure ofopen-bisimilarity between two pi-calculus processes; this was unexpectedbecause the semantics of the pi-calculus and open bisimulation have alreadybeen elegantly specified in higher-order logic programming systems. Oursolution using Haskell defines the formulae generation as a tree transformationfrom the forest of all nondeterministic bisimulation steps to a pair ofdistinguishing formulae. Thanks to laziness in Haskell, only the necessarypaths demanded by the tree transformation function are generated. Our workdemonstrates that Haskell and its libraries provide an attractive platform forsymbolically analyzing equivalence properties of labeled transition systems inan environment sensitive setting.

Generating Witness of Non-Bisimilarity for the pi-Calculus