Sciweavers

4 search results - page 1 / 1
» On the Axiomatizability of Ready Traces, Ready Simulation, a...
Sort
View
ICALP
2003
Springer
13 years 10 months ago
On the Axiomatizability of Ready Traces, Ready Simulation, and Failure Traces
We provide an answer to an open question, posed by van Glabbeek [4], regarding the axiomatizability of ready trace semantics. We prove that if the alphabet of actions is finite, t...
Stefan Blom, Wan Fokkink, Sumit Nain
ENTCS
2006
119views more  ENTCS 2006»
13 years 4 months ago
Trace Machines for Observing Continuous-Time Markov Chains
In this paper, we study several linear-time equivalences (Markovian trace equivalence, failure and ready trace equivalence) for continuous-time Markov chains that refer to the pro...
Verena Wolf, Christel Baier, Mila E. Majster-Ceder...
JNCA
2008
117views more  JNCA 2008»
13 years 4 months ago
Assessing readiness of IP networks to support desktop videoconferencing using OPNET
OPNET is a powerful network design and simulation tool that has gained popularity in industry and academia. However, there exists no known simulation approach on how to deploy a p...
Khaled Salah, Prasad Calyam, M. I. Buhari
JUCS
2006
89views more  JUCS 2006»
13 years 4 months ago
Process Equivalences as Global Bisimulations
: Bisimulation can be defined in a simple way using coinductive methods, and has rather pleasant properties. Ready similarity was proposed by Meyer et al. as a way to weakening the...
David de Frutos-Escrig, Carlos Gregorio-Rodr&iacut...