Algorithmic analysis of programs with well quasi-ordered domains
Information and Computation - Special issue: LICS 1996—Part 1
Well-structured transition systems everywhere!
Theoretical Computer Science
Parametric shape analysis via 3-valued logic
ACM Transactions on Programming Languages and Systems (TOPLAS)
Incremental construction of coverability graphs
Information Processing Letters
A compositional Petri net translation of general π-calculus terms
Formal Aspects of Computing
Applying the Graph Minor Theorem to the Verification of Graph Transformation Systems
CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
Monotonic Abstraction for Programs with Dynamic Memory Heaps
CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
A theory of structural stationarity in the π-Calculus
Acta Informatica
On the Relationship between η-Calculus and Finite Place/Transition Petri Nets
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
A Practical Approach to Verification of Mobile Systems Using Net Unfoldings
Fundamenta Informaticae - Petri Nets 2008
Checking pi-Calculus Structural Congruence is Graph Isomorphism Complete
ACSD '09 Proceedings of the 2009 Ninth International Conference on Application of Concurrency to System Design
Graph grammar modeling and verification of ad hoc routing protocols
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Graph grammar modeling and verification of ad hoc routing protocols
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Forward analysis of depth-bounded processes
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
Counterexample-Guided abstraction refinement for the analysis of graph transformation systems
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
SLMC: a tool for model checking concurrent systems against dynamical spatial logic specifications
TACAS'12 Proceedings of the 18th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Efficient coverability analysis by proof minimization
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
| Hi-index | 0.00 |
We introduce Petruchio, a tool for computing Petri net translations of dynamic networks To cater for unbounded architectures beyond the capabilities of existing implementations, the principle fixed-point engine runs interleaved with coverability queries We discuss algorithmic enhancements and provide experimental evidence that Petruchio copes with models of reasonable size.