| Sesqui-pushout rewriting A Corradini, T Heindel, F Hermann, B König International Conference on Graph Transformation, 30-45, 2006 | 162 | 2006 |
| A static analysis technique for graph transformation systems P Baldan, A Corradini, B König International Conference on Concurrency Theory, 381-395, 2001 | 123 | 2001 |
| Deriving bisimulation congruences in the DPO approach to graph rewriting H Ehrig, B König International Conference on Foundations of Software Science and Computation …, 2004 | 102 | 2004 |
| Counterexample-guided abstraction refinement for the analysis of graph transformation systems B König, V Kozioura Tools and Algorithms for the Construction and Analysis of Systems: 12th …, 2006 | 93 | 2006 |
| Deriving bisimulation congruences in the DPO approach to graph rewriting with borrowed contexts H Ehrig, B König Mathematical Structures in Computer Science 16 (6), 1133-1163, 2006 | 88 | 2006 |
| Approximating the behaviour of graph transformation systems P Baldan, B König International Conference on Graph Transformation, 14-29, 2002 | 88 | 2002 |
| Verifying finite-state graph grammars: an unfolding-based approach P Baldan, A Corradini, B König International Conference on Concurrency Theory, 83-98, 2004 | 85 | 2004 |
| Augur 2—a new version of a tool for the analysis of graph transformation systems B König, V Kozioura Electronic Notes in Theoretical Computer Science 211, 201-210, 2008 | 79 | 2008 |
| Saturated semantics for reactive systems F Bonchi, B Konig, U Montanari 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06), 69-80, 2006 | 78 | 2006 |
| A framework for the verification of infinite-state graph transformation systems P Baldan, A Corradini, B König Information and Computation 206 (7), 869-907, 2008 | 73 | 2008 |
| On deterministic finite automata and syntactic monoid size M Holzer, B König Theoretical Computer Science 327 (3), 319-347, 2004 | 68 | 2004 |
| A coalgebraic perspective on minimization and determinization J Adámek, F Bonchi, M Hülsbusch, B König, S Milius, A Silva Foundations of Software Science and Computational Structures: 15th …, 2012 | 63 | 2012 |
| Efficient unfolding of contextual Petri nets P Baldan, A Bruni, A Corradini, B König, C Rodríguez, S Schwoon Theoretical Computer Science 449, 2-22, 2012 | 56 | 2012 |
| On the decidability status of reachability and coverability in graph transformation systems N Bertrand, G Delzanno, B König, A Sangnier, J Stückrath 23rd International Conference on Rewriting Techniques and Applications (RTA'12), 2012 | 51 | 2012 |
| Behavior preservation in model refactoring using DPO transformations with borrowed contexts G Rangel, L Lambers, B König, H Ehrig, P Baldan International Conference on Graph Transformation, 242-256, 2008 | 51 | 2008 |
| A logic for analyzing abstractions of graph transformation systems P Baldan, B König, B König International Static Analysis Symposium, 255-272, 2003 | 49 | 2003 |
| Applying the graph minor theorem to the verification of graph transformation systems S Joshi, B König Computer Aided Verification: 20th International Conference, CAV 2008 …, 2008 | 46 | 2008 |
| A tutorial on graph transformation B König, D Nolte, J Padberg, A Rensink Graph Transformation, Specifications, and Nets: In Memory of Hartmut Ehrig …, 2018 | 44 | 2018 |
| Showing full semantics preservation in model transformation-a comparison of techniques M Hülsbusch, B König, A Rensink, M Semenyak, C Soltenborn, ... Integrated Formal Methods: 8th International Conference, IFM 2010, Nancy …, 2010 | 43 | 2010 |
| McMillan’s complete prefix for contextual nets P Baldan, A Corradini, B König, S Schwoon Transactions on Petri Nets and Other Models of Concurrency I, 199-220, 2008 | 43 | 2008 |
Paolo BaldanProfessor of Computer Science, University of PadovaVerified email at math.unipd.it
