default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPeter Niebert
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[c27]Cedric Berenger, Peter Niebert, Kévin Perrot:
Balanced Connected Partitioning of Unweighted Grid Graphs. MFCS 2018: 39:1-39:18- 2014
- [c26]Peter Niebert, Mathieu Caralp:
Cellular Programming. TPNC 2014: 11-22 - 2011
- [c25]Janusz Malinowski, Peter Niebert, Pierre-Alain Reynier:
A Hierarchical Approach for the Synthesis of Stabilizing Controllers for Hybrid Systems. ATVA 2011: 198-212 - 2010
- [c24]Janusz Malinowski, Peter Niebert:
SAT Based Bounded Model Checking with Partial Order Semantics for Timed Automata. TACAS 2010: 405-419
2000 – 2009
- 2009
- [j3]Peter Niebert, Doron A. Peled:
Efficient model checking for LTL with partial order snapshots. Theor. Comput. Sci. 410(42): 4180-4189 (2009) - 2008
- [c23]Peter Niebert, Doron A. Peled, Amir Pnueli:
Discriminative Model Checking. CAV 2008: 504-516 - 2006
- [c22]Peter Niebert, Hongyang Qu:
The Implementation of Mazurkiewicz Traces in POEM. ATVA 2006: 508-522 - [c21]Peter Niebert, Hongyang Qu:
Adding Invariants to Event Zone Automata. FORMATS 2006: 290-305 - [c20]Marcos E. Kurbán, Peter Niebert, Hongyang Qu, Walter Vogler:
Stronger Reduction Criteria for Local First Search. ICTAC 2006: 108-122 - [c19]Peter Niebert, Doron A. Peled:
Efficient Model Checking for LTL with Partial Order Snapshots. TACAS 2006: 272-286 - 2005
- [j2]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) - 2004
- [c18]Scott Cotton, Eugene Asarin
, Oded Maler, Peter Niebert:
Some Progress in Satisfiability Checking for Difference Logic. FORMATS/FTRTFT 2004: 263-276 - [c17]Pedro R. D'Argenio, Peter Niebert:
Partial Order Reduction on Concurrent Probabilistic Programs. QEST 2004: 240-249 - [c16]Denis Lugiez, Peter Niebert, Sarah Zennou:
A Partial Order Semantics Approach to the Clock Explosion Problem of Timed Automata. TACAS 2004: 296-311 - 2003
- [c15]Martijn Hendriks, Gerd Behrmann, Kim Guldstrand Larsen, Peter Niebert, Frits W. Vaandrager:
Adding Symmetry Reduction to Uppaal. FORMATS 2003: 46-59 - [c14]Sarah Zennou, Manuel Yguel, Peter Niebert:
ELSE: A New Symbolic State Generator for Timed Automata. FORMATS 2003: 273-280 - [c13]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 - [e1]Kim Guldstrand Larsen, Peter Niebert:
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 [contents] - 2002
- [c12]Peter Niebert, Moez Mahfoudh, Eugene Asarin, Marius Bozga, Oded Maler, Navendu Jain:
Verification of Timed Automata via Satisfiability Checking. FTRTFT 2002: 225-244 - [c11]Denis Lugiez, Peter Niebert, Sarah Zennou:
Dynamic Bounds and Transition Merging for Local First Search. SPIN 2002: 221-229 - [c10]Sébastien Bornot, Rémi Morin, Peter Niebert, Sarah Zennou:
Black Box Unfolding with Local First Search. TACAS 2002: 386-400 - 2001
- [j1]Peter Niebert, Sergio Yovine:
Computing Efficient Operation Schemes for Chemical Plants in Multi-batch Mode. Eur. J. Control 7(4): 440-454 (2001) - [c9]Peter Niebert, Michaela Huhn, Sarah Zennou, Denis Lugiez:
Local First Search - A New Paradigm for Partial Order Reductions. CONCUR 2001: 396-410 - 2000
- [c8]Peter Niebert, Sergio Yovine:
Computing Optimal Operation Schemes for Chemical Plants in Multi-batch Mode. HSCC 2000: 338-351
1990 – 1999
- 1999
- [c7]Michaela Huhn, Peter Niebert, Frank Wallner:
Model Checking Logics for Communicating Sequential Agents. FoSSaCS 1999: 227-242 - 1998
- [b1]Peter Niebert:
A temporal logic for the specification and verification of distributed behaviour. University of Hildesheim, Germany, 1998, pp. 1-246 - [c6]Thomas Gehrke, Michaela Huhn, Peter Niebert, Arend Rensink, Heike Wehrheim:
A Process Algebra Semantics for MSC Including Conditions. FBT 1998: 185-196 - [c5]Michaela Huhn, Peter Niebert, Heike Wehrheim:
Partial Order Reductions for Bisimulation Checking. FSTTCS 1998: 271-282 - [c4]Michaela Huhn, Peter Niebert, Frank Wallner:
Verification Based on Local States. TACAS 1998: 36-51 - 1997
- [c3]Peter Niebert, Barbara Sprick:
A Tableau Proof System for a Mazurkiewicz Trace Logic with Fixpoints. TABLEAUX 1997: 291-306 - 1996
- [c2]Michaela Huhn, Peter Niebert:
Towards Automata for Branching Time and Partial Order. CONCUR 1996: 611-626 - 1995
- [c1]Peter Niebert:
A v-Calculus with Local Views for Systems of Sequential Agents. MFCS 1995: 563-573
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:13 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
