Lecture Notes in Computer Science - SOFSEM 2009: Theory and Practice of Computer Science
Latest Publications

TOTAL DOCUMENTS

58

(FIVE YEARS 0)

H-INDEX

6

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540958901, 9783540958918

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Service Oriented Architecture Pitfalls

Lecture Notes in Computer Science - SOFSEM 2009: Theory and Practice of Computer Science ◽

10.1007/978-3-540-95891-8_6 ◽

2009 ◽

pp. 37-45

Author(s):

Radovan Janeček

Keyword(s):

Service Oriented Architecture ◽

Service Oriented

Download Full-text

The Simple Reachability Problem in Switch Graphs

Lecture Notes in Computer Science - SOFSEM 2009: Theory and Practice of Computer Science ◽

10.1007/978-3-540-95891-8_42 ◽

2009 ◽

pp. 461-472 ◽

Author(s):

Klaus Reinhardt

Keyword(s):

Reachability Problem

Download Full-text

Partial Order Semantics of Types of Nets

Lecture Notes in Computer Science - SOFSEM 2009: Theory and Practice of Computer Science ◽

10.1007/978-3-540-95891-8_36 ◽

2009 ◽

pp. 388-400 ◽

Author(s):

Robert Lorenz ◽

Gabriel Juhás ◽

Sebastian Mauser

Keyword(s):

Partial Order ◽

Partial Order Semantics

Download Full-text

Asynchronous Deterministic Rendezvous on the Line

Lecture Notes in Computer Science - SOFSEM 2009: Theory and Practice of Computer Science ◽

10.1007/978-3-540-95891-8_45 ◽

2009 ◽

pp. 497-508 ◽

Author(s):

Grzegorz Stachowiak

Download Full-text

The Minimum Reload s-t Path/Trail/Walk Problems

Lecture Notes in Computer Science - SOFSEM 2009: Theory and Practice of Computer Science ◽

10.1007/978-3-540-95891-8_55 ◽

2009 ◽

pp. 621-632 ◽

Author(s):

Laurent Gourvès ◽

Adria Lyra ◽

Carlos Martinhon ◽

Jérôme Monnot

Keyword(s):

Download Full-text

Unambiguous Erasing Morphisms in Free Monoids

Lecture Notes in Computer Science - SOFSEM 2009: Theory and Practice of Computer Science ◽

10.1007/978-3-540-95891-8_43 ◽

2009 ◽

pp. 473-484 ◽

Author(s):

Johannes C. Schneider

Keyword(s):

Download Full-text

Natural Specifications Yield Decidability for Distributed Synthesis of Asynchronous Systems

Lecture Notes in Computer Science - SOFSEM 2009: Theory and Practice of Computer Science ◽

10.1007/978-3-540-95891-8_16 ◽

2009 ◽

pp. 141-152 ◽

Author(s):

Thomas Chatain ◽

Paul Gastin ◽

Nathalie Sznajder

Keyword(s):

Asynchronous Systems

Download Full-text

Improved Algorithms for the 2-Vertex Disjoint Paths Problem

Lecture Notes in Computer Science - SOFSEM 2009: Theory and Practice of Computer Science ◽

10.1007/978-3-540-95891-8_49 ◽

2009 ◽

pp. 546-557 ◽

Author(s):

Torsten Tholey

Keyword(s):

Disjoint Paths ◽

Vertex Disjoint

Download Full-text

On Finite Bases for Weak Semantics: Failures Versus Impossible Futures

Lecture Notes in Computer Science - SOFSEM 2009: Theory and Practice of Computer Science ◽

10.1007/978-3-540-95891-8_18 ◽

2009 ◽

pp. 167-180

Author(s):

Taolue Chen ◽

Wan Fokkink ◽

Rob van Glabbeek

Download Full-text

Algorithms for Solving Infinite Games

Lecture Notes in Computer Science - SOFSEM 2009: Theory and Practice of Computer Science ◽

10.1007/978-3-540-95891-8_7 ◽

2009 ◽

pp. 46-48

Author(s):

Marcin Jurdziński

Keyword(s):

Download Full-text