132 search results - page 10 / 27 » Process Equivalences as Global Bisimulations |
CONCUR
2009
Springer
14 years 2 months ago
2009
Springer
Bisimulation equivalence is decidable in polynomial time for both sequential and commutative normed context-free processes, known as BPA and BPP, respectively. Despite apparent sim...
JOLLI
2002
13 years 7 months ago
2002
We analyze extensive games as interactive process models, using modal languages plus matching notions of bisimulation as varieties of game equivalences. Our technical results show ...
IPPS
2003
IEEE
14 years 1 months ago
2003
IEEE
In this paper, we have developed an operational semantic framework for a non-trival subset of Verilog which features event–driven computation, shared variable concurrency. The b...
QEST
2007
IEEE
14 years 2 months ago
2007
IEEE
We investigate logics and equivalence relations that capture the qualitative behavior of Markov Decision Processes (MDPs). We present Qualitative Randomized Ctl (Qrctl): formulas o...
FMCO
2005
Springer
14 years 1 months ago
2005
Springer
We present a method for decomposing modal formulas for processes with the internal action τ. To decide whether a process algebra term satisfies a modal formula, one can check whe...