2011 - Member of Academia Europaea
In her research, Nondeterministic algorithm, Bisimulation and Decidability is intimately related to Discrete mathematics, which falls under the overarching field of Equivalence (formal languages). Her research on Decidability often connects related areas such as Discrete mathematics. She performs multidisciplinary study on Theoretical computer science and Nondeterministic algorithm in her works. Christel Baier combines topics linked to Probabilistic automaton with her work on Probabilistic logic. Probabilistic automaton is closely attributed to Automaton in her research. Christel Baier integrates many fields in her works, including Automaton and Artificial intelligence. Her study deals with a combination of Artificial intelligence and Probabilistic logic. Christel Baier integrates many fields in her works, including Programming language and Software engineering. She conducted interdisciplinary study in her works that combined Software engineering and Programming language.
Many of her studies on Theoretical computer science involve topics that are commonly interrelated, such as Automaton. Christel Baier regularly ties together related areas like Theoretical computer science in her Automaton studies. By researching both Probabilistic logic and Artificial intelligence, Christel Baier produces research that crosses academic boundaries. Her work often combines Artificial intelligence and Probabilistic logic studies. She conducts interdisciplinary study in the fields of Programming language and Semantics (computer science) through her works. She merges many fields, such as Semantics (computer science) and Programming language, in her writings. By researching both Algorithm and Model checking, she produces research that crosses academic boundaries. In her work, she performs multidisciplinary research in Model checking and Algorithm. Her study ties her expertise on Equivalence (formal languages) together with the subject of Discrete mathematics.
Her Mathematical analysis research is intertwined with Variable (mathematics) and Bounded function. Christel Baier performs multidisciplinary study in the fields of Variable (mathematics) and Mathematical analysis via her papers. Her work blends Artificial intelligence and Probabilistic logic studies together. Christel Baier conducts interdisciplinary study in the fields of Theoretical computer science and Nondeterministic algorithm through her research. In her papers, Christel Baier integrates diverse fields, such as Nondeterministic algorithm and Theoretical computer science. Christel Baier brings together Programming language and Programming paradigm to produce work in her papers. Her Combinatorics research extends to the thematically linked field of Reachability. Her Combinatorics study frequently draws connections to adjacent fields such as Reachability. In her papers, she integrates diverse fields, such as Statistics and Parametric statistics.
Her Artificial intelligence study has been linked to subjects such as Probabilistic logic and Statistical model. She integrates many fields, such as Probabilistic logic and Artificial intelligence, in her works. She links relevant study fields such as Bounded function and Variable (mathematics) in the subject of Mathematical analysis. Her research on Bounded function often connects related topics like Mathematical analysis. Her study in Reachability extends to Theoretical computer science with its themes. Her research combines Theoretical computer science and Reachability. Christel Baier performs multidisciplinary study on Statistics and Parametric statistics in her works. Christel Baier performs multidisciplinary study in Parametric statistics and Statistics in her work. Christel Baier performs multidisciplinary study on Theory of computation and Computation in her works.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Principles of Model Checking
Christel Baier;Joost-Pieter Katoen.
Principles of Model Checking (Representation and Mind Series)
Christel Baier;Joost-Pieter Katoen.
Model-checking algorithms for continuous-time Markov chains
C. Baier;B. Haverkort;H. Hermanns;J.-P. Katoen.
IEEE Transactions on Software Engineering (2003)
Validation of Stochastic Systems : A Guide to Current Research
Christel Baier;Boudewijn R. Haverkort;Joost-Pieter Katoen;Holger Hermanns.
Modeling component connectors in Reo by constraint automata
Christel Baier;Marjan Sirjani;Farhad Arbab;Jan Rutten.
Science of Computer Programming (2006)
Approximative Symbolic Model Checking of Continuous-Time Markov Chains
Christel Baier;Joost-Pieter Katoen;Joost-Pieter Katoen;Holger Hermanns.
international conference on concurrency theory (1999)
Approximate symbolic model checking of continuous-time Markov chains
C. Baier;J.-P. Katoen;H. Hermanns.
Lecture Notes in Computer Science (1999)
Model checking for a probabilistic branching time logic with fairness
Christel Baier;Marta Kwiatkowska.
Distributed Computing (1998)
PROBMELA: a modeling language for communicating probabilistic processes
C. Baier;F. Ciesinski;M. Grosser.
international conference on formal methods and models for co design (2004)
Model Checking Continuous-Time Markov Chains by Transient Analysis
Christel Baier;Boudewijn R. Haverkort;Holger Hermanns;Joost-Pieter Katoen.
computer aided verification (2000)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: