Petri nets with name creation for transient secure association (Q2510386): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q57831204, #quickstatements; #temporary_batch_1706974288397
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: CEGAR / 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.1007/s00236-013-0188-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2061222159 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constrained Monotonic Abstraction: A CEGAR for Parameterized Verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: A classification of the expressive power of well-structured transition systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2766553 / rank
 
Normal rank
Property / cites work
 
Property / cites work: FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5227061 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4247286 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4219024 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4289279 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verification, Model Checking, and Abstract Interpretation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expand, enlarge and check: new algorithms for the coverability problem of WSTS / rank
 
Normal rank
Property / cites work
 
Property / cites work: ω-Petri Nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: CONCUR '90. Theories of concurrency: unification and extension. Amsterdam, The Netherlands, August 1990. Proceedings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive Petri nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability of a temporal logic problem for Petri nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2775865 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cost Soundness for Priced Resource-Constrained Workflow Nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of Software Science and Computation Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5590814 / 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: Decidability and complexity of Petri nets with unordered data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiset rewriting for the verification of depth-bounded processes with name binding / 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: Lectures on Concurrency and Petri Nets / rank
 
Normal rank

Latest revision as of 20:32, 8 July 2024

scientific article
Language Label Description Also known as
English
Petri nets with name creation for transient secure association
scientific article

    Statements

    Petri nets with name creation for transient secure association (English)
    0 references
    1 August 2014
    0 references

    Identifiers