scientific article

zbMath1270.68214MaRDI QIDQ2842877

No author found.

Publication date: 16 August 2013

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S1571066104805358

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Data structures (68P05)

Related Items

Reduction rules for reset/inhibitor nets, When to Move to Transfer Nets, Minimal Coverability Set for Petri Nets: Karp and Miller Algorithm with Pruning, On-line monitoring of large Petri net models under partial observation, Soundness-preserving reduction rules for reset workflow nets, Expand, enlarge and check: new algorithms for the coverability problem of WSTS

Cites Work

• Reduction and covering of infinite reachability trees
• The covering and boundedness problems for vector addition systems
• Verifying lossy channel systems has nonprimitive recursive complexity.
• Parallel program schemata
• Reasoning about systems with many processes
• A distributed algorithm for GSPN reachability graph generation
• Well-structured transition systems everywhere!
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item