443 search results - page 9 / 89 » Relations in Concurrency |
ACSD
2006
IEEE
14 years 1 months ago
2006
IEEE
Recently, the formal approach of I–Systems has been newly hed through an abstract axiomatic system where events in system components are solely derived and defined from their b...
CCGRID
2009
IEEE
13 years 5 months ago
2009
IEEE
Data streaming management and scheduling is required by many grid computing applications, especially when the volume of data to be processed is extremely high while available stor...
MFCS
2005
Springer
14 years 1 months ago
2005
Springer
We compare the expressive power of two automata-based finite-state models of concurrency. We show that Droste’s and Kuske’s coherent stably concurrent automata and Bednarczyk...
QEST
2005
IEEE
14 years 1 months ago
2005
IEEE
We consider bisimulation and weak bisimulation relations in the context of the Labeled Markov Chains of Hansson and Jonsson, the Concurrent Labeled Markov Chains of Philippou, Lee...
ESOP
2010
Springer
14 years 5 months ago
2010
Springer
Formal reasoning about concurrent programs is usually done with the assumption that the underlying memory model is sequentially consistent, i.e. the execution outcome is equivalen...