Foundations of Software Science and Computational Structures - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540784975, 9783540784999

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

The Common Fragment of ACTL and LTL

Foundations of Software Science and Computational Structures - Lecture Notes in Computer Science ◽

10.1007/978-3-540-78499-9_13 ◽

2008 ◽

pp. 172-185 ◽

Cited By ~ 6

Author(s):

Mikołaj Bojańczyk

Keyword(s):

Common Fragment ◽

The Common

Download Full-text

Finding Your Way in a Forest: On Different Types of Trees and Their Properties

Foundations of Software Science and Computational Structures - Lecture Notes in Computer Science ◽

10.1007/978-3-540-78499-9_1 ◽

2008 ◽

pp. 1-4

Author(s):

Igor Walukiewicz

Keyword(s):

Different Types

Download Full-text

Compositional Methods for Information-Hiding

Foundations of Software Science and Computational Structures - Lecture Notes in Computer Science ◽

10.1007/978-3-540-78499-9_31 ◽

2008 ◽

pp. 443-457 ◽

Cited By ~ 16

Author(s):

Christelle Braun ◽

Konstantinos Chatzikokolakis ◽

Catuscia Palamidessi

Keyword(s):

Information Hiding

Download Full-text

Symbolic Semantics Revisited

Foundations of Software Science and Computational Structures - Lecture Notes in Computer Science ◽

10.1007/978-3-540-78499-9_28 ◽

2008 ◽

pp. 395-412 ◽

Cited By ~ 8

Author(s):

Filippo Bonchi ◽

Ugo Montanari

Download Full-text

Systems of Equations Satisfied in All Commutative Finite Semigroups

Foundations of Software Science and Computational Structures - Lecture Notes in Computer Science ◽

10.1007/978-3-540-78499-9_19 ◽

2008 ◽

pp. 261-272

Author(s):

Paweł Parys

Keyword(s):

Systems Of Equations ◽

Finite Semigroups

Download Full-text

Deriving Bisimulation Congruences in the Presence of Negative Application Conditions

Foundations of Software Science and Computational Structures - Lecture Notes in Computer Science ◽

10.1007/978-3-540-78499-9_29 ◽

2008 ◽

pp. 413-427 ◽

Cited By ~ 5

Author(s):

Guilherme Rangel ◽

Barbara König ◽

Hartmut Ehrig

Download Full-text

Simple Stochastic Games with Few Random Vertices Are Easy to Solve

Foundations of Software Science and Computational Structures - Lecture Notes in Computer Science ◽

10.1007/978-3-540-78499-9_2 ◽

2008 ◽

pp. 5-19 ◽

Cited By ~ 10

Author(s):

Hugo Gimbert ◽

Florian Horn

Keyword(s):

Stochastic Games

Download Full-text

The Complexity of Nash Equilibria in Infinite Multiplayer Games

Foundations of Software Science and Computational Structures - Lecture Notes in Computer Science ◽

10.1007/978-3-540-78499-9_3 ◽

2008 ◽

pp. 20-34 ◽

Cited By ~ 22

Author(s):

Michael Ummels

Keyword(s):

Nash Equilibria ◽

Multiplayer Games

Download Full-text

Model-Checking ω-Regular Properties of Interval Markov Chains

Foundations of Software Science and Computational Structures - Lecture Notes in Computer Science ◽

10.1007/978-3-540-78499-9_22 ◽

2008 ◽

pp. 302-317 ◽

Cited By ~ 33

Author(s):

Krishnendu Chatterjee ◽

Koushik Sen ◽

Thomas A. Henzinger

Keyword(s):

Model Checking ◽

Markov Chains

Download Full-text

A Linear-non-Linear Model for a Computational Call-by-Value Lambda Calculus (Extended Abstract)

Foundations of Software Science and Computational Structures - Lecture Notes in Computer Science ◽

10.1007/978-3-540-78499-9_7 ◽

2008 ◽

pp. 81-96 ◽

Cited By ~ 1

Author(s):

Peter Selinger ◽

Benoît Valiron

Keyword(s):

Linear Model ◽

Lambda Calculus ◽

Non Linear

Download Full-text

Foundations of Software Science and Computational Structures - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

The Common Fragment of ACTL and LTL

Finding Your Way in a Forest: On Different Types of Trees and Their Properties

Compositional Methods for Information-Hiding

Symbolic Semantics Revisited

Systems of Equations Satisfied in All Commutative Finite Semigroups

Deriving Bisimulation Congruences in the Presence of Negative Application Conditions

Simple Stochastic Games with Few Random Vertices Are Easy to Solve

The Complexity of Nash Equilibria in Infinite Multiplayer Games

Model-Checking ω-Regular Properties of Interval Markov Chains

A Linear-non-Linear Model for a Computational Call-by-Value Lambda Calculus (Extended Abstract)

Foundations of Software Science and Computational Structures - Lecture Notes in Computer Science
Latest Publications