Deciding Selective Declassification of Petri Nets

DOI10.1007/978-3-642-28641-4_16MaRDI QIDQ2894328zbMATH OpenOpenAlexFDO

Authors Eike Best, Philippe Darondeau

Publication date 29 June 2012

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-28641-4_16

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• scientific article; zbMATH DE number 559221
• scientific article; zbMATH DE number 827979
• Entscheidbarkeit bei Petri Netzen
• Deciding detectability for labeled Petri nets
• Decomposition of Petri nets
• Decidability of the Petri net reachability problem
• Decidability of opacity verification problems in labeled Petri net systems
• scientific article; zbMATH DE number 4092785
• scientific article; zbMATH DE number 1302047
• The formalization of decision-free Petri net

Cited in

(2)

• Multilevel transitive and intransitive non-interference, causally
• Non-interference notions based on reveals and excludes relations for Petri nets

This page was built for publication: Deciding Selective Declassification of Petri Nets

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