


default search action
Theoretical Computer Science, Volume 538
Volume 538, June 2014
- Mieke Massink

, Gethin Norman
, Herbert Wiklicky:
Quantitative Aspects of Programming Languages and Systems (2011-12). 1
- Pedro Adão

, Paulo Mateus
, Luca Viganò
:
Protocol insecurity with a finite number of sessions and a cost-sensitive guessing intruder is NP-complete. 2-15 - Yuxin Deng

, Rob J. van Glabbeek, Matthew Hennessy, Carroll Morgan:
Real-reward testing for probabilistic processes. 16-36 - Klaus Dräger, Marta Z. Kwiatkowska, David Parker

, Hongyang Qu:
Local abstraction refinement for probabilistic timed programs. 37-53 - Uli Fahrenberg, Axel Legay:

The quantitative linear-time-branching-time spectrum. 54-69 - Sergio Giro:

Optimal schedulers vs optimal bases: An approach for efficient exact solving of Markov decision processes. 70-83 - Sergio Giro, Pedro R. D'Argenio

, Luis María Ferrer Fioriti:
Distributed probabilistic input/output automata: Expressiveness, (un)decidability and algorithms. 84-102 - Henri Hansen

, Mark Timmer
:
A comparison of confluence and ample sets in probabilistic and non-probabilistic branching time. 103-123 - Vladimir Klebanov:

Precise quantitative information flow analysis - a symbolic approach. 124-139 - Max Tschaikowski

, Mirco Tribastone
:
Exact fluid lumpability in Markovian process algebra. 140-166 - Hirotoshi Yasuoka, Tachio Terauchi

:
Quantitative information flow as safety and liveness hyperproperties. 167-182

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














