Interleaving vs True Concurrency: Some Instructive Security Examples

Gorrieri, Roberto

doi:10.1007/978-3-030-51831-8_7

Cited by 4 publications

(1 citation statement)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Concrete semantics, such as team bisimilarity, which observe also the structure of the distributed state are resource aware, and so potentially more useful in practical applications. For instance, the security paper [36] shows that an illegal information flow cannot be detected if the low user cannot observe the structure of the state.…”

Section: A1 Associativitymentioning

confidence: 99%

Team bisimilarity, and its associated modal logic, for BPP nets

Gorrieri

2020

Acta Informatica

Self Cite

View full text Add to dashboard Cite

BPP nets, a subclass of finite Place/Transition Petri nets, are equipped with an efficiently decidable, truly concurrent, bisimulation-based, behavioral equivalence, called team bisimilarity. This equivalence is a very intuitive extension of classic bisimulation equivalence (over labeled transition systems) to BPP nets and it is checked in a distributed manner, without necessarily building a global model of the overall behavior of the marked BPP net. An associated distributed modal logic, called team modal logic (TML, for short), is presented and shown to be coherent with team bisimilarity: two markings are team bisimilar if and only if they satisfy the same TML formulae. As the process algebra BPP (with guarded summation and guarded body of constants) is expressive enough to represent all and only the BPP nets, we provide algebraic laws for team bisimilarity as well as a finite, sound and complete, axiomatization.

show abstract

Section: A1 Associativitymentioning

confidence: 99%