The following pages link to (Q3750113):
Displaying 18 items.
- Combining data type and recursive process specifications using projection algebras (Q910188) (← links)
- Algebraic specification of concurrent systems (Q914405) (← links)
- A logic for the specification and proof of regular controllable processes of CCS (Q1080653) (← links)
- Bisimulations and abstraction homomorphisms (Q1089791) (← links)
- Deadlock and fairness in morphisms of transition systems (Q1105379) (← links)
- Transition systems, metric spaces and ready sets in the semantics of uniform concurrency (Q1107303) (← links)
- A state-based approach to communicating processes (Q1112600) (← links)
- Concurrent transition systems (Q1119395) (← links)
- Concurrency and atomicity (Q1124366) (← links)
- Towards a foundation for semantics in complete metric spaces (Q1173767) (← links)
- A note on the characterization of weak bisimulation congruence in CCS (Q1184736) (← links)
- Unfolding and fixpoint semantics of concurrent constraint logic programs (Q1200981) (← links)
- A complete axiomatisation for observational congruence of finite-state behaviours (Q1263984) (← links)
- Nonexpressibility of fairness and signaling (Q1309386) (← links)
- On the concurrent computational content of intermediate logics (Q1989344) (← links)
- A domain equation for bisimulation (Q2639646) (← links)
- Fairness and regularity for SCCS processes (Q3816967) (← links)
- Causal Unfoldings (Q5875372) (← links)
