Interleaving vs True Concurrency: Some Instructive Security Examples

DOI10.1007/978-3-030-51831-8_7MaRDI QIDQ5100754zbMATH OpenOpenAlexFDO

Authors Roberto Gorrieri

Publication date 1 September 2022

Published in Application and Theory of Petri Nets and Concurrency (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-51831-8_7

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites work

• scientific article; zbMATH DE number 3958739 (Why is no real title available?)
• scientific article; zbMATH DE number 4039251 (Why is no real title available?)
• scientific article; zbMATH DE number 3722109 (Why is no real title available?)
• scientific article; zbMATH DE number 17804 (Why is no real title available?)
• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 176758 (Why is no real title available?)
• scientific article; zbMATH DE number 1302047 (Why is no real title available?)
• scientific article; zbMATH DE number 1988986 (Why is no real title available?)
• scientific article; zbMATH DE number 1517989 (Why is no real title available?)
• scientific article; zbMATH DE number 1884405 (Why is no real title available?)
• scientific article; zbMATH DE number 1884409 (Why is no real title available?)
• A Study on Team Bisimulations for BPP Nets
• A causal view on non-interference
• Action refinement.
• Axiomatizing Team Equivalence for Finite-State Machines
• Causality, behavioural equivalences, and the security of cyberphysical systems
• Concurrent bisimulations in Petri nets
• Correct system design. Symposium in honor of Ernst-Rüdiger Olderog on the occasion of his 60th birthday, Oldenburg, Germany, September 8--9, 2015. Proceedings
• Formal verification of parallel programs
• Introduction to concurrency theory. Transition systems and CCS
• Lectures on Concurrency and Petri Nets
• On intransitive non-interference in some models of concurrency
• Process algebras for Petri nets. The alphabetization of distributed systems
• Structural non-interference in elementary and trace nets
• Structure preserving bisimilarity, supporting an operational Petri net semantics of CCSP
• Three Partition Refinement Algorithms
• Undecidability of bisimilarity for Petri nets and some related problems
• Verification of finite-state machines: a distributed approach

Cited in

(5)

• Decidability of Two Truly Concurrent Equivalences for Finite Bounded Petri Nets
• A Study on Team Bisimulations for BPP Nets
• Runners for interleaving algebraic effects
• A study on team bisimulation and H-team bisimulation for BPP nets
• Team bisimilarity, and its associated modal logic, for BPP nets

This page was built for publication: Interleaving vs True Concurrency: Some Instructive Security Examples

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5100754)