Jeroen J. A. Keiren

Jeroen J. A. Keiren

Auto-generated profile, based on publicly available information

Jeroen J. A. Keiren

Eindhoven University of Technology

Research Focus & Metrics

Academic Career Length

19Years (2008-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2013
Verified
Book Chapter
Closed access
PDF file
SCSjoerd Cranen
Sjoerd Cranen
Jan Friso GrooteJan Friso Groote
Jan Friso Groote
JKJeroen J. A. Keiren
Jeroen J. A. Keiren
FSFrank P. M. Stappers
Frank P. M. Stappers
EVErik P. de Vink
Erik P. de Vink
TWTim A. C. Willemse
Tim A. C. Willemse

26 December 2024 in Formal Aspects of Computing
Verified
Journal Article
Open access
MBMaurice H. ter Beek
Maurice H. ter Beek
RCRod Chapman
Rod Chapman
RCRance Cleaveland
Rance Cleaveland
HGHubert Garavel
Hubert Garavel
RGRong Gu
Rong Gu
LZLijun Zhang
Lijun Zhang
Formal methods encompass a wide choice of techniques and tools for the specification, development, analysis, and verification of software and hardware systems. Formal methods are widely applied in industry, in activities ranging from the elicitation of requirements and the early design phases all the way to the deployment, configuration, and runtime monitoring of actual systems. Formal methods allow one to precisely specify the environment in which a system operates, the requirements and properties that the system should satisfy, the models of the system used during the various design steps, and the code embedded in the final implementation, as well as to express conformance relations between these specifications. We present a broad scope of successful applications of formal methods in industry, not limited to the well-known success stories from the safety-critical domain, like railways and other transportation systems, but also covering other areas such as lithography manufacturing and cloud security in e-commerce, to name but a few. We also report testimonies from a number of representatives from industry who, either directly or indirectly, use or have used formal methods in their industrial project endeavours. These persons are spread geographically, including Europe, Asia, North and South America, and the involved projects witness the large coverage of applications of formal methods, not limited to the safety-critical domain. We thus make a case for the importance of formal methods, and in particular of the capacity to abstract and mathematical reasoning that are taught as part of any formal methods course. These are fundamental Computer Science skills that graduates should profit from when working as computer scientists in industry, as confirmed by industry representatives.

12 November 2015
Verified
Book Chapter
Open access
PDF file
JKJeroen J. A. Keiren
Jeroen J. A. Keiren
We propose a benchmark suite for parity games that includes the benchmarks that have been used in the literature, and make it available online. We give an overview of the parity games, including a description of how they have been generated. We also describe structural properties of parity games, and using these properties we show that our benchmarks are representative. With this work we provide a starting point for further experimentation with parity games.

17 April 2020
Verified
Book Chapter
Open access
PDF file
DJDavid N. Jansen
David N. Jansen
Jan Friso GrooteJan Friso Groote
Jan Friso Groote
JKJeroen J. A. Keiren
Jeroen J. A. Keiren
AWAnton Wijs
Anton Wijs
Branching bisimilarity is a behavioural equivalence relation on labelled transition systems (LTSs) that takes internal actions into account. It has the traditional advantage that algorithms for branching bisimilarity are more efficient than ones for other weak behavioural equivalences, especially weak bisimilarity. With m the number of transitions and n the number of states, the classic $${O\left( {m n}\right) }$$ algorithm was recently replaced by an $$O({m (\log \left| { Act }\right| + \log n)})$$ algorithm [9], which is unfortunately rather complex. This paper combines its ideas with the ideas from Valmari [20], resulting in a simpler $$O({m \log n})$$ algorithm. Benchmarks show that in practice this algorithm is also faster and often far more memory efficient than its predecessors, making it the best option for branching bisimulation minimisation and preprocessing for calculating other weak equivalences on LTSs.

1 December 2013 in Science of Computer Programming
Verified
Journal Article
Closed access
YHYi Ling Hwong
Yi Ling Hwong
JKJeroen J.A. Keiren
Jeroen J.A. Keiren
VKVincent J.J. Kusters
Vincent J.J. Kusters
SLSander J.J. Leemans
Sander J.J. Leemans
TWTim A.C. Willemse
Tim A.C. Willemse

28 November 2017 in Logical Methods in Computer Science
Verified
Journal Article
Open access
PDF file
DEDavid De Frutos Escrig
David De Frutos Escrig
JKJeroen J. A. Keiren
Jeroen J. A. Keiren
TWTim A. C. Willemse
Tim A. C. Willemse
Weak bisimulations are typically used in process algebras where silent steps are used to abstract from internal behaviours. They facilitate relating implementations to specifications. When an implementation fails to conform to its specification, pinpointing the root cause can be challenging. In this paper we provide a generic characterisation of branching-, delayed-, $\eta$- and weak-bisimulation as a game between Spoiler and Duplicator, offering an operational understanding of the relations. We show how such games can be used to assist in diagnosing non-conformance between implementation and specification. Moreover, we show how these games can be extended to distinguish divergences.