Lars Michael Kristensen

Lars Michael Kristensen

Auto-generated profile, based on publicly available information

Lars Michael Kristensen

Western Norway University of Applied Sciences

Research Focus & Metrics

Academic Career Length

23Years (2004-Present)

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

Representative Publications

View All Publications
14 November 2022
Verified
Book Chapter
Closed access
PDF file
KLKeila Lima
Keila Lima
NNNgoc-Thanh Nguyen
Ngoc-Thanh Nguyen
RHRogardt Heldal
Rogardt Heldal
EKEric Knauss
Eric Knauss
TOTosin Daniel Oyetoyan
Tosin Daniel Oyetoyan
LKLars Michael Kristensen
Lars Michael Kristensen

1 September 2004 in Higher-Order and Symbolic Computation
Verified
Journal Article
Closed access
PDF file
LKLars Michael Kristensen
Lars Michael Kristensen
SCSøren Christensen
Søren Christensen

1 April 2019 in Journal of Logical and Algebraic Methods in Programming
Verified
Journal Article
Open access
RWRui Wang
Rui Wang
LKLars Michael Kristensen
Lars Michael Kristensen
HMHein Meling
Hein Meling
VSVolker Stolz
Volker Stolz

1 January 2019 in The Journal of Object Technology
Verified
Journal Article
Open access
ARAlejandro Rodríguez
Alejandro Rodríguez
FDFrancisco Durán
Francisco Durán
ARAdrian Rutle
Adrian Rutle
LKLars Michael Kristensen
Lars Michael Kristensen


25 May 2023 in Innovations in Systems and Software Engineering
Verified
Journal Article
Open access
PDF file
FAFaustin Ahishakiye
Faustin Ahishakiye
JJJosé Ignacio Requeno Jarabo
José Ignacio Requeno Jarabo
LKLars Michael Kristensen
Lars Michael Kristensen
VSVolker Stolz
Volker Stolz
High-level Petri nets such as coloured Petri nets (CPNs) are characterized by the combination of Petri nets and a high-level programming language. In CPNs and CPN Tools, the inscriptions (e.g. arc expressions and guards) are specified using Standard ML. The application of simulation and state space exploration for validating CPN models traditionally focuses on behavioural properties related to net structure, i.e. places and transitions. This means that the net inscriptions are only implicitly validated, and the extent to which their sub-expressions have been covered is not made explicit. This paper extends our previous work on coverage analysis of net inscriptions of CPN models. In particular, we improve the CPN Tools library responsible for annotating, instrumenting and collecting the evaluation of Boolean conditions for determining the coverage criteria based on model executions. The library now automates most of the instrumentation parts that were done manually before and integrates the reports of the coverage analysis into the CPN Tools GUI. We evaluate our approach on new publicly available CPN models.