A calculus for cryptographic protocols
Information and Computation
Algorithmic analysis of programs with well quasi-ordered domains
Information and Computation - Special issue: LICS 1996—Part 1
Well-structured transition systems everywhere!
Theoretical Computer Science
PI-Calculus: A Theory of Mobile Processes
PI-Calculus: A Theory of Mobile Processes
Notes on Nominal Calculi for Security and Mobility
FOSAD '00 Revised versions of lectures given during the IFIP WG 1.7 International School on Foundations of Security Analysis and Design on Foundations of Security Analysis and Design: Tutorial Lectures
Typed MSR: Syntax and Examples
MMM-ACNS '01 Proceedings of the International Workshop on Information Assurance in Computer Networks: Methods, Models, and Architectures for Network Security
A Meta-Notation for Protocol Analysis
CSFW '99 Proceedings of the 12th IEEE workshop on Computer Security Foundations
On the Expressiveness of Mobile Synchronizing Petri Nets
Electronic Notes in Theoretical Computer Science (ENTCS)
Instance Isolation Analysis for Service-Oriented Architectures
SCC '08 Proceedings of the 2008 IEEE International Conference on Services Computing - Volume 1
Name Creation vs. Replication in Petri Net Systems
Fundamenta Informaticae - PETRI NETS 2007
A theory of structural stationarity in the π-Calculus
Acta Informatica
Generation of Database Transactions with Petri Nets
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Encoding Asynchronous Interactions Using Open Petri Nets
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
On the Relationship between η-Calculus and Finite Place/Transition Petri Nets
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Expand, Enlarge and Check: New algorithms for the coverability problem of WSTS
Journal of Computer and System Sciences
Multiset rewriting: a semantic framework for concurrency with name binding
WRLA'10 Proceedings of the 8th international conference on Rewriting logic and its applications
Forward analysis of depth-bounded processes
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
On the power of cliques in the parameterized verification of Ad Hoc networks
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
Multiset rewriting for the verification of depth-bounded processes with name binding
Information and Computation
| Hi-index | 0.00 |
In this paper we consider ν-MSR, a formalism that combines the two main existing approaches for multiset rewriting, namely MSR and CMRS. In ν-MSR we rewrite multisets of atomic formulae, in which some names may be restricted. ν-MSR are Turing complete. In particular, a very straightforward encoding of π-calculus process can be done. Moreover, pν-PN, an extension of Petri nets in which tokens are tuples of pure names, are equivalent to ν-MSR. We know that the monadic subclass of ν-MSR is a Well Structured Transition System. Here we prove that depth-bounded ν-MSR, that is, ν-MSR systems for which the interdependance of names is bounded, are also Well Structured, by following the analogous steps to those followed by R. Meyer in the case of the π-calculus. As a corollary, also depth-bounded pν-PN are WSTS, so that coverability is decidable for them.