Pages that link to "Item:Q4910418"
From MaRDI portal
The following pages link to A Proof System for Compositional Verification of Probabilistic Concurrent Processes (Q4910418):
Displaying 10 items.
- Verification of multiprocess probabilistic protocols (Q1079944) (← links)
- A trace-based compositional proof theory for fault tolerant distributed systems (Q1330425) (← links)
- SOS specifications for uniformly continuous operators (Q1678172) (← links)
- Probabilistic divide \& congruence: branching bisimilarity (Q2007735) (← links)
- Leveraging weighted automata in compositional reasoning about concurrent probabilistic systems (Q2819835) (← links)
- Compositional bisimulation metric reasoning with Probabilistic Process Calculi (Q2974795) (← links)
- Cyclic Arithmetic Is Equivalent to Peano Arithmetic (Q2988374) (← links)
- (Q4941913) (← links)
- (Q5094116) (← links)
- Back to the format: a survey on SOS for probabilistic processes (Q6151619) (← links)