The following pages link to Communication and concurrency (Q3992568):
Displaying 50 items.
- First-order reasoning for higher-order concurrency (Q456466) (← links)
- Bisimilarity enforcing supervisory control for deterministic specifications (Q463845) (← links)
- Formal communication elimination and sequentialization equivalence proofs for distributed system models (Q466919) (← links)
- HYPE: hybrid modelling by composition of flows (Q470011) (← links)
- Threaded behavior protocols (Q470016) (← links)
- A calculus of trustworthy ad hoc networks (Q470043) (← links)
- Lattice-valued simulations for quantitative transition systems (Q473367) (← links)
- Model-checking process equivalences (Q477208) (← links)
- A ground-complete axiomatization of stateless bisimilarity over Linda (Q477631) (← links)
- Trace- and failure-based semantics for responsiveness (Q478516) (← links)
- On the tradeoff between compositionality and exactness in weak bisimilarity for integrated-time Markovian process calculi (Q481103) (← links)
- Monitoring and recovery for web service applications (Q488218) (← links)
- Reversible session-based pi-calculus (Q492908) (← links)
- Structural transformations for data-enriched real-time systems (Q493518) (← links)
- An algebraic theory for web service contracts (Q493534) (← links)
- Equivalence and generalization in a layered network model (Q494074) (← links)
- Polynomial time decision algorithms for probabilistic automata (Q498403) (← links)
- Distributed supervisory control of discrete-event systems with communication delay (Q503030) (← links)
- Rough approximations based on bisimulations (Q505252) (← links)
- A language-independent proof system for full program equivalence (Q510898) (← links)
- A language-based approach to modelling and analysis of Twitter interactions (Q511939) (← links)
- An empirical comparison of formalisms for modelling and analysis of dynamic reconfiguration of dependable systems (Q520240) (← links)
- A general account of coinduction up-to (Q523132) (← links)
- Mitigating covert channels based on analysis of the potential for communication (Q530557) (← links)
- Enabling synchronous and asynchronous communications in CSP for SOC (Q530849) (← links)
- Model-checking games for fixpoint logics with partial order models (Q532389) (← links)
- A semantic equivalence for Bio-PEPA based on discretisation of continuous values (Q533358) (← links)
- Bisimilarity control of partially observed nondeterministic discrete event systems and a test algorithm (Q534301) (← links)
- Encoding cryptographic primitives in a calculus with polyadic synchronisation (Q540687) (← links)
- Contexts, refinement and determinism (Q541213) (← links)
- Contracts for security adaptation (Q541291) (← links)
- On the axiomatizability of priority. II (Q549169) (← links)
- SOS rule formats for zero and unit elements (Q549170) (← links)
- Information hiding in probabilistic concurrent systems (Q549174) (← links)
- Interface theories for concurrency and data (Q549177) (← links)
- Derivation tree analysis for accelerated fixed-point computation (Q549189) (← links)
- Safe reasoning with logic LTS (Q549200) (← links)
- A randomized encoding of the \(\pi\)-calculus with mixed choice (Q555750) (← links)
- On quasi-open bisimulation (Q557789) (← links)
- Towards the hierarchical verification of reactive systems (Q596025) (← links)
- Models for name-passing processes: Interleaving and causal (Q598191) (← links)
- Bisimulation on speed: Worst-case efficiency (Q598200) (← links)
- Nested semantics over finite trees are equationally hard (Q598202) (← links)
- A comparison of semantic models for noninterference (Q604479) (← links)
- Weak bisimulation for probabilistic timed automata (Q606996) (← links)
- Compositional analysis for linear systems (Q609530) (← links)
- Translating FSP into LOTOS and networks of automata (Q613134) (← links)
- On the potential advantages of exploiting behavioural information for contract-based service discovery and composition (Q615893) (← links)
- Validation and verification of web services choreographies by using timed automata (Q615897) (← links)
- Nominal abstraction (Q617715) (← links)
