- Alternative title
-
Erfüllbarkeitsprüfung für den Koalgebraischen µ-Kalkül
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
Erlangen, Friedrich-Alexander-Universität Erlangen-Nürnberg (FAU), Dissertation, 2018
- Keyword
-
Calculus
Games
Fixpunkt-Logik
Koalgebra
Erfüllbarkeitsproblem
Büchi-Automat
Mathematisches Spiel
- Event
-
Veröffentlichung
- (where)
-
Erlangen
- (who)
-
Friedrich-Alexander-Universität Erlangen-Nürnberg (FAU)
- (when)
-
2018
- Creator
- Contributor
-
Schröder, Lutz
Schröder, Lutz
Kurz, Alexander
- URN
-
urn:nbn:de:bvb:29-opus4-99325
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
25.03.2025, 1:52 PM CET
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Hausmann, Daniel
- Schröder, Lutz
- Kurz, Alexander
- Friedrich-Alexander-Universität Erlangen-Nürnberg (FAU)
Time of origin
- 2018
Other Objects (12)
Logics on data words : Expressivity, satisfiability, model checking
New Perspectives in Symbolic Computation and Satisfiability Checking
Satisfiability and model checking in team based logics
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
From non-disjoint combination to satisfiability and model checking of infinite state systems
Model Checking the Quantitative μ-Calculus on Linear Hybrid Systems
Algorithms for Satisfiability beyond Resolution
Satisfiability problems
The Expressive Power, Satisfiability and Path Checking Problems of MTL and TPTL over Non-Monotonic Data Words
Logics on data words : Expressivity, satisfiability, model checking
New Perspectives in Symbolic Computation and Satisfiability Checking
Satisfiability and model checking in team based logics
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
From non-disjoint combination to satisfiability and model checking of infinite state systems
Model Checking the Quantitative μ-Calculus on Linear Hybrid Systems
Algorithms for Satisfiability beyond Resolution
Satisfiability problems
The Expressive Power, Satisfiability and Path Checking Problems of MTL and TPTL over Non-Monotonic Data Words
Logics on data words : Expressivity, satisfiability, model checking
New Perspectives in Symbolic Computation and Satisfiability Checking
Satisfiability and model checking in team based logics
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
From non-disjoint combination to satisfiability and model checking of infinite state systems
Model Checking the Quantitative μ-Calculus on Linear Hybrid Systems
Algorithms for Satisfiability beyond Resolution
Satisfiability problems