Towards Efficient Verification of Systems with Dynamic Process Creation
From MaRDI portal
Recommendations
- State space reduction for dynamic process creation
- Effective marking equivalence checking in systems with dynamic process creation
- scientific article; zbMATH DE number 2086795
- scientific article; zbMATH DE number 1540512
- A Generic Framework for Reasoning About Dynamic Networks of Infinite-State Processes
Cites work
- A symbolic reachability graph for coloured Petri nets
- Applications and Theory of Petri Nets 2005
- Automatic Symmetry Detection in Well-Formed Nets
- Canonical prefixes of Petri net unfoldings
- Constraint-based automatic verification of abstract models of multithreaded programs
- Decidability of Second-Order Theories and Automata on Infinite Trees
- Formal Modeling and Analysis of Timed Systems
- Formal specification and verification of the C\(\#\) thread model
- scientific article; zbMATH DE number 1670562 (Why is no real title available?)
- scientific article; zbMATH DE number 1701757 (Why is no real title available?)
- scientific article; zbMATH DE number 438994 (Why is no real title available?)
- scientific article; zbMATH DE number 52331 (Why is no real title available?)
- M-nets: An algebra of high-level Petri-nets, with an application to the semantics of concurrent programming languages
- Modular verification of multithreaded programs
- Name Creation vs. Replication in Petri Net Systems
- Towards Efficient Verification of Systems with Dynamic Process Creation
Cited in
(4)
This page was built for publication: Towards Efficient Verification of Systems with Dynamic Process Creation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5505602)