#### Filter Results:

- Full text PDF available (11)

#### Publication Year

2008

2017

- This year (1)
- Last 5 years (12)
- Last 10 years (14)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Maciej Gazda, Tim A. C. Willemse
- GandALF
- 2013

Dull, weak and nested solitaire games are important classes of parity games, capturing, among others, alternation-free μ-calculus and ECTL∗ model checking problems. These classes can be solved in polynomial time using dedicated algorithms. We investigate the complexity of Zielonka’s Recursive algorithm for solving these special games, showing that the… (More)

- Maciej Gazda, Wan Fokkink
- SOS
- 2010

One of the basic sanity properties of a behavioural semantics is that it constitutes a congruence with respect to standard process operators. This issue has been traditionally addressed by the development of rule formats for transition system specifications that define process algebras. In this paper we suggest a novel, orthogonal approach. Namely, we focus… (More)

- Maciej Gazda, Wan Fokkink
- EXPRESS
- 2012

We prove a compactness theorem in the context of Hennessy–Milner logic. It is used to derive a sufficient condition on modal characterizations for the Approximation Induction Principle to be sound modulo the corresponding process equivalence. We show that this condition is necessary when the equivalence in question is compositional with respect to the… (More)

- Maciej Gazda, Tim A. C. Willemse
- SOFSEM
- 2012

Inspired by the concept of a consistent correlation for Boolean equation systems, we introduce and study a novel relation, called consistent consequence. We show that it can be used as an approximation of the solution to an equation system. For the closed, simple and recursive fragment of equation systems we prove that it coincides with direct simulation… (More)

- Maciej Gazda, Wan Fokkink
- Comput. J.
- 2013

Labelled transition systems constitute a widely used model of concurrent computation. They model processes by explicitly describing their states and transitions from state to state, together with the actions that produce these transitions. Several notions of behavioural semantics have been proposed, with the aim to identify those states that afford the same… (More)

- Maciej Gazda, Tim A. C. Willemse
- EXPRESS/SOS
- 2012

ion is often a key instrument for turning intractable model checking problems into tractable problems. In the theoretical studies on abstraction frameworks, the expressivity and completeness of the frameworks are the main indicators of the power of the frameworks. A major problem is that the notion of expressiveness of an abstraction framework is not… (More)

- Maciej Gazda, Tim A. C. Willemse
- ArXiv
- 2014

Small Progress Measures is one of the most efficient parity game solving algorithms. The original algorithm provides the full solution (winning regions and strategies) in O(dm · (n/⌈d/2⌉)) time, and requires a re-run of the algorithm on one of the winning regions. We provide a novel operational interpretation of progress measures, and modify the algorithm… (More)

- Sjoerd Cranen, Maciej Gazda, Wieger Wesselink, Tim A. C. Willemse
- ACM Trans. Comput. Log.
- 2015

We present a theory of abstraction for the framework of parameterised Boolean equation systems, a first-order fixpoint logic. Parameterised Boolean equation systems can be used to solve a variety of problems in verification. We study the capabilities of the abstraction theory by comparing it to an abstraction theory for Generalised Kripke modal Transition… (More)

- Maciej Gazda, Tim A. C. Willemse
- GandALF
- 2015

Small Progress Measures is one of the classical parity game solving algorithms. For games with n vertices, m edges and d different priorities, the original algorithm computes the winning regions and a winning strategy for one of the players in O(dm · (n/⌊d/2⌋)⌊d/2⌋) time. Computing a winning strategy for the other player requires a re-run of the algorithm… (More)

- Maciej Gazda, Tim A. C. Willemse
- SOFSEM
- 2016