Information and Computation
A calculus for cryptographic protocols
Information and Computation
Theoretical Computer Science
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
Rewriting Logic as a Semantic Framework for Concurrency: a Progress Report
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
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
Rewriting Logic as a Unifying Framework for Petri Nets
Unifying Petri Nets, Advances in Petri Nets
Some Chemical Abstract Machines
A Decade of Concurrency, Reflections and Perspectives, REX School/Symposium
A Meta-Notation for Protocol Analysis
CSFW '99 Proceedings of the 12th IEEE workshop on Computer Security Foundations
About permutation algebras, (pre)sheaves and named sets
Higher-Order and Symbolic Computation
On the Expressiveness of Mobile Synchronizing Petri Nets
Electronic Notes in Theoretical Computer Science (ENTCS)
A Name Abstraction Functor for Named Sets
Electronic Notes in Theoretical Computer Science (ENTCS)
Nets with Tokens which Carry Data
Fundamenta Informaticae - PETRI NETS 2007
Name Creation vs. Replication in Petri Net Systems
Fundamenta Informaticae - PETRI NETS 2007
A theory of structural stationarity in the π-Calculus
Acta Informatica
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
Typed Mobile Ambients in Maude
Electronic Notes in Theoretical Computer Science (ENTCS)
Deciding reachability problems in turing-complete fragments of mobile ambients
Mathematical Structures in Computer Science
Comparing the expressive power of well-structured transition systems
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Depth boundedness in multiset rewriting systems with name binding
RP'10 Proceedings of the 4th international conference on Reachability problems
Multiset rewriting for the verification of depth-bounded processes with name binding
Information and Computation
| Hi-index | 0.01 |
We revise multiset rewriting with name binding, by combining the two main existing approaches to the study of concurrency by means of multiset rewriting: multiset rewriting with existential quantification and constrained multiset rewriting. We obtain ν-MSRs, where we rewrite multisets of atomic formulae, in which some names may be restricted. We prove that ν-MSRs are equivalent to a class of Petri nets in which tokens are tuples of pure names, called pν-APNs. Then we encode π-calculus processes into ν-MSRs in a very direct way, that preserves the topology of bound names, by using the concept of derivatives of a π-calculus process. Finally, we discuss how the recent results on decidable subclasses of the π-calculus are independent of the particular reaction rule of the π-calculus, so that they can be obtained in the more general framework of ν-MSRs. Thus, those results carry over not only to the π-calculus, but to any other formalism that can be encoded within it, as pν-APNs.