Interleaving vs True Concurrency: Some Instructive Security Examples
From MaRDI portal
Publication:5100754
DOI10.1007/978-3-030-51831-8_7zbMath1503.68191OpenAlexW3037439142MaRDI QIDQ5100754
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
Related Items (5)
A Study on Team Bisimulations for BPP Nets ⋮ Decidability of Two Truly Concurrent Equivalences for Finite Bounded Petri Nets ⋮ Runners for interleaving algebraic effects ⋮ Team bisimilarity, and its associated modal logic, for BPP nets ⋮ A study on team bisimulation and H-team bisimulation for BPP nets
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- Undecidability of bisimilarity for Petri nets and some related problems
- Introduction to concurrency theory. Transition systems and CCS
- Process algebras for Petri nets. The alphabetization of distributed systems
- Verification of finite-state machines: a distributed approach
- Concurrent bisimulations in Petri nets
- A Causal View on Non-Interference*
- On Intransitive Non-interference in Some Models of Concurrency
- Causality, Behavioural Equivalences, and the Security of Cyberphysical Systems
- Structure Preserving Bisimilarity, Supporting an Operational Petri Net Semantics of CCSP
- Structural non-interference in elementary and trace nets
- Three Partition Refinement Algorithms
- Formal verification of parallel programs
- A Study on Team Bisimulations for BPP Nets
- Lectures on Concurrency and Petri Nets
This page was built for publication: Interleaving vs True Concurrency: Some Instructive Security Examples
