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	Hilfe

Suche: Series=LNCS AND Volume=4546

• Petri nets, discrete physics, and distributed quantum computation
  Samson Abramsky
  Lecture Notes in Computer Science 4546, 2007, pp. 1-2
• Autonomous Distributed System and its realization by Multi Agent Nets
  Sadatoshi Kumagai, Toshiyuki Miyamoto
  Lecture Notes in Computer Science 4546, 2007, pp. 3-19
• Petri nets without tokens
  Antoni Mazurkiewicz
  Lecture Notes in Computer Science 4546, 2007, pp. 20-23
• Toward specifications for reconfigurable component systems
  Andrzej Tarlecki
  Lecture Notes in Computer Science 4546, 2007, pp. 24-28
• Generating Petri net state spaces
  Karsten Wolf
  Lecture Notes in Computer Science 4546, 2007, pp. 29-42
• Markov decision Petri net and Markov decision well-formed net formalisms
  M. Beccuti, G. Franceschinis, S. Haddad
  Lecture Notes in Computer Science 4546, 2007, pp. 43-62
• Comparison of the expressiveness of arc, place and transition Time Petri Nets
  M. Boyer, O.H. Roux
  Lecture Notes in Computer Science 4546, 2007, pp. 63-82
• Improving static variable orders via invariants
  Gianfranco Ciardo, Gerald Lüttgen, Andy Jinqing Yu
  Lecture Notes in Computer Science 4546, 2007, pp. 83-103
• Independence of net transformations and token firing in reconfigurable place/transition systems
  Hartmut Ehrig, Kathrin Hoffmann, Julia Padberg, Ulrike Prange, Claudia Ermel
  Lecture Notes in Computer Science 4546, 2007, pp. 104-123
• From many places to few: Automatic abstraction refinement for Petri nets
  Pierre Ganty, Jean-François Raskin, Laurent Van Begin
  Lecture Notes in Computer Science 4546, 2007, pp. 124-143
• A compositional method for the synthesis of asynchronous communication mechanisms
  Kyller Gorgônio, Jordi Cortadella, Fei Xia
  Lecture Notes in Computer Science 4546, 2007, pp. 144-163
• History-dependent Petri nets
  Kees van Hee, Alexander Serebrenik, Natalia Sidorova, Wil van der Aalst
  Lecture Notes in Computer Science 4546, 2007, pp. 164-183
• Complete process semantics for inhibitor nets
  Gabriel Juhás, Robert Lorenz, Sebastian Mauser
  Lecture Notes in Computer Science 4546, 2007, pp. 184-203
• Behaviour-preserving transition insertions in unfolding prefixes
  Victor Khomenko
  Lecture Notes in Computer Science 4546, 2007, pp. 204-222
• Combining decomposition and unfolding for STG synthesis
  Victor Khomenko, Mark Schaefer
  Lecture Notes in Computer Science 4546, 2007, pp. 223-243
• Object nets for mobility
  Michael Köhler, Berndt Farwer
  Lecture Notes in Computer Science 4546, 2007, pp. 244-262
• Web service orchestration with super-dual object nets
  Michael Köhler, Heiko Rölke
  Lecture Notes in Computer Science 4546, 2007, pp. 263-280
• Synthesis of elementary net systems with context arcs and localities
  Maciej Koutny, Marta Pietkiewicz-Koutny
  Lecture Notes in Computer Science 4546, 2007, pp. 281-300
• Nets with tokens which carry data
  Ranko Lazić, Tom Newcomb, Joël Ouaknine, A.W. Roscoe, James Worrell
  Lecture Notes in Computer Science 4546, 2007, pp. 301-320
• Operating guidelines for finite-state services
  Niels Lohmann, Peter Massuthe, Karsten Wolf
  Lecture Notes in Computer Science 4546, 2007, pp. 321-341
• Theory of regions for the synthesis of inhibitor nets from scenarios
  Robert Lorenz, Sebastian Mauser, Robin Bergenthum
  Lecture Notes in Computer Science 4546, 2007, pp. 342-361
• Utilizing fuzzy Petri net for choreography based semantic web services discovery
  Peng Men, Zhenhua Duan, Bin Yu
  Lecture Notes in Computer Science 4546, 2007, pp. 362-380
• Formal models for multicast traffic in network on chip architectures with compositional high-level Petri nets
  Elisabeth Pelz, Dietmar Tutsch
  Lecture Notes in Computer Science 4546, 2007, pp. 381-401
• Name creation vs. replication in Petri net systems
  Fernando Rosa-Velardo, David de Frutos-Escrig
  Lecture Notes in Computer Science 4546, 2007, pp. 402-422
• Modelling the Datagram Congestion Control Protocol's connection management and synchronization procedures
  Somsak Vanit-Anunchai, Jonathan Billington
  Lecture Notes in Computer Science 4546, 2007, pp. 423-444