Operational determinism and fast algorithms

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4137 LNCS, Issue , 2006, Pages 188-202

  Hansen, Henri ^a   Valmari, Antti ^a  

^a TAMPERE UNIVERSITY OF TECHNOLOGY   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; ALGORITHMS; ARTIFICIAL INTELLIGENCE; AUTOMATA THEORY; COMPUTER SCIENCE; SEMANTICS;

BRANCHING BISIMILARITY; DIVERGENCE-SENSITIVE EQUIVALENCES; LABELLED TRANSITION SYSTEM (LTS); PROCESS-ALGEBRAIC SEMANTICS;

SYSTEMS ANALYSIS;

EID: 33749580740     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11817949_13     Document Type: Conference Paper

References (13)

1. S. Blom and S. Orzan. Distributed branching bisimulation reduction of state spaces, In PDMC 2003, Parallel and Distributed Model Checking (Satellite workshop of CAV'03, volume 89(1) of ENTCS, pages 99-113. Elsevier, 2003.
2. T. Cormen, C. Leiserson, R. Rivest, and C. Stein. Introduction to Algorithms. MIT Press, second edition, 2001.
3. R. De Nicola and F. Vaandrager. Three logics for branching bisimulation. Journal of the ACM, 42(2):458-487, 1995.
4. J. Eloranta. Minimal Transition Systems with Respect to Divergence Preserving Behavioural Equivalences. PhD thesis, University of Helsinki, 1994.
5. J. Engelfriet. Determinacy → (observation equivalence = trace equivalence). Theoretical Computer Science, 36(1):21-25, 1985.
6. th International Colloquim on Automata Languages and Programming, volume 443 of LNCS, pages 626-638. Springer, 1990.
7. A. W. Roscoe. CSP and determinism in security modelling. In Proceedings of IEEE Symposium on Security and Privacy, pages 114-127. IEEE, 1995.
8. A. W. Roscoe. The Theory and Practice of Concurrency. Prentice-Hall, 1998. 565 p.
9. P. Y. A. Ryan and S. A. Schneider. Process algebra and non-interference. In Proceedings of Computer Security Foundations Workshop, pages 214-227. IEEE, 1999.
10. th International Conference on Concurrency Theory, Hildesheim, Germany, August 1993, number 715 in LNCS, pages 66-81. Springer, 1993.
11. R. J. Van Glabbeek and W. P. Weijland. Branching time and abstraction in bisimulation semantics. Journal of the ACM, 43(3):555-600, 1996.
12. M. Voorhoeve and S. Mauw. Impossible futures and determinism. Information Processing Letters, 80(1):51-58, 2001.
13. S. Zdancewic and A. Myers. Observational determinism for concurrent program security. In Proceedings of the 16th IEEE Computer Security Foundations Workshop, pages 29-43. IEEE, 2003.