Pages that link to "Item:Q2365760"
From MaRDI portal
The following pages link to Towards action-refinement in process algebras (Q2365760):
Displaying 15 items.
- A timed calculus for wireless systems (Q650891) (← links)
- Free shuffle algebras in language varieties (Q671351) (← links)
- Revisiting sequential composition in process calculi (Q890611) (← links)
- The difference between splitting in \(n\) and \(n+1\) (Q1370654) (← links)
- Decomposition orders -- another generalisation of the fundamental theorem of arithmetic (Q1781996) (← links)
- Vertical implementation (Q1854462) (← links)
- A format for semantic equivalence comparison (Q1884897) (← links)
- Concurrent testing of processes (Q1902297) (← links)
- Timing and causality in process algebra (Q1924998) (← links)
- Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra (Q3507401) (← links)
- Nonfinite axiomatizability of the equational theory of shuffle (Q4645164) (← links)
- Metric Semantics and Full Abstractness for Action Refinement and Probabilistic Choice (Q4923369) (← links)
- Free shuffle algebras in language varieties extended abstract (Q5096327) (← links)
- Nonfinite axiomatizability of shuffle inequalities (Q5096740) (← links)
- On the semantics of durational actions (Q5958612) (← links)
