5
votes
Accepted
Problem with definition of bisimilarity
You seem to be confusing the definition of bisimilarity with an algorithm for finding a bisimulation.
In your examples, the states are indeed bisimilar, and the relation is the set
$$\{(A,A)\}$$
It ...
- 17k
5
votes
Accepted
How does lack of deadlock relate to computability in process calculi?
I think you are asking about expressivity of concurrent programming languages. This is a deep and not well-understood field. For example you say that "the $\pi$-calculus [...] has the power to ...
- 8,308
2
votes
Accepted
Restriction and re-labeling on CCS
I am not completely sure about what is causing your confusion, but perhaps this can help:
$a.\bar{b}.0$ can only perform $a$.
$(a.\bar{b}.0)\setminus\{b\}$ can only perform $a$.
$((a.\bar{b}.0)\...
- 14.4k
2
votes
Accepted
Weak bisimulation up-to $\approx$
(partial answer)
For the relation $\mathcal{R} = \{(\tau.a, 0)\}$, $\mathcal{R} \nsubseteq \approx$ but $\mathcal{R} \subseteq \, \approx \! \mathcal{R} \approx$. Why is $\mathcal{R} \subseteq \,...
- 14.4k
2
votes
Are there (highly) restricted process calculi? Perhaps similar to formal grammar?
I wondered if there were much more restrictive formalisms for describing concurrent processes?
Petri nets are IMO more restrictive than the process calculus and such. They are state-transition ...
- 2,163
2
votes
Benefit of Petri Net Transition as Separate Object
In my experience, the duality of Petri nets is a great strength.
It forces us to specify the potential events or actions in a system (the transitions), as they may happen to individual items (the ...
- 5,359
1
vote
Benefit of Petri Net Transition as Separate Object
The state transition graph underlying a Petri Net model is called the Reachability Graph. Yes, it exists, and it is the foundation of Petri Net semantics. However, it is possible to define simple, ...
- 121
Only top scored, non community-wiki answers of a minimum length are eligible