Interleaving vs True Concurrency: Some Instructive Security Examples

DOI10.1007/978-3-030-51831-8_7zbMATH Open1503.68191OpenAlexW3037439142MaRDI QIDQ5100754FDOQ5100754

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

• Concurrent bisimulations in Petri nets
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Three Partition Refinement Algorithms
• Title not available (Why is that?)
• Formal verification of parallel programs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Undecidability of bisimilarity for Petri nets and some related problems
• Title not available (Why is that?)
• 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
• Action refinement.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A causal view on non-interference
• Introduction to concurrency theory. Transition systems and CCS
• Verification of finite-state machines: a distributed approach
• Process algebras for Petri nets. The alphabetization of distributed systems
• On intransitive non-interference in some models of concurrency
• Causality, behavioural equivalences, and the security of cyberphysical systems
• Structural non-interference in elementary and trace nets
• Lectures on Concurrency and Petri Nets
• Structure preserving bisimilarity, supporting an operational Petri net semantics of CCSP
• A Study on Team Bisimulations for BPP Nets
• Axiomatizing Team Equivalence for Finite-State Machines

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)