Recommendations
Cites work
- A compositional Petri net translation of general -calculus terms
- A polynomial translation of -calculus (FCP) to safe Petri nets
- A technique of state space search based on unfolding
- Canonical prefixes of Petri net unfoldings
- Cunf: a tool for unfolding and verifying Petri nets with read arcs
- scientific article; zbMATH DE number 1101602 (Why is no real title available?)
- scientific article; zbMATH DE number 1884409 (Why is no real title available?)
- Petri nets, event structures and domains. I
- Refinement of actions and equivalence notions for concurrent systems
- Structural non-interference in elementary and trace nets
- Types of Asynchronous Diagnosability and the Reveals-Relation in Occurrence Nets
- Unfoldings: A partial-order approach to model checking.
Cited in
(11)- Multilevel transitive and intransitive non-interference, causally
- Rule formats for compositional non-interference properties
- An optimization-based approach to assess non-interference in labeled and bounded Petri net systems
- Factorization of behavioral integrity
- A causal view on non-interference
- On intransitive non-interference in some models of concurrency
- Non-interference notions based on reveals and excludes relations for Petri nets
- Lectures on Concurrency and Petri Nets
- Applications and Theory of Petri Nets 2004
- Computing a parametric reveals relation for bounded equal-conflict Petri nets
- A coalgebraic semantics for causality in Petri nets
This page was built for publication: Non-interference by unfolding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5166764)