The following pages link to Acceptance trees (Q3771649):
Displaying 29 items.
- A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences (Q384933) (← links)
- Communicating processes with value-passing and assignments (Q688827) (← links)
- Stepwise development of process-algebraic specifications in decorated trace semantics (Q816202) (← links)
- CCS expressions, finite state processes, and three problems of equivalence (Q918211) (← links)
- Contract-based discovery of Web services modulo simple orchestrators (Q987977) (← links)
- Specification-oriented semantics for communicating processes (Q1060838) (← links)
- An algebraic theory of fair asynchronous communicating processes (Q1088403) (← links)
- Algebraic solutions to recursion schemes (Q1098617) (← links)
- Type theory and concurrency (Q1124322) (← links)
- The equivalence in the DCP model (Q1177152) (← links)
- A proof system for communicating processes with value-passing (Q1179808) (← links)
- A complete axiomatisation for observational congruence of finite-state behaviours (Q1263984) (← links)
- An invitation to friendly testing (Q1273070) (← links)
- Semantics for finite delay (Q1392281) (← links)
- Algebraic theory of probabilistic processes. (Q1400293) (← links)
- Linda-based applicative and imperative process algebras (Q1575260) (← links)
- Compositionality for quantitative specifications (Q1797783) (← links)
- Strong fairness and full abstraction for communicating processes (Q1854396) (← links)
- Logical vs. behavioural specifications (Q2304534) (← links)
- Denotational fixed-point semantics for constructive scheduling of synchronous concurrency (Q2350494) (← links)
- Testing equivalence as a bisimulation equivalence (Q2366163) (← links)
- On the Unification of Process Semantics: Observational Semantics (Q3599079) (← links)
- (Q4222750) (← links)
- Compositionality in state space verification methods (Q4633153) (← links)
- Testing for a conformance relation based on acceptance (Q5044759) (← links)
- A survey of modal logics characterising behavioural equivalences for non-deterministic and stochastic systems (Q5458058) (← links)
- Termination, deadlock and divergence (Q5887521) (← links)
- A fully abstract denotational model for observational precongruence (Q5940916) (← links)
- Algebraic characterizations of trace and decorated trace equivalences over tree-like structures (Q5940926) (← links)
