Sciweavers

240 search results - page 30 / 48
» Infinite trace equivalence
Sort
View
SSC
2007
Springer
126views Cryptology» more  SSC 2007»
15 years 5 months ago
Randomness and Representation of Span n Sequences
Any span n sequences can be regarded as filtering sequences. From this observation, new randomness criteria for span n sequences are proposed. It is proved that the feedback funct...
Guang Gong
CORR
2010
Springer
146views Education» more  CORR 2010»
14 years 12 months ago
Formal Relationships Between Geometrical and Classical Models for Concurrency
A wide variety of models for concurrent programs has been proposed during the past decades, each one focusing on various aspects of computations: trace equivalence, causality betwe...
Eric Goubault, Samuel Mimram
ENTCS
2006
129views more  ENTCS 2006»
14 years 11 months ago
Confluence Thanks to Extensional Determinism
A process is extensionally deterministic if, after any trace s and given any event a, it is either certain to accept or certain to refuse a (stably) after s. We show how several p...
A. W. Roscoe
VRST
2006
ACM
15 years 5 months ago
Presence in response to dynamic visual realism: a preliminary report of an experiment study
This paper describes an experiment that examines the influence of visual realism on reported presence. 33 participants experienced two different renderings of a virtual environmen...
Pankaj Khanna, Insu Yu, Jesper Mortensen, Mel Slat...
KBSE
2003
IEEE
15 years 5 months ago
Model-based Verification of Web Service Compositions
In this paper we discuss a model-based approach to verifying web service compositions for web service implementations. This approach provides verification of properties created fr...
Howard Foster, Sebastián Uchitel, Jeff Mage...