Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet 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 (engelsk)Doktoravhandling, monografi (Annet vitenskapelig)
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.
sted, utgiver, år, opplag, sider
Stockholm: KTH Royal Institute of Technology, 2013. , s. viii, 195
Emneord [en]
Combinatorial Slice Theory, Partial Order Theory of Concurrency, Digraph Width Measures, Equational Logic
HSV kategori
Identifikatorer
URN: urn:nbn:se:kth:diva-134211ISBN: 978-91-7501-933-8 (tryckt)OAI: oai:DiVA.org:kth-134211DiVA, id: diva2:665450
Disputas
2013-12-12, F3, Lindtedtsvägen 26, KTH, Stockholm, 10:00 (engelsk)
Opponent
Veileder
Forskningsfinansiär
EU, European Research Council, 269335 MBAT
Merknad

QC 20131120

Tilgjengelig fra: 2013-11-20 Laget: 2013-11-19 Sist oppdatert: 2018-01-11bibliografisk kontrollert

Open Access i DiVA

Combinatorial Slice Theory(2299 kB)1228 nedlastinger
Filinformasjon
Fil FULLTEXT01.pdfFilstørrelse 2299 kBChecksum SHA-512
33a8f6364ee1351805191430e850e87abaa001d2ae3712f0bd2dab25c5c185ff77b88e273f82a75b775f2efb21b21a12b388d84aa744550ca48835c7c66a316d
Type fulltextMimetype application/pdf

Søk i DiVA

Av forfatter/redaktør
de Oliveira Oliveira, Mateus
Av organisasjonen

Søk utenfor DiVA

GoogleGoogle Scholar
Totalt: 1228 nedlastinger
Antall nedlastinger er summen av alle nedlastinger av alle fulltekster. Det kan for eksempel være tidligere versjoner som er ikke lenger tilgjengelige

isbn
urn-nbn

Altmetric

isbn
urn-nbn
Totalt: 1496 treff
RefereraExporteraLink to record
Permanent link

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