#### Filter Results:

- Full text PDF available (101)

#### Publication Year

1998

2017

- This year (3)
- Last 5 years (39)
- Last 10 years (91)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Andreas Bauer, Martin Leucker, Christian Schallhart
- ACM Trans. Softw. Eng. Methodol.
- 2011

This article studies runtime verification of properties expressed either in lineartime temporal logic (LTL) or timed lineartime temporal logic (TLTL). It classifies runtime verification in identifying its distinguishing features to model checking and testing, respectively. It introduces a three-valued semantics (with truth values <i>true, false,… (More)

- Andreas Bauer, Martin Leucker, Christian Schallhart
- J. Log. Comput.
- 2010

When monitoring a system wrt. a property defined in a temporal logic such as LTL, a major concern is to settle with an adequate interpretation of observable system events; that is, models of temporal logic formulae are usually infinite words of events, whereas at runtime only finite but incrementally expanding prefixes are available. In this work, we review… (More)

- Martin Leucker, Christian Schallhart
- J. Log. Algebr. Program.
- 2009

In this paper, a brief account of the field of runtime verification is given. Starting with a definition of runtime verification, a comparison to well-known verification techniques like model checking and testing is provided, and applications in which runtime verification brings out its distinguishing features are pointed out. Moreover, extensions of… (More)

Among other domains, learning finite-state machines is important for obtaining a model of a system under development, so that powerful formal methods such as model checking can be applied. A prominent algorithm for learning such devices was developed by Angluin. We have implemented this algorithm in a straightforward way to gain further insights to… (More)

- Harald Fecher, Martin Leucker, Verena Wolf
- SPIN
- 2006

In this paper the abstraction-refinement paradigm based on 3-valued logics is extended to the setting of probabilistic systems. We define a notion of abstraction for Markov chains. To be able to relate the behavior of abstract and concrete systems, we equip the notion of abstraction with the concept of simulation. Furthermore, we present model checking for… (More)

This paper proposes a novel abstraction technique for continuous-time Markov chains (CTMCs). Our technique fits within the realm of three-valued abstraction methods that have been used successfully for traditional model checking. The key idea is to apply abstraction on uniform CTMCs that are readily obtained from general CTMCs, and to abstract transition… (More)

- Alexander Gruler, Martin Leucker, Kathrin D. Scheidemann
- FMOODS
- 2008

Software product line engineering combines the individual developments of systems to the development of a family of systems consisting of common and variable assets. In this paper we introduce the process algebra PL-CCS as a product line extension of CCS and show how to model the overall behavior of an entire family within PL-CCS. PL-CCS models incorporate… (More)

- Christel Baier, Marcus Größer, Martin Leucker, Benedikt Bollig, Frank Ciesinski
- IFIP TCS
- 2004

- Benedikt Bollig, Peter Habermehl, Carsten Kern, Martin Leucker
- IJCAI
- 2009

This paper introduces NL, a learning algorithm for inferring non-deterministic finite-state automata using membership and equivalence queries. More specifically, residual finite-state automata (RFSA) are learned similar as in Angluin’s popular L algorithm, which however learns deterministic finite-state automata (DFA). As RFSA can be exponentially more… (More)

- Andreas Bauer, Martin Leucker, Christian Schallhart
- FSTTCS
- 2006

This paper presents a construction for runtime monitors that check real-time properties expressed in timed LTL (TLTL). Due to D’Souza’s results, TLTL can be considered a natural extension of LTL towards real-time. Moreover, a typical obstacle in runtime verification is solved both for untimed and timed formulae, in that standard models of linear temporal… (More)