Non-interference by Unfolding
- 1 January 2014
- conference paper
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
Abstract
No abstract availableThis publication has 19 references indexed in Scilit:
- Cunf: A Tool for Unfolding and Verifying Petri Nets with Read ArcsLecture Notes in Computer Science, 2013
- On the Decidability of Non Interference over Unbounded Petri NetsElectronic Proceedings in Theoretical Computer Science, 2011
- Structural non-interference in elementary and trace netsMathematical Structures in Computer Science, 2009
- A compositional Petri net translation of general π -calculus termsFormal Aspects of Computing, 2008
- Canonical prefixes of Petri net unfoldingsActa Informatica, 2003
- Refinement of actions and equivalence notions for concurrent systemsActa Informatica, 2001
- Representation theorems for Petri NetsLecture Notes in Computer Science, 1997
- A technique of state space search based on unfoldingFormal Methods in System Design, 1995
- Petri nets, event structures and domains, part ITheoretical Computer Science, 1981
- Solution of a problem in concurrent programming controlCommunications of the ACM, 1965