Multiset rewriting for the verification of depth-bounded processes with name binding
type: Item
instance of: scholarly article
title: Multiset rewriting for the verification of depth-bounded processes with name binding
zbMATH Open document ID: 1277.68204
author: Fernando Rosa-Velardo
author: María Martos-Salgado
published in: Information and Computation
publication date: 2012-10-11T00:00:00Z
Mathematics Subject Classification ID: 68Q85
Mathematics Subject Classification ID: 68Q42
Mathematics Subject Classification ID: 68Q60
zbMATH DE Number: 6092759
zbMATH Keywords: multiset rewriting
zbMATH Keywords: depth-boundedness
zbMATH Keywords: WSTS
zbMATH Keywords: verification
zbMATH Keywords: decidability
zbMATH Keywords: Petri nets
zbMATH Keywords: process algebra
describes a project that uses: Petruchio
MaRDI profile type: Publication
full work available at URL: j.ic.2012.03.004
OpenAlex ID: W2018059643
Wikidata QID: Q57831209
cites work: Q4418589
cites work: A calculus for cryptographic protocols: The spi calculus
cites work: Q4798028
cites work: Q4530846
cites work: Distributed semantics for the \(\pi \)-calculus based on Petri nets with inhibitor ARCS
cites work: A theory of structural stationarity in the \(\pi\)-calculus
cites work: On the Relationship between π-Calculus and Finite Place/Transition Petri Nets
cites work: Encoding Asynchronous Interactions Using Open Petri Nets
cites work: Well-structured transition systems everywhere!
cites work: Q3601864
cites work: Q3601861
cites work: Decidability and complexity of Petri nets with unordered data
cites work: Decidability Problems in Petri Nets with Names and Replication
cites work: Comparing the Expressive Power of Well-Structured Transition Systems
cites work: Q5192932
cites work: Mobile ambients
cites work: When ambients cannot be opened
cites work: Multiset Rewriting: A Semantic Framework for Concurrency with Name Binding
cites work: Depth Boundedness in Multiset Rewriting Systems with Name Binding
cites work: Ordering by Divisibility in Abstract Algebras
cites work: Rewriting logic as a semantic framework for concurrency: a progress report
cites work: All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
cites work: Algorithmic analysis of programs with well quasi-ordered domains.
cites work: Forward Analysis of Depth-Bounded Processes
cites work: Q5389997
cites work: Forward Analysis for WSTS, Part II: Complete WSTS
cites work: Verification, Model Checking, and Abstract Interpretation
cites work: Q5590814
cites work: Revisiting Ackermann-Hardness for Lossy Counter Machines and Reset Petri Nets
cites work: Q4421726
cites work: The \(\pi\)-calculus: A theory of mobile processes
cites work: A symbolic procedure for control reachability in the asynchronous \(\pi\)-calculus (extended abstract)
cites work: The covering and boundedness problems for vector addition systems
cites work: Programming Languages and Systems
cites work: Deciding reachability problems in Turing-complete fragments of Mobile Ambients
cites work: Reachability analysis of fragments of mobile ambients in AC term rewriting
cites work: Deciding Reachability in Mobile Ambients with Name Restriction
cites work: A well-structured framework for analysing Petri net extensions
cites work: Parameterized Verification of Ad Hoc Networks
cites work: On the Power of Cliques in the Parameterized Verification of Ad Hoc Networks
DBLP publication ID: journals/iandc/Rosa-VelardoM12
DOI: 10.1016/J.IC.2012.03.004
description: scientific article; zbMATH DE number 6092759