Combinatorial Slice Theory
2013 (English)Doctoral thesis, monograph (Other academic)
Slices are digraphs that can be composed together to form larger digraphs.In this thesis we introduce the foundations of a theory whose aim is to provide ways of defining and manipulating infinite families of combinatorial objects such as graphs, partial orders, logical equations etc. We give special attentionto objects that can be represented as sequences of slices. We have successfully applied our theory to obtain novel results in three fields: concurrency theory,combinatorics and logic. Some notable results are:
- We prove that inclusion and emptiness of intersection of the causalbehavior of bounded Petri nets are decidable. These problems had been open for almost two decades.
- We introduce an algorithm to transitively reduce infinite familiesof DAGs. This algorithm allows us to operate with partial order languages defined via distinct formalisms, such as, Mazurkiewicztrace languages and message sequence chart languages.
- For each constant z ∈ N, we define the notion of z-topological or-der for digraphs, and use it as a point of connection between the monadic second order logic of graphs and directed width measures, such as directed path-width and cycle-rank. Through this connection we establish the polynomial time solvability of a large numberof natural counting problems on digraphs admitting z-topological orderings.
- We introduce an ordered version of equational logic. We show thatthe validity problem for this logic is fixed parameter tractable withrespect to the depth of the proof DAG, and solvable in polynomial time with respect to several notions of width of the equations being proved. In this way we establish the polynomial time provability of equations that can be out of reach of techniques based on completion and heuristic search.
Place, publisher, year, edition, pages
Stockholm: KTH Royal Institute of Technology, 2013. , viii, 195 p.
Combinatorial Slice Theory, Partial Order Theory of Concurrency, Digraph Width Measures, Equational Logic
IdentifiersURN: urn:nbn:se:kth:diva-134211ISBN: 978-91-7501-933-8OAI: oai:DiVA.org:kth-134211DiVA: diva2:665450
2013-12-12, F3, Lindtedtsvägen 26, KTH, Stockholm, 10:00 (English)
König, Barbara, Professor
Meinke, Karl, ProfessorArnborg, Stefan, Professor
FunderEU, European Research Council, 269335 MBAT
QC 201311202013-11-202013-11-192013-11-20Bibliographically approved