Petri nets with name creation for transient secure association

DOI10.1007/s00236-013-0188-0zbMath1360.68635OpenAlexW2061222159WikidataQ57831204 ScholiaQ57831204MaRDI QIDQ2510386

Fernando Rosa-Velardo

Publication date: 1 August 2014

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-013-0188-0

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Uses Software

• CEGAR

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A classification of the expressive power of well-structured transition systems
• Decidability and complexity of Petri nets with unordered data
• Multiset rewriting for the verification of depth-bounded processes with name binding
• Decidability of a temporal logic problem for Petri nets
• CONCUR '90. Theories of concurrency: unification and extension. Amsterdam, The Netherlands, August 1990. Proceedings
• Recursive Petri nets
• Expand, enlarge and check: new algorithms for the coverability problem of WSTS
• Cost Soundness for Priced Resource-Constrained Workflow Nets
• Decidability Problems in Petri Nets with Names and Replication
• Constrained Monotonic Abstraction: A CEGAR for Parameterized Verification
• Revisiting Ackermann-Hardness for Lossy Counter Machines and Reset Petri Nets
• ω-Petri Nets
• Foundations of Software Science and Computation Structures
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
• Lectures on Concurrency and Petri Nets
• Verification, Model Checking, and Abstract Interpretation