#### Filter Results:

- Full text PDF available (14)

#### Publication Year

2004

2017

- This year (1)
- Last 5 years (7)
- Last 10 years (9)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Olga Grinchtein, Martin Leucker, Nir Piterman
- IJCAR
- 2006

Verification by network invariants is a heuristic to solve uniform verification of parameterized systems. Given a system P , a network invariant for P is a system that abstracts the composition of every number of copies of P running in parallel. If there is such a network invariant, by reasoning about it, uniform verification with respect to the family P… (More)

Conformance testing for finite state machines and regular inference both aim at identifying the model structure underlying a black box system on the basis of a limited set of observations. Whereas the former technique checks for equivalence with a given conjecture model, the latter techniques addresses the corresponding synthesis problem by means of… (More)

- Olga Grinchtein, Bengt Jonsson, Paul Pettersson
- CONCUR
- 2006

In regular inference, the problem is to infer a regular language, typically represented by a deterministic finite automaton (DFA) from answers to a finite set of membership queries, each of which asks whether the language contains a certain word. There are many algorithms for learning DFAs, the most well-known being the L algorithm due to Dana Angluin.… (More)

- Olga Grinchtein, Bengt Jonsson, Martin Leucker
- Theor. Comput. Sci.
- 2004

In regular inference, a regular language is inferred from answers to a finite set of membership queries, each of which asks whether the language contains a certain word. One of the most well-known regular inference algorithms is the L∗ algorithm due to Dana Angluin. However, there are almost no extensions of these algorithms to the setting of timed systems.… (More)

- Olga Grinchtein, Martin Leucker
- ICGI
- 2006

The general goal of query-based learning algorithms for finite-state machines is to identify a machine, usually of minimum size, that agrees with an a priori fixed (class of) machines. For this, queries on how the underlying system behaves may be issued. A popular setup is that of Angluin’s L algorithm[Ang87], here adapted to the case of finite-state… (More)

- Olga Grinchtein, Bengt Jonsson, Martin Leucker
- Electr. Notes Theor. Comput. Sci.
- 2005

We extend Angluin’s algorithm for on-line learning of regular languages to the setting of timed transition systems. More specifically, we describe a procedure for inferring systems that can be described by event-recording automata by asking a sequence of membership queries (does the system accept a given timed word?) and equivalence queries (is a… (More)

- Olga Grinchtein, Martin Leucker
- Formal Aspects of Computing
- 2004

We extend the approach of model checking parameterized networks of processes by means of network invariants to the setting of real-time systems. We introduce timed transition structures (which are similar in spirit to timed automata) and define a notion of abstraction that is safe with respect to linear temporal properties. We strengthen the notion of… (More)

- Olga Grinchtein
- 2008

- Kenneth Balck, Olga Grinchtein, Justin Pearson
- 2014 Design, Automation & Test in Europe…
- 2014

Within telecommunications development it is vital to have frameworks and systems to replay complicated scenarios on equipment under test, often there are not enough available scenarios. In this paper we study the problem of testing a test harness, which replays scenarios and analyses protocol logs for the Public Warning System service, which is a part of… (More)

- Johannes Borgström, Olga Grinchtein, Simon Kramer
- Formal Aspects in Security and Trust
- 2006