36 search results - page 5 / 8 » Bisimulation Equivalence is Decidable for all Context-Free P... |
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...
IJFCS
2008
13 years 8 months ago
2008
We consider the equivalence problem for labeled Markov chains (LMCs), where each state is labeled with an observation. Two LMCs are equivalent if every finite sequence of observat...
DKE
2008
13 years 8 months ago
2008
In various application domains there is a desire to compare process models, e.g., to relate an organization-specific process model to a reference model, to find a web service matc...
CONCUR
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. We unify a view on three extensions of Process Rewrite Systems (PRS) and compare their expressive power with that of PRS. We show that the class of Petri nets is less exp...
ENTCS
1998
13 years 7 months ago
1998
We consider a generalisation of Larsen and Skou’s [19] reactive probabilistic transition systems which exhibit three kinds of choice: action-guarded probabilistic choice, extern...