Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Kristensen, Lars Michael"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Hybrid on-the-fly LTL model checking with the sweep-line method
Sami Evangelista
,
Lars Michael Kristensen
Lecture Notes in Computer Science
7347
, 2012, pp. 248-267
ASAP: An extensible platform for state space analysis
Michael Westergaard
,
Sami Evangelista
,
Lars Michael Kristensen
Lecture Notes in Computer Science
5606
, 2009, pp. 303-312
The Access/CPN framework: A tool for interacting with the CPN Tools simulator
Michael Westergaard
,
Lars Michael Kristensen
Lecture Notes in Computer Science
5606
, 2009, pp. 313-322
The ComBack method - Extending hash compaction with backtracking
Michael Westergaard
,
Lars Michael Kristensen
,
Gerth Stlting Brodal
,
Lars Arge
Lecture Notes in Computer Science
4546
, 2007, pp. 445-464
A formal service specification for the Internet Open Trading Protocol
Chun Ouyang
,
Lars Michael Kristensen
,
Jonathan Billington
Lecture Notes in Computer Science
2360
, 2002, pp. 352-373
Condensed state spaces for timed Petri nets
Sren Christensen
,
Lars Michael Kristensen
,
Thomas Mailund
Lecture Notes in Computer Science
2075
, 2001, pp. 101-120
Improved question-guided stubborn set methods for state properties
Lars Michael Kristensen
,
Antti Valmari
Lecture Notes in Computer Science
1825
, 2000, pp. 282-302
Modelling and analysis of a DANFOSS flowmeter system using coloured Petri nets
Louise Lorentsen
,
Lars Michael Kristensen
Lecture Notes in Computer Science
1825
, 2000, pp. 346-366
Computer aided verification of Lamport's fast mutual exclusion algorithm using colored Petri nets and occurrence graphs with symmetries
Jens Bæk Jrgensen
,
Lars Michael Kristensen
IEEE Transactions on Parallel and Distributed Systems
10
(7), 1999, pp. 714-732
Finding stubborn sets of coloured Petri nets without unfolding
Lars Michael Kristensen
,
Antti Valmari
Lecture Notes in Computer Science
1420
, 1998, pp. 104-123