Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Combinatorial Slice Theory
KTH, Skolan för datavetenskap och kommunikation (CSC), Teoretisk datalogi, TCS.
2013 (Engelska)Doktorsavhandling, monografi (Övrigt vetenskapligt)
Abstract [en]

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:

  • Concurrency Theory:
  1. 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.
  2. 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.
  • Combinatorics:
  1. 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.
  • Logic:
  1. 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.
Ort, förlag, år, upplaga, sidor
Stockholm: KTH Royal Institute of Technology, 2013. , s. viii, 195
Nyckelord [en]
Combinatorial Slice Theory, Partial Order Theory of Concurrency, Digraph Width Measures, Equational Logic
Nationell ämneskategori
Datavetenskap (datalogi)
Identifikatorer
URN: urn:nbn:se:kth:diva-134211ISBN: 978-91-7501-933-8 (tryckt)OAI: oai:DiVA.org:kth-134211DiVA, id: diva2:665450
Disputation
2013-12-12, F3, Lindtedtsvägen 26, KTH, Stockholm, 10:00 (Engelska)
Opponent
Handledare
Forskningsfinansiär
EU, Europeiska forskningsrådet, 269335 MBAT
Anmärkning

QC 20131120

Tillgänglig från: 2013-11-20 Skapad: 2013-11-19 Senast uppdaterad: 2018-01-11Bibliografiskt granskad

Open Access i DiVA

Combinatorial Slice Theory(2299 kB)1226 nedladdningar
Filinformation
Filnamn FULLTEXT01.pdfFilstorlek 2299 kBChecksumma SHA-512
33a8f6364ee1351805191430e850e87abaa001d2ae3712f0bd2dab25c5c185ff77b88e273f82a75b775f2efb21b21a12b388d84aa744550ca48835c7c66a316d
Typ fulltextMimetyp application/pdf

Sök vidare i DiVA

Av författaren/redaktören
de Oliveira Oliveira, Mateus
Av organisationen
Teoretisk datalogi, TCS
Datavetenskap (datalogi)

Sök vidare utanför DiVA

GoogleGoogle Scholar
Totalt: 1226 nedladdningar
Antalet nedladdningar är summan av nedladdningar för alla fulltexter. Det kan inkludera t.ex tidigare versioner som nu inte längre är tillgängliga.

isbn
urn-nbn

Altmetricpoäng

isbn
urn-nbn
Totalt: 1496 träffar
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf