- Weitere Titel
-
Erfüllbarkeitsprüfung für den Koalgebraischen µ-Kalkül
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
Erlangen, Friedrich-Alexander-Universität Erlangen-Nürnberg (FAU), Dissertation, 2018
- Schlagwort
-
Calculus
Games
Fixpunkt-Logik
Koalgebra
Erfüllbarkeitsproblem
Büchi-Automat
Mathematisches Spiel
- Ereignis
-
Veröffentlichung
- (wo)
-
Erlangen
- (wer)
-
Friedrich-Alexander-Universität Erlangen-Nürnberg (FAU)
- (wann)
-
2018
- Urheber
- Beteiligte Personen und Organisationen
-
Schröder, Lutz
Schröder, Lutz
Kurz, Alexander
- URN
-
urn:nbn:de:bvb:29-opus4-99325
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
25.03.2025, 13:52 MEZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Hausmann, Daniel
- Schröder, Lutz
- Kurz, Alexander
- Friedrich-Alexander-Universität Erlangen-Nürnberg (FAU)
Entstanden
- 2018
Ähnliche Objekte (12)
Satisfiability and model checking in team based logics
New Perspectives in Symbolic Computation and Satisfiability Checking
Logics on data words : Expressivity, satisfiability, model checking
Symbolic Computation and Satisfiability Checking : Report of Dagstuhl Seminar 15471
Model checking of duration calculus specifications
Parameterised complexity of model checking and satisfiability in propositional dependence logic
Algorithms for the satisfiability problem
Model Checking the Quantitative μ-Calculus on Linear Hybrid Systems
From non-disjoint combination to satisfiability and model checking of infinite state systems
Satisfiability problems
Algorithms for Satisfiability beyond Resolution
The expressive power, satisfiability and path checking problems of MTL and TPTL over non-monotonic data words
Satisfiability and model checking in team based logics
New Perspectives in Symbolic Computation and Satisfiability Checking
Logics on data words : Expressivity, satisfiability, model checking
Symbolic Computation and Satisfiability Checking : Report of Dagstuhl Seminar 15471
Model checking of duration calculus specifications
Parameterised complexity of model checking and satisfiability in propositional dependence logic
Algorithms for the satisfiability problem
Model Checking the Quantitative μ-Calculus on Linear Hybrid Systems
From non-disjoint combination to satisfiability and model checking of infinite state systems
Satisfiability problems
Algorithms for Satisfiability beyond Resolution
The expressive power, satisfiability and path checking problems of MTL and TPTL over non-monotonic data words
Satisfiability and model checking in team based logics
New Perspectives in Symbolic Computation and Satisfiability Checking
Logics on data words : Expressivity, satisfiability, model checking
Symbolic Computation and Satisfiability Checking : Report of Dagstuhl Seminar 15471
Model checking of duration calculus specifications
Parameterised complexity of model checking and satisfiability in propositional dependence logic
Algorithms for the satisfiability problem
Model Checking the Quantitative μ-Calculus on Linear Hybrid Systems
From non-disjoint combination to satisfiability and model checking of infinite state systems
Satisfiability problems
Algorithms for Satisfiability beyond Resolution