Parameterized Complexity of some Problems in Concurrency and Verification

This talk will be about applying graph theoretic parameterized complexity notions to some logical decision problems that arise in concurrency and verification. First, we associate a graph with modal logic formulas in Conjunctive Normal Form and give parameterized complexity results for the satisfiability problem with treewidth as parameter. Second, we associate a graph with Petri nets, which are popularly used to model concurrent systems. Again, we give parameterized complexity results for model checking Petri nets, using treewidth and other stronger parameters of the associated graph.