Non-interference by Unfolding

DOI10.1007/978-3-319-07734-5_11zbMath1334.68144OpenAlexW971450223MaRDI QIDQ5166764

Paolo Baldan, Alberto Carraro

Publication date: 8 July 2014

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-319-07734-5_11

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (2)

A coalgebraic semantics for causality in Petri nets ⋮ Non-interference Notions Based on Reveals and Excludes Relations for Petri Nets

Uses Software

• Cunf
• PEP

Cites Work

• Unnamed Item
• Unnamed Item
• A compositional Petri net translation of general \(\pi\)-calculus terms
• Petri nets, event structures and domains. I
• A technique of state space search based on unfolding
• Canonical prefixes of Petri net unfoldings
• Unfoldings: A partial-order approach to model checking.
• A Polynomial Translation of π-Calculus (FCP) to Safe Petri Nets
• Structural non-interference in elementary and trace nets
• Types of Asynchronous Diagnosability and the Reveals-Relation in Occurrence Nets
• Cunf: A Tool for Unfolding and Verifying Petri Nets with Read Arcs
• Refinement of actions and equivalence notions for concurrent systems

This page was built for publication: Non-interference by Unfolding