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="Penczek, Wojciech"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
GreatSPN enhanced with decision diagram data structures
Junaid Babar
,
Marco Beccuti
,
Susanna Donatelli
,
Andrew Miner
Lecture Notes in Computer Science
6128
, 2010, pp. 308-317
Separability in persistent Petri nets
Eike Best
,
Philippe Darondeau
Lecture Notes in Computer Science
6128
, 2010, pp. 246-266
AlPiNA: A symbolic model checker
Didier Buchs
,
Steve Hostettler
,
Alexis Marechal
,
Matteo Risoldi
Lecture Notes in Computer Science
6128
, 2010, pp. 287-296
Factorization properties of symbolic unfoldings of colored Petri nets
Thomas Chatain
,
Eric Fabre
Lecture Notes in Computer Science
6128
, 2010, pp. 165-184
The NEO protocol for large-scale distributed database systems: Modelling and initial verification
Christine Choppy
,
Anna Dedova
,
Sami Evangelista
,
Silien Hong
,
Kais Klai
,
Laure Petrucci
Lecture Notes in Computer Science
6128
, 2010, pp. 145-164
Learning workflow Petri nets
Javier Esparza
,
Martin Leucker
,
Maximilian Schlund
Lecture Notes in Computer Science
6128
, 2010, pp. 206-225
Integrated process planning and supply chain configuration for commodity assemblies using Petri nets
Oleg Gusikhin
,
Erica Klampfl
Lecture Notes in Computer Science
6128
, 2010, pp. 125-144
Some thoughts on behavioral programming - Distinguished Carl Adam Petri Lecture
David Harel
Lecture Notes in Computer Science
6128
, 2010, pp. 18-18
PNML framework: An extendable reference implementation of the Petri net markup language
L.M. Hillah
,
F. Kordon
,
L. Petrucci
,
N. Tr`eves
Lecture Notes in Computer Science
6128
, 2010, pp. 318-327
Instance Deadlock: A mystery behind frozen programs
Gabriel Juhás
,
Igor Kazlov
,
Ana Juhásová
Lecture Notes in Computer Science
6128
, 2010, pp. 1-17
Petri nets with localities and testing
Jetty Kleijn
,
Maciej Koutny
Lecture Notes in Computer Science
6128
, 2010, pp. 19-38
A perspective on explicit state space exploration of Coloured Petri Nets: Past, present, and future
Lars M. Kristensen
Lecture Notes in Computer Science
6128
, 2010, pp. 39-42
A characterization of combined traces using labeled stratified order structures
Dai Tri Man Lê
Lecture Notes in Computer Science
6128
, 2010, pp. 104-124
Wendy: A tool to synthesize partners for services
Niels Lohmann
,
Daniela Weinberg
Lecture Notes in Computer Science
6128
, 2010, pp. 297-307
New algorithms for deciding the siphon-trap property
Olivia Oanea
,
Harro Wimmel
,
Karsten Wolf
Lecture Notes in Computer Science
6128
, 2010, pp. 267-286
Forward analysis for Petri nets with name creation
Fernando Rosa-Velardo
,
David de Frutos-Escrig
Lecture Notes in Computer Science
6128
, 2010, pp. 185-205
Process mining from a basis of state regions
Marc Solé
,
Josep Carmona
Lecture Notes in Computer Science
6128
, 2010, pp. 226-245
Can stubborn sets be optimal?
Antti Valmari
,
Henri Hansen
Lecture Notes in Computer Science
6128
, 2010, pp. 43-62
Canonical transition set semantics for Petri nets
Yunhe Wang
,
Li Jiao
Lecture Notes in Computer Science
6128
, 2010, pp. 84-103
Efficient computation of causal behavioural profiles using structural decomposition
Matthias Weidlich
,
Artem Polyvyanyy
,
Jan Mendling
,
Mathias Weske
Lecture Notes in Computer Science
6128
, 2010, pp. 63-83
Specification and model checking of temporal properties in time Petri nets and timed automata
Wojciech Penczek
,
Agata Póƚrola
Lecture Notes in Computer Science
3099
, 2004, pp. 37-76
Abstractions and partial order reductions for checking branching properties of Time Petri Nets
Wojciech Penczek
,
Agata Póƚrola
Lecture Notes in Computer Science
2075
, 2001, pp. 323-342
A partial order approach to branching time logic model checking
Rob Gerth
,
Ruurd Kuiper
,
Doron Peled
,
Wojciech Penczek
Information and Computation
150
(2), 1999, pp. 132-152
A modal logic for data analysis
Philippe Balbiani
Lecture Notes in Computer Science
1113
, 1996, pp. 167-179
From specifications to programs: A fork-algebraic approach to bridge the gap
Gabriel A. Baum
,
Marcelo F. Frias
,
Armando M. Haeberer
,
PabloE. Martínez López
Lecture Notes in Computer Science
1113
, 1996, pp. 180-191
Seiten 1
2
3
>