Peter Niebert

Janusz Malinowski, Peter Niebert, Pierre-Alain Reynier: A Hierarchical Approach for the Synthesis of Stabilizing Controllers for Hybrid Systems. ATVA 2011: 198-212

Janusz Malinowski, Peter Niebert: SAT Based Bounded Model Checking with Partial Order Semantics for Timed Automata. TACAS 2010: 405-419

Peter Niebert, Doron Peled: Efficient model checking for LTL with partial order snapshots. Theor. Comput. Sci. 410(42): 4180-4189 (2009)

Peter Niebert, Doron Peled, Amir Pnueli: Discriminative Model Checking. CAV 2008: 504-516

Peter Niebert, Hongyang Qu: The Implementation of Mazurkiewicz Traces in POEM. ATVA 2006: 508-522

Peter Niebert, Hongyang Qu: Adding Invariants to Event Zone Automata. FORMATS 2006: 290-305

Marcos E. Kurbán, Peter Niebert, Hongyang Qu, Walter Vogler: Stronger Reduction Criteria for Local First Search. ICTAC 2006: 108-122

Peter Niebert, Doron Peled: Efficient Model Checking for LTL with Partial Order Snapshots. TACAS 2006: 272-286

Denis Lugiez, Peter Niebert, Sarah Zennou: A partial order semantics approach to the clock explosion problem of timed automata. Theor. Comput. Sci. 345(1): 27-59 (2005)

Scott Cotton, Eugene Asarin, Oded Maler, Peter Niebert: Some Progress in Satisfiability Checking for Difference Logic. FORMATS/FTRTFT 2004: 263-276

Pedro R. D'Argenio, Peter Niebert: Partial Order Reduction on Concurrent Probabilistic Programs. QEST 2004: 240-249

Denis Lugiez, Peter Niebert, Sarah Zennou: A Partial Order Semantics Approach to the Clock Explosion Problem of Timed Automata. TACAS 2004: 296-311

Martijn Hendriks, Gerd Behrmann, Kim Guldstrand Larsen, Peter Niebert, Frits W. Vaandrager: Adding Symmetry Reduction to Uppaal. FORMATS 2003: 46-59

Sarah Zennou, Manuel Yguel, Peter Niebert: ELSE: A New Symbolic State Generator for Timed Automata. FORMATS 2003: 273-280

Paul Caspi, Adrian Curic, Aude Maignan, Christos Sofronis, Stavros Tripakis, Peter Niebert: From simulink to SCADE/lustre to TTA: a layered approach for distributed embedded applications. LCTES 2003: 153-162

Kim Guldstrand Larsen, Peter Niebert (Eds.): Formal Modeling and Analysis of Timed Systems: First International Workshop, FORMATS 2003, Marseille, France, September 6-7, 2003. Revised Papers. Lecture Notes in Computer Science 2791, Springer 2003, isbn 3-540-21671-5

Peter Niebert, Moez Mahfoudh, Eugene Asarin, Marius Bozga, Oded Maler, Navendu Jain: Verification of Timed Automata via Satisfiability Checking. FTRTFT 2002: 225-244

Denis Lugiez, Peter Niebert, Sarah Zennou: Dynamic Bounds and Transition Merging for Local First Search. SPIN 2002: 221-229

Sébastien Bornot, Rémi Morin, Peter Niebert, Sarah Zennou: Black Box Unfolding with Local First Search. TACAS 2002: 386-400

Peter Niebert, Sergio Yovine: Computing Efficient Operation Schemes for Chemical Plants in Multi-batch Mode. Eur. J. Control 7(4): 440-454 (2001)

Peter Niebert, Michaela Huhn, Sarah Zennou, Denis Lugiez: Local First Search - A New Paradigm for Partial Order Reductions. CONCUR 2001: 396-410

Peter Niebert, Sergio Yovine: Computing Optimal Operation Schemes for Chemical Plants in Multi-batch Mode. HSCC 2000: 338-351

Michaela Huhn, Peter Niebert, Frank Wallner: Model Checking Logics for Communicating Sequential Agents. FoSSaCS 1999: 227-242

Thomas Gehrke, Michaela Huhn, Peter Niebert, Arend Rensink, Heike Wehrheim: A Process Algebra Semantics for MSC Including Conditions. FBT 1998: 185-196

Michaela Huhn, Peter Niebert, Heike Wehrheim: Partial Order Reductions for Bisimulation Checking. FSTTCS 1998: 271-282

Michaela Huhn, Peter Niebert, Frank Wallner: Verification Based on Local States. TACAS 1998: 36-51

Peter Niebert, Barbara Sprick: A Tableau Proof System for a Mazurkiewicz Trace Logic with Fixpoints. TABLEAUX 1997: 291-306

Michaela Huhn, Peter Niebert: Towards Automata for Branching Time and Partial Order. CONCUR 1996: 611-626

Peter Niebert: A v-Calculus with Local Views for Systems of Sequential Agents. MFCS 1995: 563-573