The following pages link to Communication and concurrency (Q3992568):
Displaying 50 items.
- A hierarchy of probabilistic system types (Q703518) (← links)
- Turing machines, transition systems, and interaction (Q703844) (← links)
- On the computational complexity of bisimulation, redux (Q703845) (← links)
- Synchronous Kleene algebra (Q710676) (← links)
- A formal abstract framework for modelling and testing complex software systems (Q714878) (← links)
- Abstract reduction in directed model checking CCS processes (Q715051) (← links)
- Verification of reactive systems via instantiation of parameterised Boolean equation systems (Q716322) (← links)
- Behavioural and abstractor specifications revisited (Q724932) (← links)
- Reduction of fuzzy automata by means of fuzzy quasi-orders (Q726556) (← links)
- Machine structure oriented control code logic (Q731332) (← links)
- A general framework for architecture composability (Q736458) (← links)
- Test generation from state based use case models (Q736788) (← links)
- An operational semantics for object-oriented concepts based on the class hierarchy (Q736789) (← links)
- Towards verification of computation orchestration (Q736807) (← links)
- Relational concurrent refinement. III: Traces, partial relations and automata (Q736917) (← links)
- Bisimulation and divergence (Q750163) (← links)
- A note on the notation of recursion in process algebras (Q751295) (← links)
- Receptive process theory (Q758200) (← links)
- On the refinement of liveness properties of distributed systems (Q763239) (← links)
- A linear process-algebraic format with data for probabilistic automata (Q764285) (← links)
- Synthesis of secure adaptors (Q764381) (← links)
- Equivalence notions and model minimization in Markov decision processes (Q814474) (← links)
- Process-algebraic approaches for multi-agent systems: an overview (Q814895) (← links)
- Reduced models for efficient CCS verification (Q816205) (← links)
- Towards an algebraic theory of typed mobile processes (Q817843) (← links)
- Components as coalgebras: the refinement dimension (Q820141) (← links)
- Model independent approach to probabilistic models (Q831149) (← links)
- Latticed \(k\)-induction with an application to probabilistic programs (Q832288) (← links)
- On process equivalence = equation solving in CCS (Q839034) (← links)
- Probabilistic and nondeterministic aspects of anonymity (Q843094) (← links)
- Linearly bounded infinite graphs (Q852011) (← links)
- How to stop time stopping (Q855006) (← links)
- A calculus and logic of resources and processes (Q855007) (← links)
- \(\text{DELFIN}^+\): an efficient deadlock detection tool for CCS processes (Q856423) (← links)
- Bisimilarity is not finitely based over BPA with interrupt (Q860878) (← links)
- A core calculus for correlation in orchestration languages (Q861302) (← links)
- The SL synchronous language, revisited (Q864504) (← links)
- Duplication of constants in process algebra (Q864505) (← links)
- Preferential choice and coordination conditions (Q864506) (← links)
- Performance of pipelined asynchronous systems (Q864507) (← links)
- Fair testing (Q865623) (← links)
- Symbolic models for control systems (Q868433) (← links)
- Conjunction on processes: Full abstraction via ready-tree semantics (Q875513) (← links)
- Axiomatizations for probabilistic finite-state behaviors (Q875517) (← links)
- A bulk-synchronous parallel process algebra (Q875955) (← links)
- SOS formats and meta-theory: 20 years after (Q877025) (← links)
- Fair ambients (Q877172) (← links)
- A framework for verifying bit-level pipelined machines based on automated deduction and decision procedures (Q877828) (← links)
- Generating the syntactic and semantics graphs for a Markovian process algebra (Q879408) (← links)
- Synthesising correct concurrent runtime monitors (Q888412) (← links)
