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=836

• From timed graphs to hybrid automata
  Costas Courcoubetis
  Lecture Notes in Computer Science 836, 1994, pp. 160
• Hierarchical models of synchronous circuits
  D. Dill
  Lecture Notes in Computer Science 836, 1994, pp. 161
• Model-based verification methods and tools
  J.C. Fernandez, J. Sifakis, R. de Simone
  Lecture Notes in Computer Science 836, 1994, pp. 64
• Geometry of interaction
  Jean-Yves Girard
  Lecture Notes in Computer Science 836, 1994, pp. 1
• The logical structure of concurrent constraint programming languages
  Prakash Panangaden
  Lecture Notes in Computer Science 836, 1994, pp. 129
• A compositional semantics for statecharts using labeled transition systems
  Andrew C. Uselton, Scott A. Smolka
  Lecture Notes in Computer Science 836, 1994, pp. 2-17
• On the decidability of non-interleaving process equivalences
  Astrid Kiehn, Matthew Hennessy
  Lecture Notes in Computer Science 836, 1994, pp. 18-33
• Regularity of BPA-systems is decidable
  Sjouke Mauw, Hans Mulder
  Lecture Notes in Computer Science 836, 1994, pp. 34-47
• A fast algorithm for deciding bisimilarity of normed context-free processes
  Yoram Hirshfeld, Faron Moller
  Lecture Notes in Computer Science 836, 1994, pp. 48-63
• New results on the analysis of concurrent systems with an indefinite number of processes
  Mahesh Girkar, Robert Moll
  Lecture Notes in Computer Science 836, 1994, pp. 65-80
• Verification of nonregular temporal properties for context-free processes
  Ahmed Bouajjani, Rachid Echahed, Riadh Robbana
  Lecture Notes in Computer Science 836, 1994, pp. 81-97
• Pushdown processes: Parallel composition and model checking
  Olaf Burkart, Bernhard Steffen
  Lecture Notes in Computer Science 836, 1994, pp. 98-113
• Local model checking for parallel compositions of context-free processes
  Hardi Hungar
  Lecture Notes in Computer Science 836, 1994, pp. 114-128
• Countable non-determinism and uncountable limits
  Pietro di Gianantonio, Furio Honsell, Silvia Liani, Gordon D. Plotkin
  Lecture Notes in Computer Science 836, 1994, pp. 130-145
• SProc categorically
  J.R.B. Cockett, D.A. Spooner
  Lecture Notes in Computer Science 836, 1994, pp. 146-159
• The observational power of clocks
  Rajeev Alur, Costas Courcoubetis, Thomas A. Henzinger
  Lecture Notes in Computer Science 836, 1994, pp. 162-177
• A dynamic approach to timed behaviour
  Jeremy Gunawardena
  Lecture Notes in Computer Science 836, 1994, pp. 178-193
• Algebras of processes of timed Petri nets
  Józef Winkowski
  Lecture Notes in Computer Science 836, 1994, pp. 194-209
• Operational semantics for the Petri box calculus
  Maciej Koutny, Javier Esparza, Eike Best
  Lecture Notes in Computer Science 836, 1994, pp. 210-225
• Weak sequential composition in process algebras
  Arend Rensink, Heike Wehrheim
  Lecture Notes in Computer Science 836, 1994, pp. 226-241
• Efficient parallelism vs reliable distribution: A trade-off for concurrent computations
  Paris C. Kanellakis, Dimitrios Michailidis, Alex A. Shvartsman
  Lecture Notes in Computer Science 836, 1994, pp. 242-266
• On unifying assumption-commitment style proof rules for concurrency
  Qiwen Xu, Antonio Cau, Pierre Collette
  Lecture Notes in Computer Science 836, 1994, pp. 267-282
• Liveness and fairness in duration calculus
  Jens Ulrich Skakkebaek
  Lecture Notes in Computer Science 836, 1994, pp. 283-298
• A symbolic semantics for the \pi-calculus
  Michele Boreale, Rocco De Nicola
  Lecture Notes in Computer Science 836, 1994, pp. 299-314
• On bisimulation in the \pi-calculus
  David Walker
  Lecture Notes in Computer Science 836, 1994, pp. 315-330