Search

Your search keyword '"Niebert, Peter"' showing total 97 results
Start Over Author "Niebert, Peter" Publication Year Range Last 50 years
97 results on '"Niebert, Peter"'

1. Cellular Programming

Author

Niebert, Peter, Caralp, Mathieu, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Kobsa, Alfred, Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Dediu, Adrian-Horia, editor, Lozano, Manuel, editor, and Martín-Vide, Carlos, editor

Published
2014
Full Text
View/download PDF

2. Adding Symmetry Reduction to Uppaal

Author

Hendriks, Martijn, Behrmann, Gerd, Larsen, Kim, Niebert, Peter, Vaandrager, Frits, Goos, Gerhard, editor, Hartmanis, Juris, editor, van Leeuwen, Jan, editor, Larsen, Kim Guldstrand, editor, and Niebert, Peter, editor

Published
2004
Full Text
View/download PDF

4. A Hierarchical Approach for the Synthesis of Stabilizing Controllers for Hybrid Systems

Author

Malinowski, Janusz, Niebert, Peter, Reynier, Pierre-Alain, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Bultan, Tevfik, editor, and Hsiung, Pao-Ann, editor

Published
2011
Full Text
View/download PDF

5. SAT Based Bounded Model Checking with Partial Order Semantics for Timed Automata

Author

Malinowski, Janusz, Niebert, Peter, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Esparza, Javier, editor, and Majumdar, Rupak, editor

Published
2010
Full Text
View/download PDF

6. Discriminative Model Checking

Author

Niebert, Peter, Peled, Doron, Pnueli, Amir, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Gupta, Aarti, editor, and Malik, Sharad, editor

Published
2008
Full Text
View/download PDF

7. Stronger Reduction Criteria for Local First Search

Author

Kurbán, Marcos E., Niebert, Peter, Qu, Hongyang, Vogler, Walter, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Barkaoui, Kamel, editor, Cavalcanti, Ana, editor, and Cerone, Antonio, editor

Published
2006
Full Text
View/download PDF

8. The Implementation of Mazurkiewicz Traces in POEM

Author

Niebert, Peter, Qu, Hongyang, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Graf, Susanne, editor, and Zhang, Wenhui, editor

Published
2006
Full Text
View/download PDF

9. Adding Invariants to Event Zone Automata

Author

Niebert, Peter, Qu, Hongyang, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Asarin, Eugene, editor, and Bouyer, Patricia, editor

Published
2006
Full Text
View/download PDF

10. Efficient Model Checking for LTL with Partial Order Snapshots

Author

Niebert, Peter, Peled, Doron, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Dough, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Hermanns, Holger, editor, and Palsberg, Jens, editor

Published
2006
Full Text
View/download PDF

11. Some Progress in Satisfiability Checking for Difference Logic

Author

Cotton, Scott, Asarin, Eugene, Maler, Oded, Niebert, Peter, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Lakhnech, Yassine, editor, and Yovine, Sergio, editor

Published
2004
Full Text
View/download PDF

33. Balanced Connected Partitioning of Unweighted Grid Graphs

Author

Perrot, Kévin, Berenger, Cédric, Niebert, Peter, Laboratoire d'Informatique et Systèmes (LIS), Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS), Calcul Naturel (CANA), Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS)-Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS), and Algorithmique Distribuée (DALGO)

Subjects
060201 languages & linguistics, 000 Computer science, knowledge, general works, 0602 languages and literature, Computer Science, ComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISION, 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, [INFO]Computer Science [cs], 06 humanities and the arts, 02 engineering and technology, ComputingMilieux_MISCELLANEOUS, MathematicsofComputing_DISCRETEMATHEMATICS
Abstract

We consider a partitioning problem for grid graphs with special constraints: a (square) grid graph as well as a number of colors is given, a solution is a coloring approximatively assigning the same number of vertices to each color and such that the induced subgraph for each color is connected. In a "rooted" variant, a vertex to be included in the coloring for each color is specified as well. This problem has a concrete motivation in multimedia streaming applications. We show that the general problem is NP-complete. On the other hand, we define a reasonable easy subclass of grid graphs for which solutions always exist and can be computed by a greedy algorithm.

Published
2018

34. Balanced Connected Partitioning of Unweighted Grid Graphs

Author

Berenger, Cedric, Niebert, Peter, Perrot, Kevin, Berenger, Cedric, Niebert, Peter, and Perrot, Kevin

Abstract

We consider a partitioning problem for grid graphs with special constraints: a (square) grid graph as well as a number of colors is given, a solution is a coloring approximatively assigning the same number of vertices to each color and such that the induced subgraph for each color is connected. In a "rooted" variant, a vertex to be included in the coloring for each color is specified as well. This problem has a concrete motivation in multimedia streaming applications. We show that the general problem is NP-complete. On the other hand, we define a reasonable easy subclass of grid graphs for which solutions always exist and can be computed by a greedy algorithm.

Published
2018
Full Text
View/download PDF

35. Balanced Connected Partitioning of Unweighted Grid Graphs

Author

Cedric Berenger and Peter Niebert and Kevin Perrot, Berenger, Cedric, Niebert, Peter, Perrot, Kevin, Cedric Berenger and Peter Niebert and Kevin Perrot, Berenger, Cedric, Niebert, Peter, and Perrot, Kevin

Abstract

We consider a partitioning problem for grid graphs with special constraints: a (square) grid graph as well as a number of colors is given, a solution is a coloring approximatively assigning the same number of vertices to each color and such that the induced subgraph for each color is connected. In a "rooted" variant, a vertex to be included in the coloring for each color is specified as well. This problem has a concrete motivation in multimedia streaming applications. We show that the general problem is NP-complete. On the other hand, we define a reasonable easy subclass of grid graphs for which solutions always exist and can be computed by a greedy algorithm.

Published
2018
Full Text
View/download PDF

38. Formal Modeling and Analysis of Timed Systems

Author

Larsen, Kim Guldstrand and Niebert, Peter

Subjects
formal analysis, formal methods, real-time systems, timed systems, timed automata, process lagebra, timed petri nets, temporal constraints, time calculus, model checking, timed languates, formal modeling, logical constraints
Abstract

This book constitutes the thoroughly refereed post-proceedings of the First International Workshop on Formal Modeling and Analysis of Timed Systems, FORMATS 2003, held in Marseille, France in September 2003. The 19 revised full papers presented together with an invited paper and the abstracts of two invited talks were carefully selected from 36 submissions during two rounds of reviewing and improvement. All current aspects of formal method for modeling and analyzing timed systems are addressed; among the timed systems dealt with are timed automata, timed Petri nets, max-plus algebras, real-time systems, discrete time systems, timed languages, and real-time operating systems.

Published
2004

40. Discrete-time rewards model-checked

Author

Andova, Suzana, Hermanns, Holger, Katoen, Joost-Pieter, Larsen, Kim G., Niebert, Peter, and Mathematics and Computer Science

Subjects
Model checking, Theoretical computer science, Markov chain, business.industry, Computer science, EWI-6538, Probabilistic logic, Markov model, Discrete time and continuous time, Probabilistic CTL, Temporal logic, Artificial intelligence, IR-66289, business, Protocol (object-oriented programming)
Abstract

This paper presents a model-checking approach for analyzing discrete-time Markov reward models. For this purpose, the temporal logic probabilistic CTL is extended with reward constraints. This allows to formulate complex measures – involving expected as well as accumulated rewards – in a precise and succinct way. Algorithms to efficiently analyze such formulae are introduced. The approach is illustrated by model-checking a probabilistic cost model of the IPv4 zeroconf protocol for distributed address assignment in ad-hoc networks.

Published
2003

42. Model checking gossip modalities

Author

Huhn, Michaela, Niebert, Peter, and Wallner, Frank

Subjects
DATA processing & computer science, ddc:004
Abstract

We present a model checking technique for LRT, a temporal logic for communicating sequential agents (CSAs) introduced by Lodaya, Ramanujam, and Thiagarajan. LRT contains temporal modalities indexed with a local point of view of one agent and allows to refer to properties of other agents according to the latest gossip which is related to local knowledge. The model checking procedure relies on a modularisation of LRT into temporal and gossip modalities. We introduce a hierarchy of formulae and a corresponding hierarchy of equivalences, which allows to compute for each formula and finite state distributed system a finite multi modal Kripke structure, on which the formula can be checked with standard techniques.

Published
1998
Full Text
View/download PDF

47. Efficient Model Checking for LTL with Partial Order Snapshots.

Author

Hermanns, Holger, Palsberg, Jens, Niebert, Peter, and Peled, Doron

Abstract

Certain behavioral properties of distributed systems are difficult to express in interleaving semantics, whereas they are naturally expressed in terms of partial orders of events or, equivalently, Mazurkiewicz traces. Examples of such properties are serializability of a database or snapshots. Recently, a modest extension for LTL by an operator that expresses snapshots has been proposed. It combines the ease of linear (interleaving) specification with this useful partial order concept. The new construct allows one to assert that a global snapshot (also called a slice or a cut) was passed, perhaps not in the observed (interleaved) execution sequence, but possibly in a (trace) equivalent one. A model checking algorithm was suggested for a subset of this logic, with PSPACE complexity in the size of the system and the checked formula. For the whole logic, a solution that is in EXSPACE in the size of the system (PSPACE in the number of its global states) was given. In this paper, we provide a model checking algorithm in PSPACE in the size of a system of communicating sequential processes when restricting snapshots to boolean combinations of local properties of each process. Concerning size of the formula, it is PSPACE for the case of snapshot properties expressed in DNF, and EXPSPACE where a translation to DNF is necessary. [ABSTRACT FROM AUTHOR]

Published
2006
Full Text
View/download PDF

48. Adding Invariants to Event Zone Automata.

Author

Asarin, Eugene, Bouyer, Patricia, Niebert, Peter, and Hongyang Qu

Abstract

Recently, a new approach to the symbolic model checking of timed automata based on a partial order semantics was introduced, which relies on event zones that use vectors of event occurrences instead of clock zones that use vectors of clock values grouped in polyhedral clock constraints. Symbolic state exploration with event zones rather than clock zones can result in significant reductions in the number of symbolic states explored. In this work, we show how to extend the event zone approach to networks of automata with local state invariants, an important feature for modeling complex timed systems. To avoid formalizing local states, we attach to each transition an urgency constraint, that allows to code local state invariants. We have integrated the extension into a prototype tool with event zones and reported very promising experimental results. [ABSTRACT FROM AUTHOR]

Published
2006
Full Text
View/download PDF

49. Stronger Reduction Criteria for Local First Search.

Author

Barkaoui, Kamel, Cavalcanti, Ana, Cerone, Antonio, Kurbán, Marcos E., Niebert, Peter, Qu, Hongyang, and Vogler, Walter

Abstract

Local First Search (LFS) is a partial order technique for reducing the number of states to be explored when trying to decide reachability of a local (component) property in a parallel system; it is based on an analysis of the structure of the partial orders of executions in such systems. Intuitively, LFS is based on a criterion that allows to guide the search for such local properties by limiting the "concurrent progress" of components. In this paper, we elaborate the analysis of the partial orders in question and obtain related but significantly stronger criteria for reductions, show their relation to the previously established criterion, and discuss the algorithmics of the proposed improvement. Our contribution is both fundamental in providing better insights into LFS and practical in providing an improvement of high potential, as is illustrated by experimental results. [ABSTRACT FROM AUTHOR]

Published
2006
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results