Abstract | ||
---|---|---|
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. |
Year | DOI | Venue |
---|---|---|
2010 | 10.1007/978-3-642-14295-6_19 | CAV |
Keywords | Field | DocType |
petruchio cope,dynamic network,algorithmic enhancement,experimental evidence,unbounded architecture,principle fixed-point engine,reasonable size,fixed point,petri net | Petri net,Computer science,Algorithm,Theoretical computer science,Implementation,Distributed computing | Conference |
Volume | ISSN | ISBN |
6174 | 0302-9743 | 3-642-14294-X |
Citations | PageRank | References |
7 | 0.55 | 17 |
Authors | ||
2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Roland Meyer | 1 | 203 | 15.99 |
Tim Strazny | 2 | 8 | 0.90 |