FSTTCS 2007 | Sciweavers

5

click to vote

FSTTCS
2007
Springer

74views Software Engineering» more FSTTCS 2007»

Probabilistic and Topological Semantics for Timed Automata

13 years 10 months ago

Download www.lsv.ens-cachan.fr

Christel Baier, Nathalie Bertrand, Patricia Bouyer...

claim paper

Read More »

17

click to vote

FSTTCS
2007
Springer

129views Software Engineering» more FSTTCS 2007»

On Simulatability Soundness and Mapping Soundness of Symbolic Cryptography

13 years 10 months ago

Download people.inf.ethz.ch

Abstract. The abstraction of cryptographic operations by term algebras, called DolevYao models or symbolic cryptography, is essential in almost all tool-supported methods for provi...

Michael Backes, Markus Dürmuth, Ralf Küs...

claim paper

Read More »

12

click to vote

FSTTCS
2007
Springer

148views Software Engineering» more FSTTCS 2007»

Better Algorithms and Bounds for Directed Maximum Leaf Problems

13 years 10 months ago

Download www.cs.tau.ac.il

The Directed Maximum Leaf Out-Branching problem is to ﬁnd an out-branching (i.e. a rooted oriented spanning tree) in a given digraph with the maximum number of leaves. In this pa...

Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael ...

claim paper

Read More »

12

click to vote

FSTTCS
2007
Springer

138views Software Engineering» more FSTTCS 2007»

Automata and Logics for Timed Message Sequence Charts

13 years 10 months ago

Download www.lsv.ens-cachan.fr

Abstract. We provide a framework for distributed systems that impose timing constraints on their executions. We propose a timed model of communicating ﬁnite-state machines, which...

S. Akshay, Benedikt Bollig, Paul Gastin

claim paper

Read More »

7

click to vote

FSTTCS
2007
Springer

107views Software Engineering» more FSTTCS 2007»

Model Checking Almost All Paths Can Be Less Expensive Than Checking All Paths

13 years 10 months ago