Notes on nominal calculi for security and mobility
From MaRDI portal
Recommendations
Cited in
(12)- Manipulating trees with hidden labels
- Nominal automata for resource usage control
- Decidability Results for Restricted Models of Petri Nets with Name Creation and Replication
- Mobile processes: A commented bibliography
- Regular and context-free nominal traces
- Trustworthy Global Computing
- Decidability and complexity of Petri nets with unordered data
- Foundations of Software Science and Computational Structures
- Advances in Computing Science – ASIAN 2003. Progamming Languages and Distributed Computation Programming Languages and Distributed Computation
- Foundations of Security Analysis and Design II
- Multiset rewriting for the verification of depth-bounded processes with name binding
- Access control in mobile ambient calculi: a comparative view
This page was built for publication: Notes on nominal calculi for security and mobility
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4798028)