Multiset rewriting for the verification of depth-bounded processes with name binding (Q714507): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Petruchio / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ic.2012.03.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2018059643 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q57831209 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4418589 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A calculus for cryptographic protocols: The spi calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4798028 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4530846 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed semantics for the \(\pi \)-calculus based on Petri nets with inhibitor ARCS / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of structural stationarity in the \(\pi\)-calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Relationship between π-Calculus and Finite Place/Transition Petri Nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Encoding Asynchronous Interactions Using Open Petri Nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well-structured transition systems everywhere! / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3601864 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3601861 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability and complexity of Petri nets with unordered data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability Problems in Petri Nets with Names and Replication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparing the Expressive Power of Well-Structured Transition Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5192932 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mobile ambients / rank
 
Normal rank
Property / cites work
 
Property / cites work: When ambients cannot be opened / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiset Rewriting: A Semantic Framework for Concurrency with Name Binding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth Boundedness in Multiset Rewriting Systems with Name Binding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordering by Divisibility in Abstract Algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rewriting logic as a semantic framework for concurrency: a progress report / rank
 
Normal rank
Property / cites work
 
Property / cites work: All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic analysis of programs with well quasi-ordered domains. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forward Analysis of Depth-Bounded Processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5389997 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forward Analysis for WSTS, Part II: Complete WSTS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verification, Model Checking, and Abstract Interpretation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5590814 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Revisiting Ackermann-Hardness for Lossy Counter Machines and Reset Petri Nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4421726 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2734510 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2847412 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The covering and boundedness problems for vector addition systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Programming Languages and Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding reachability problems in Turing-complete fragments of Mobile Ambients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reachability analysis of fragments of mobile ambients in AC term rewriting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding Reachability in Mobile Ambients with Name Restriction / rank
 
Normal rank
Property / cites work
 
Property / cites work: A well-structured framework for analysing Petri net extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Verification of Ad Hoc Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Power of Cliques in the Parameterized Verification of Ad Hoc Networks / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:48, 5 July 2024

scientific article
Language Label Description Also known as
English
Multiset rewriting for the verification of depth-bounded processes with name binding
scientific article

    Statements

    Multiset rewriting for the verification of depth-bounded processes with name binding (English)
    0 references
    11 October 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    multiset rewriting
    0 references
    depth-boundedness
    0 references
    WSTS
    0 references
    verification
    0 references
    decidability
    0 references
    Petri nets
    0 references
    process algebra
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references