2011 - Member of Academia Europaea
Her primary areas of study are Probabilistic logic, Model checking, Theoretical computer science, Algorithm and Markov chain. Her studies in Probabilistic logic integrate themes in fields like Discrete mathematics, Nondeterministic algorithm, Time complexity and Markov decision process. Much of her study explores Theoretical computer science relationship to Programming language.
Within one scientific family, she focuses on topics pertaining to Temporal logic under Algorithm, and may sometimes address concerns connected to Bisimulation. Her Markov chain research is multidisciplinary, incorporating elements of Computation tree logic, Formal verification, Binary decision diagram and System of linear equations. Her Software system study integrates concerns from other disciplines, such as Deadlock, Field, Debugging and Rotation formalisms in three dimensions.
Christel Baier mainly investigates Theoretical computer science, Probabilistic logic, Model checking, Markov chain and Markov decision process. Her studies deal with areas such as Programming language, Computation and Semantics as well as Theoretical computer science. Her Probabilistic logic research includes themes of Time complexity, Algorithm, Decidability and Nondeterministic algorithm.
Christel Baier works mostly in the field of Model checking, limiting it down to topics relating to Temporal logic and, in certain cases, Liveness. Her Markov chain study integrates concerns from other disciplines, such as Discrete mathematics, Bisimulation and Set. Her Markov decision process research focuses on subjects like Reachability, which are linked to Bounded function.
Christel Baier mostly deals with Probabilistic logic, Theoretical computer science, Markov decision process, Markov chain and Reachability. The study incorporates disciplines such as Reactive system and Relevance in addition to Probabilistic logic. Her Theoretical computer science research incorporates themes from Computation and Focus.
Her research on Markov decision process also deals with topics like
Her primary scientific interests are in Markov decision process, Discrete mathematics, Probabilistic logic, Markov chain and Parametric statistics. The various areas that Christel Baier examines in her Markov decision process study include Field, Reduction, Focus and Shortest path problem. Christel Baier has researched Discrete mathematics in several fields, including Polynomial and Reachability.
Her research investigates the connection between Probabilistic logic and topics such as Automaton that intersect with issues in Component, Usability and Nondeterministic algorithm. Her studies deal with areas such as Systems modeling, Set, Fault tolerance, Systems analysis and Redundancy as well as Markov chain. Her Time complexity study incorporates themes from Model checking, Exponential function and True quantified Boolean formula.
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)
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)
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)
Model Checking Continuous-Time Markov Chains by Transient Analysis
Christel Baier;Boudewijn R. Haverkort;Holger Hermanns;Joost-Pieter Katoen.
computer aided verification (2000)
(Impact Factor: 0.871)
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: