|
Search the dblp DataBase
Christel Baier:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Christel Baier, Mila E. Majster-Cederbaum
A Categorical Characterization of Consistency Results. [Citation Graph (0, 0)][DBLP] AMAST, 1996, pp:473-486 [Conf]
- Christel Baier, Bettina Engelen
Establishing Qualitative Properties for Probabilistic Lossy Channel Systems: An Algorithmic Approach. [Citation Graph (0, 0)][DBLP] ARTS, 1999, pp:34-52 [Conf]
- Christel Baier, Holger Hermanns
Weak Bisimulation for Fully Probabilistic Processes. [Citation Graph (0, 0)][DBLP] CAV, 1997, pp:119-130 [Conf]
- Christel Baier, Boudewijn R. Haverkort, Holger Hermanns, Joost-Pieter Katoen
Model Checking Continuous-Time Markov Chains by Transient Analysis. [Citation Graph (0, 0)][DBLP] CAV, 2000, pp:358-372 [Conf]
- Alexander Asteroth, Christel Baier, Ulrich Aßmann
Model Checking with Formula-Dependent Abstract Models. [Citation Graph (0, 0)][DBLP] CAV, 2001, pp:155-168 [Conf]
- Christel Baier
Polynomial Time Algorithms for Testing Probabilistic Bisimulation and Simulation. [Citation Graph (0, 0)][DBLP] CAV, 1996, pp:50-61 [Conf]
- Parosh Aziz Abdulla, Christel Baier, S. Purushothaman Iyer, Bengt Jonsson
Reasoning about Probabilistic Lossy Channel Systems. [Citation Graph (0, 0)][DBLP] CONCUR, 2000, pp:320-333 [Conf]
- Christel Baier, Holger Hermanns, Joost-Pieter Katoen, Verena Wolf
Comparative Branching-Time Semantics. [Citation Graph (0, 0)][DBLP] CONCUR, 2003, pp:482-497 [Conf]
- Christel Baier, Joost-Pieter Katoen, Holger Hermanns
Approximate Symbolic Model Checking of Continuous-Time Markov Chains. [Citation Graph (0, 0)][DBLP] CONCUR, 1999, pp:146-161 [Conf]
- Christel Baier, Joost-Pieter Katoen, Holger Hermanns, Boudewijn R. Haverkort
Simulation for Continuous-Time Markov Chains. [Citation Graph (0, 0)][DBLP] CONCUR, 2002, pp:338-354 [Conf]
- Farhad Arbab, Christel Baier, Frank S. de Boer, Jan J. M. M. Rutten, Marjan Sirjani
Synthesis of Reo Circuits for Implementation of Component-Connector Automata Specifications. [Citation Graph (0, 0)][DBLP] COORDINATION, 2005, pp:236-251 [Conf]
- Christel Baier, Verena Wolf
Stochastic Reasoning About Channel-Based Component Connectors. [Citation Graph (0, 0)][DBLP] COORDINATION, 2006, pp:1-15 [Conf]
- Marjan Sirjani, Mohammad Mahdi Jaghoori, Christel Baier, Farhad Arbab
Compositional Semantics of an Actor-Based Language Using Constraint Automata. [Citation Graph (0, 0)][DBLP] COORDINATION, 2006, pp:281-297 [Conf]
- Christel Baier, Lucia Cloth, Boudewijn R. Haverkort, Matthias Kuntz, Markus Siegle
Model Checking Action- and State-Labelled Markov Chains. [Citation Graph (0, 0)][DBLP] DSN, 2004, pp:701-710 [Conf]
- Boudewijn R. Haverkort, Lucia Cloth, Holger Hermanns, Joost-Pieter Katoen, Christel Baier
Model Checking Performability Properties. [Citation Graph (0, 0)][DBLP] DSN, 2002, pp:103-112 [Conf]
- Christel Baier, Holger Hermanns
Weak Bisimulation for Fully Probabilistic Processes. [Citation Graph (0, 0)][DBLP] FBT, 1997, pp:59-68 [Conf]
- Christel Baier, Mila E. Majster-Cederbaum
The Consistency of a Noninterleaving and an Interleaving Model for Full TCSP. [Citation Graph (0, 0)][DBLP] FCT, 1991, pp:105-120 [Conf]
- Marcus Größer, Christel Baier
Partial Order Reduction for Markov Decision Processes: A Survey. [Citation Graph (0, 0)][DBLP] FMCO, 2005, pp:408-427 [Conf]
- Wolfgang Lenders, Christel Baier
Genetic Algorithms for the Variable Ordering Problem of Binary Decision Diagrams. [Citation Graph (0, 0)][DBLP] FOGA, 2005, pp:1-20 [Conf]
- Christel Baier, Nathalie Bertrand, Ph. Schnoebelen
Symbolic Verification of Communicating Systems with Probabilistic Message Losses: Liveness and Fairness. [Citation Graph (0, 0)][DBLP] FORTE, 2006, pp:212-227 [Conf]
- Christel Baier, Mariëlle Stoelinga
Norm Functions for Probabilistic Bisimulations with Delays. [Citation Graph (0, 0)][DBLP] FoSSaCS, 2000, pp:1-16 [Conf]
- Marcus Größer, Gethin Norman, Christel Baier, Frank Ciesinski, Marta Z. Kwiatkowska, David Parker
On Reduction Criteria for Probabilistic Reward Models. [Citation Graph (0, 0)][DBLP] FSTTCS, 2006, pp:309-320 [Conf]
- Christel Baier, Edmund M. Clarke, Vassili Hartonas-Garmhausen, Marta Z. Kwiatkowska, Mark Ryan
Symbolic Model Checking for Probabilistic Processes. [Citation Graph (0, 0)][DBLP] ICALP, 1997, pp:430-440 [Conf]
- Christel Baier, Boudewijn R. Haverkort, Holger Hermanns, Joost-Pieter Katoen
On the Logical Characterisation of Performability Properties. [Citation Graph (0, 0)][DBLP] ICALP, 2000, pp:780-792 [Conf]
- Christel Baier, Joost-Pieter Katoen, Diego Latella
Metric Semantics for True Concurrent Real Time. [Citation Graph (0, 0)][DBLP] ICALP, 1998, pp:568-579 [Conf]
- Christel Baier, Marcus Größer, Martin Leucker, Benedikt Bollig, Frank Ciesinski
Controller Synthesis for Probabilistic Systems. [Citation Graph (0, 0)][DBLP] IFIP TCS, 2004, pp:493-506 [Conf]
- Christel Baier, Marcus Größer
Recognizing omega-regular Languages with Probabilistic Automata. [Citation Graph (0, 0)][DBLP] LICS, 2005, pp:137-146 [Conf]
- Christel Baier, Nathalie Bertrand, Ph. Schnoebelen
On Computing Fixpoints in Well-Structured Regular Model Checking, with Applications to Lossy Channel Systems. [Citation Graph (0, 0)][DBLP] LPAR, 2006, pp:347-361 [Conf]
- Christel Baier, Frank Ciesinski, Marcus Größer
PROBMELA: a modeling language for communicating probabilistic processes. [Citation Graph (0, 0)][DBLP] MEMOCODE, 2004, pp:57-66 [Conf]
- Christel Baier, Boudewijn R. Haverkort, Holger Hermanns, Joost-Pieter Katoen
Automated Performance and Dependability Evaluation Using Model Checking. [Citation Graph (0, 0)][DBLP] Performance, 2002, pp:261-289 [Conf]
- Christel Baier, Marta Z. Kwiatkowska
Automatic Verification of Liveness Properties of Randomized Systems. [Citation Graph (0, 0)][DBLP] PODC, 1997, pp:295- [Conf]
- Christel Baier, Marcus Größer, Frank Ciesinski
Partial Order Reduction for Probabilistic Systems. [Citation Graph (0, 0)][DBLP] QEST, 2004, pp:230-239 [Conf]
- Frank Ciesinski, Christel Baier
LiQuor: A tool for Qualitative and Quantitative Linear Time analysis of Reactive Systems. [Citation Graph (0, 0)][DBLP] QEST, 2006, pp:131-132 [Conf]
- Farhad Arbab, Christel Baier, Frank S. de Boer, Jan J. M. M. Rutten
Models and Temporal Logics for Timed Component Connectors. [Citation Graph (0, 0)][DBLP] SEFM, 2004, pp:198-207 [Conf]
- Christel Baier, Boudewijn R. Haverkort, Holger Hermanns, Joost-Pieter Katoen
Efficient Computation of Time-Bounded Reachability Probabilities in Uniform Continuous-Time Markov Decision Processes. [Citation Graph (0, 0)][DBLP] TACAS, 2004, pp:61-76 [Conf]
- Joachim Klein, Christel Baier
Experiments with Deterministic omega-Automata for Formulas of Linear Temporal Logic. [Citation Graph (0, 0)][DBLP] CIAA, 2005, pp:199-212 [Conf]
- Christel Baier, Mila E. Majster-Cederbaum
The Connection between an Event Structure Semantics and an Operational Semantics for TCSP. [Citation Graph (0, 0)][DBLP] Acta Inf., 1994, v:31, n:1, pp:81-104 [Journal]
- Christel Baier, Mila E. Majster-Cederbaum
Metric Semantics from Partial Order Semantics. [Citation Graph (0, 0)][DBLP] Acta Inf., 1997, v:34, n:9, pp:701-735 [Journal]
- Christel Baier, Marta Z. Kwiatkowska
Model Checking for a Probabilistic Branching Time Logic with Fairness. [Citation Graph (0, 0)][DBLP] Distributed Computing, 1998, v:11, n:3, pp:125-155 [Journal]
- Farhad Arbab, Christel Baier, Jan J. M. M. Rutten, Marjan Sirjani
Modeling Component Connectors in Reo by Constraint Automata: (Extended Abstract). [Citation Graph (0, 0)][DBLP] Electr. Notes Theor. Comput. Sci., 2004, v:97, n:, pp:25-46 [Journal]
- Christel Baier, Edmund M. Clarke, Vasilili Hartonas-Garmhausen
On the Semantic Foundations of Probabilistic Synchronous Reactive Programs. [Citation Graph (0, 0)][DBLP] Electr. Notes Theor. Comput. Sci., 1999, v:22, n:, pp:- [Journal]
- Christel Baier, Pedro R. D'Argenio, Marcus Größer
Partial Order Reduction for Probabilistic Branching Time. [Citation Graph (0, 0)][DBLP] Electr. Notes Theor. Comput. Sci., 2006, v:153, n:2, pp:97-116 [Journal]
- Christel Baier, Michael Huth, Marta Z. Kwiatkowska, Mark Ryan
Preface. [Citation Graph (0, 0)][DBLP] Electr. Notes Theor. Comput. Sci., 1999, v:22, n:, pp:- [Journal]
- Christel Baier, Marta Z. Kwiatkowska
Domain equations for probabilistic processes. [Citation Graph (0, 0)][DBLP] Electr. Notes Theor. Comput. Sci., 1997, v:7, n:, pp:- [Journal]
- Christel Baier, Marta Z. Kwiatkowska, Gethin Norman
Computing Probability Bounds for Linear Time Formulas over Concurrent Probabilistic Systems. [Citation Graph (0, 0)][DBLP] Electr. Notes Theor. Comput. Sci., 1999, v:22, n:, pp:- [Journal]
- Jörn Ossowski, Christel Baier
Symbolic Reasoning with Weighted and Normalized Decision Diagrams. [Citation Graph (0, 0)][DBLP] Electr. Notes Theor. Comput. Sci., 2006, v:151, n:1, pp:39-56 [Journal]
- Verena Wolf, Christel Baier, Mila E. Majster-Cederbaum
Trace Machines for Observing Continuous-Time Markov Chains. [Citation Graph (0, 0)][DBLP] Electr. Notes Theor. Comput. Sci., 2006, v:153, n:2, pp:259-277 [Journal]
- Christel Baier, Holger Hermanns, Joost-Pieter Katoen, Verena Wolf
Bisimulation and Simulation Relations for Markov Chains. [Citation Graph (0, 0)][DBLP] Electr. Notes Theor. Comput. Sci., 2006, v:162, n:, pp:73-78 [Journal]
- Verena Wolf, Christel Baier, Mila E. Majster-Cederbaum
Trace Semantics for Stochastic Systems with Nondeterminism. [Citation Graph (0, 0)][DBLP] Electr. Notes Theor. Comput. Sci., 2006, v:164, n:3, pp:187-204 [Journal]
- Christel Baier, Mila E. Majster-Cederbaum
The Connection Between Initial and Unique Solutions of Domain Equations in the Partial Order and Metric Approach. [Citation Graph (0, 0)][DBLP] Formal Asp. Comput., 1997, v:9, n:4, pp:425-445 [Journal]
- Christel Baier, Marta Z. Kwiatkowska
On Topological Hierarchies of Temporal Properties. [Citation Graph (0, 0)][DBLP] Fundam. Inform., 2000, v:41, n:3, pp:259-294 [Journal]
- Christel Baier, Mila E. Majster-Cederbaum
How to Interpret and Establish Consistency Results for Semantics of Concurrent Programming Languages. [Citation Graph (0, 0)][DBLP] Fundam. Inform., 1997, v:29, n:3, pp:225-256 [Journal]
- Parosh Aziz Abdulla, Christel Baier, S. Purushothaman Iyer, Bengt Jonsson
Simulating perfect channels with probabilistic lossy channels. [Citation Graph (0, 0)][DBLP] Inf. Comput., 2005, v:197, n:1-2, pp:22-40 [Journal]
- Christel Baier, Joost-Pieter Katoen, Holger Hermanns, Verena Wolf
Comparative branching-time semantics for Markov chains. [Citation Graph (0, 0)][DBLP] Inf. Comput., 2005, v:200, n:2, pp:149-214 [Journal]
- Christel Baier, Nathalie Bertrand, Ph. Schnoebelen
A note on the attractor-property of infinite-state Markov chains. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2006, v:97, n:2, pp:58-63 [Journal]
- Christel Baier, Holger Hermanns, Joost-Pieter Katoen
Probabilistic weak simulation is decidable in polynomial time. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2004, v:89, n:3, pp:123-130 [Journal]
- Christel Baier, Marta Z. Kwiatkowska
On the Verification of Qualitative Properties of Probabilistic Processes under Fairness Constraints. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1998, v:66, n:2, pp:71-79 [Journal]
- Christel Baier, Mila E. Majster-Cederbaum
Denotational Linear Time Semantics and Sequential Composition. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1996, v:59, n:3, pp:135-143 [Journal]
- Christel Baier, Bettina Engelen, Mila E. Majster-Cederbaum
Deciding Bisimilarity and Similarity for Probabilistic Processes. [Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2000, v:60, n:1, pp:187-231 [Journal]
- Christel Baier
Probabilistic Models for Reo Connector Circuits. [Citation Graph (0, 0)][DBLP] J. UCS, 2005, v:11, n:10, pp:1718-1748 [Journal]
- Christel Baier, Marta Z. Kwiatkowska
Domain equations for probabilistic processes. [Citation Graph (0, 0)][DBLP] Mathematical Structures in Computer Science, 2000, v:10, n:6, pp:665-717 [Journal]
- Christel Baier, Marjan Sirjani, Farhad Arbab, Jan J. M. M. Rutten
Modeling component connectors in Reo by constraint automata. [Citation Graph (0, 0)][DBLP] Sci. Comput. Program., 2006, v:61, n:2, pp:75-113 [Journal]
- Christel Baier, Frank Ciesinski, Marcus Größer
ProbMela and verification of Markov decision processes. [Citation Graph (0, 0)][DBLP] SIGMETRICS Performance Evaluation Review, 2005, v:32, n:4, pp:22-27 [Journal]
- Christel Baier, Boudewijn R. Haverkort, Holger Hermanns, Joost-Pieter Katoen
Model checking meets performance evaluation. [Citation Graph (0, 0)][DBLP] SIGMETRICS Performance Evaluation Review, 2005, v:32, n:4, pp:10-15 [Journal]
- Christel Baier
Trees and Semantics. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1997, v:179, n:1-2, pp:217-250 [Journal]
- Christel Baier, Holger Hermanns, Joost-Pieter Katoen, Boudewijn R. Haverkort
Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2005, v:345, n:1, pp:2-26 [Journal]
- Christel Baier, Mila E. Majster-Cederbaum
Denotational Semantics in the CPO and Metric Approach. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1994, v:135, n:2, pp:171-220 [Journal]
- Joost-Pieter Katoen, Christel Baier, Diego Latella
Metric semantics for true concurrent real time. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2001, v:254, n:1-2, pp:501-542 [Journal]
- Joachim Klein, Christel Baier
Experiments with deterministic omega-automata for formulas of linear temporal logic. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2006, v:363, n:2, pp:182-195 [Journal]
- Mila E. Majster-Cederbaum, Christel Baier
Metric Completion versus Ideal Completion. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1996, v:170, n:1-2, pp:145-171 [Journal]
- Christel Baier, Boudewijn R. Haverkort, Holger Hermanns, Joost-Pieter Katoen
Model-Checking Algorithms for Continuous-Time Markov Chains. [Citation Graph (0, 0)][DBLP] IEEE Trans. Software Eng., 2003, v:29, n:6, pp:524-541 [Journal]
- Christel Baier, Lucia Cloth, Boudewijn R. Haverkort, Matthias Kuntz, Markus Siegle
Model Checking Markov Chains with Actions and State Labels. [Citation Graph (0, 0)][DBLP] IEEE Trans. Software Eng., 2007, v:33, n:4, pp:209-224 [Journal]
- Farhad Arbab, Christel Baier
Syanco 2007: international workshop on synthesis and analysis of component connectors. [Citation Graph (0, 0)][DBLP] ESEC/SIGSOFT FSE, 2007, pp:607-608 [Conf]
- Joachim Klein, Christel Baier
On-the-Fly Stuttering in the Construction of Deterministic omega -Automata. [Citation Graph (0, 0)][DBLP] CIAA, 2007, pp:51-61 [Conf]
- Christel Baier, Nathalie Bertrand, Ph. Schnoebelen
On computing fixpoints in well-structured regular model checking, with applications to lossy channel systems [Citation Graph (0, 0)][DBLP] CoRR, 2006, v:0, n:, pp:- [Journal]
- Sascha Klüppelholz, Christel Baier
Symbolic Model Checking for Channel-based Component Connectors. [Citation Graph (0, 0)][DBLP] Electr. Notes Theor. Comput. Sci., 2007, v:175, n:2, pp:19-37 [Journal]
Quantitative Analysis under Fairness Constraints. [Citation Graph (, )][DBLP]
The Effect of Tossing Coins in Omega-Automata. [Citation Graph (, )][DBLP]
Alternating-Time Stream Logic for Multi-agent Systems. [Citation Graph (, )][DBLP]
A Uniform Framework for Modeling and Verifying Components and Connectors. [Citation Graph (, )][DBLP]
Formal Verification for Components and Connectors. [Citation Graph (, )][DBLP]
On Decision Problems for Probabilistic Büchi Automata. [Citation Graph (, )][DBLP]
Recurrence and Transience for Probabilistic Automata. [Citation Graph (, )][DBLP]
Probabilistic and Topological Semantics for Timed Automata. [Citation Graph (, )][DBLP]
When Are Timed Automata Determinizable? [Citation Graph (, )][DBLP]
Almost-Sure Model Checking of Infinite Paths in One-Clock Timed Automata. [Citation Graph (, )][DBLP]
Stochastic Game Logic. [Citation Graph (, )][DBLP]
Reduction Techniques for Model Checking Markov Decision Processes. [Citation Graph (, )][DBLP]
SYANCO 2007: international workshop on synthesis and analysis of component connectors. [Citation Graph (, )][DBLP]
Probabilistic Acceptors for Languages over Infinite Words. [Citation Graph (, )][DBLP]
Generating Compact MTBDD-Representations from ProbmelaSpecifications. [Citation Graph (, )][DBLP]
Verifying nondeterministic probabilistic channel systems against $\omega$-regular linear-time properties [Citation Graph (, )][DBLP]
Probabilistic Automata over Infinite Words: Expressiveness, Efficiency, and Decidability [Citation Graph (, )][DBLP]
Checking Equivalence for Reo Networks. [Citation Graph (, )][DBLP]
Preface. [Citation Graph (, )][DBLP]
Preface. [Citation Graph (, )][DBLP]
Synthesis of Reo Circuits from Scenario-based Specifications. [Citation Graph (, )][DBLP]
Search in 0.009secs, Finished in 0.012secs
|