Workshop Publications

This post has 1149 words. Reading it will take approximately 6 minutes.

Rating: 0.0/5 (0 votes cast)

Workshops, reviewed

2011

M. Westergaard, “Towards Verifying Parallel Algorithms and Programs using Coloured Petri Nets,” in Petri Nets and Software Engineering. International Workshop PNSE’11, 2011, pp. 57-71.
[Bibtex]

@InProceedings{parallel-algorithms,
author =   {Westergaard, Michael},
title =   {Towards Verifying Parallel Algorithms and Programs using Coloured {Petri} Nets},
pages =   {57-71},
booktitle =   {{Petri} Nets and Software Engineering. International Workshop PNSE'11},
editor =   {Duvigneau, Michael and Moldt, Daniel and Hiraishi, Kunihiko},
month =    jun,
year =    2011,
volume =    723,
series =    {CEUR Workshop Proceedings},
ISSN =    {1613-0074},
publisher =    {CEUR-WS.org},
url =    {http://CEUR-WS.org/Vol-723},
urn =    {urn:nbn:de:0074-723-C}
abstract =    {Coloured Petri nets have proved to be a useful formalism
for modeling distributed algorithms, i.e., algorithms
where nodes communicate via message passing.  Here we
describe an approach for modeling parallel algorithms and
programs, i.e., algorithms and programs where processes
communicate via shared memory.  The model is verified for
correctness, here to prove absence of mutual exclusion
violations and to find dead- and live-locks.  The
approach can be used in a model-driven development
approach, where code is generated from a model, in a
model-extraction approach, where a model is extracted
from running code, or using a combination of the two,
supporting extracting a model from an abstract
description and generation of correct implementation
code.  We illustrate our idea by applying the technique
to a parallel implementation of explicit state-space
exploration.}
}

M. Westergaard and Verbeek, “Efficient Implementation of Prioritized Transitions for High-level Petri Nets,” in Petri Nets and Software Engineering. International Workshop PNSE’11, 2011, pp. 27-41.
[Bibtex]

@InProceedings{priority,
author =   {Westergaard, Michael and Verbeek, H. M. W.},
title =   {Efficient Implementation of Prioritized Transitions for High-level {Petri} Nets},
pages =   {27-41},
booktitle =   {{Petri} Nets and Software Engineering. International Workshop PNSE'11},
editor =   {Duvigneau, Michael and Moldt, Daniel and Hiraishi, Kunihiko},
month =    jun,
year =    2011,
volume =    723,
series =    {CEUR Workshop Proceedings},
ISSN =    {1613-0074},
publisher =    {CEUR-WS.org},
url =    {http://CEUR-WS.org/Vol-723},
urn =    {urn:nbn:de:0074-723-C}
abstract =    {Transition priorities can be a useful mechanism when
modeling using Petri nets.  For example, high-priority
transitions can be used to model exception handling and
low-priority transitions can be used to model background
tasks that should only be executed when no other
transition is enabled.  Transition priorities can be
simulated in Petri nets using, e.\,g., inhibitor arcs,
but such constructs tend to unnecessarily clutter models,
making it useful to support priorities directly.

Computing the enabling of transitions in high-level Petri
nets is an expensive operation and should be avoided.  As
transition priorities introduce a nonlocal enabling
condition, at first sight this forces us to compute
enabling for all transitions in a highest-priority-first
order, but it is possible to do better.  Here we describe
our implementation of transition priorities in CPN Tools
3.0, where we minimize the number of enabling
computations.  We describe algorithms for executing
transitions at random, useful for automatic simulation
without user interactions, and for maintaining a set of
known enabled transitions, useful for interactive
user-guided simulation.  Experiments show that using our
algorithms we can execute $4-7$ million transitions a
minute for real-life models and more than $20$ million
transitions a minute for other models, a significant
improvement over the $1-5$ million transitions a minute
possible for simpler algorithms.}
}

2009

K. L. Espensen, M. K. Kjeldsen, L. M. Kristensen, and M. Westergaard, “Towards Automatic Code-generation from Process-partitioned Coloured Petri Nets,” in Proc. of 10th CPN Workshop, 2009, pp. 41-60.
[Bibtex]

@InProceedings{codegenerationcpn,
Author         = {Espensen, Kristian Leth and Kjeldsen, Mads Keblov and Kristensen, Lars Michael and Westergaard, Michael},
Title          = {{Towards Automatic Code-generation from Process-partitioned Coloured Petri Nets}},
BookTitle      = {{Proc. of 10th CPN Workshop}},
Volume         = {590},
Series         = {DAIMI-PB},
Pages          = {41-60},
year           = 2009,
}

M. Westergaard, L. M. Kristensen, and M. Kuusela, “A Prototype for Cosimulating SystemC and Coloured Petri Net Models,” in Proc. of 10th CPN Workshop, 2009, pp. 1-19.
[Bibtex]

@InProceedings{cosimulationcpn,
Author         = {Westergaard, Michael and Kristensen, Lars Michael and Kuusela, Maija},
Title          = {{A Prototype for Cosimulating SystemC and Coloured Petri Net Models}},
BookTitle      = {{Proc. of 10th CPN Workshop}},
Volume         = {590},
Series         = {DAIMI-PB},
Pages          = {1-19},
year           = 2009,
}

2008

S. Evagelista, M. Westergaard, and L. M. Kristensen, “The ComBack Method Revisited: Caching Strategies and Extension with Delayed Duplicate Detection,” in Proc. of 9th CPN Workshop, 2008, pp. 63-82.
[Bibtex]

@InProceedings{combackrevisited,
Author         = {Evagelista, Sami and Westergaard, Michael and Kristensen, Lars Michael},
Title          = {{The ComBack Method Revisited: Caching Strategies and Extension with Delayed Duplicate Detection}},
BookTitle      = {{Proc. of 9th CPN Workshop}},
Volume         = {588},
Series         = {DAIMI-PB},
Pages          = {63-82},
year           = 2008,
}

M. Westergaard and L. M. Kristensen, “Two Interfaces to the CPN Tools Simulator,” in Proc. of 9th CPN Workshop, 2008, pp. 83-102.
[Bibtex]

@InProceedings{siminterface,
Author         = {Westergaard, Michael and Kristensen, Lars Michael},
Title          = {{Two Interfaces to the CPN Tools Simulator}},
BookTitle      = {{Proc. of 9th CPN Workshop}},
Volume         = {588},
Series         = {DAIMI-PB},
Pages          = {83-102},
year           = 2008,
}

M. Westergaard and L. M. Kristensen, “JoSEL: A Job Specification and Execution Language for Model Checking,” in Proc. of 9th CPN Workshop, 2008, pp. 7-26.
[Bibtex]

@InProceedings{joselcpn,
Author         = {Westergaard, Michael and Kristensen, Lars Michael},
Title          = {{JoSEL: A Job Specification and Execution Language for Model Checking}},
BookTitle      = {{Proc. of 9th CPN Workshop}},
Volume         = {588},
Series         = {DAIMI-PB},
Pages          = {7-26},
year           = 2008,
}

2007

M. Westergaard, “A Game-theoretic View on Behavioural Visualisation,” in Proc. of 2nd International Workshop on Formal Methods for Interactive Systems, 2007.
[Bibtex]

@InProceedings{gameanimation,
Author         = {Westergaard, Michael},
Title          = {{A Game-theoretic View on Behavioural Visualisation}},
BookTitle      = {{Proc. of 2nd International Workshop on Formal Methods for Interactive Systems}},
year           = 2007,
}

2006

M. Westergaard, “Game Coloured Petri Nets,” in Proc. of 7th CPN Workshop, 2006, pp. 281-300.
[Bibtex]

@InProceedings{gcpn,
Author         = {Westergaard, Michael},
Title          = {{Game Coloured Petri Nets}},
BookTitle      = {{Proc. of 7th CPN Workshop}},
Volume         = {579},
Series         = {DAIMI-PB},
Pages          = {281-300},
year           = 2006,
}

M. Westergaard, “The BRITNeY Suite: A Platform for Experiments,” in Proc. of 7th CPN Workshop, 2006, pp. 97-116.
[Bibtex]

@InProceedings{platform,
Author         = {Westergaard, Michael},
Title          = {{The BRITNeY Suite: A Platform for Experiments}},
BookTitle      = {{Proc. of 7th CPN Workshop}},
Volume         = {579},
Series         = {DAIMI-PB},
Pages          = {97-116},
year           = 2006,
}

2005

M. Westergaard and K. B. Lassen, “Building and Deploying Visualizations of Coloured Petri Net Models Using BRITNeY animation and CPN Tools,” in Proc. of 6th CPN Workshop, 2005, pp. 119-136.
[Bibtex]

@InProceedings{techbritney,
Author         = {Westergaard, Michael and Lassen, Kristian Bisgaard},
Title          = {{Building and Deploying Visualizations of Coloured Petri Net Models Using BRITNeY animation and CPN Tools}},
BookTitle      = {{Proc. of 6th CPN Workshop}},
Volume         = {576},
Series         = {DAIMI-PB},
Pages          = {119-136},
year           = 2005,
}

2004

M. Westergaard, “Towards a High-level Petri Net Type Definition,” in Proc. Workshop on the Definition, Implementation and Application of a Standard Interchange Format for Petri Nets, 2004.
[Bibtex]

@InProceedings{hlpn,
Author         = {Westergaard, Michael},
Title          = {{Towards a High-level Petri Net Type Definition}},
BookTitle      = {{Proc. Workshop on the Definition, Implementation and Application of a Standard Interchange Format for Petri Nets}},
year           = 2004,
}

2002

M. Westergaard, “Supporting Multiple Pointing Devices in Microsoft Windows,” in Proc. Microsoft Summer Workshop for Faculty and PhDs, 2002.
[Bibtex]

@InProceedings{mouse,
Author         = {Westergaard, Michael},
Title          = {{Supporting Multiple Pointing Devices in Microsoft Windows}},
BookTitle      = {{Proc. Microsoft Summer Workshop for Faculty and PhDs}},
year           = 2002,
}

Comments are closed | Trackback

Michael Westergaard's Homepage