Pages that link to "Item:Q1148667"

The following pages link to A calculus of communicating systems (Q1148667):

Displaying 50 items.

• Weak bisimulations for fuzzy automata (Q279375) (← links)
• Structural similarity: spectral methods for relaxed blockmodeling (Q286617) (← links)
• A characterization of finitary bisimulation (Q287256) (← links)
• Transition systems from event structures revisited (Q293333) (← links)
• Developments in concurrent Kleene algebra (Q299202) (← links)
• Concurrent abstract state machines (Q303691) (← links)
• Formal modelling and verification of GALS systems using GRL and CADP (Q315303) (← links)
• On the diversity of asynchronous communication (Q315311) (← links)
• Two-thirds simulation indexes and modal logic characterization (Q352098) (← links)
• Behavioural equivalences of a probabilistic pi-calculus (Q362281) (← links)
• Testing probabilistic equivalence through reinforcement learning (Q383369) (← links)
• Tackling continuous state-space explosion in a Markovian process algebra (Q387988) (← links)
• Deciding equivalence-based properties using constraint solving (Q391121) (← links)
• A cylinder computation model for many-core parallel computing (Q391222) (← links)
• Model of distributed computing system operation with time (Q395266) (← links)
• An algebraic theory of interface automata (Q402131) (← links)
• Projection approaches to process mining using region-based techniques (Q408692) (← links)
• Bisimulations for fuzzy automata (Q423147) (← links)
• Value-passing CCS with noisy channels (Q428864) (← links)
• A generic framework for \(n\)-protocol compatibility checking (Q433347) (← links)
• Active learning of nondeterministic finite state machines (Q459826) (← links)
• Formal communication elimination and sequentialization equivalence proofs for distributed system models (Q466919) (← links)
• A calculus of quality for robustness against unreliable communication (Q492911) (← links)
• An algebraic theory for web service contracts (Q493534) (← links)
• Emergence of universal global behavior from reversible local transitions in asynchronous systems (Q507745) (← links)
• Mitigating covert channels based on analysis of the potential for communication (Q530557) (← links)
• Network-conscious \(\pi\)-calculus -- a model of Pastry (Q530841) (← links)
• Simulation refinement for concurrency verification (Q541209) (← links)
• Building distributed controllers for systems with priorities (Q541297) (← links)
• Concurrent Kleene algebra and its foundations (Q549679) (← links)
• Measuring the confinement of probabilistic systems (Q557887) (← links)
• Modal logics for communicating systems (Q578896) (← links)
• Prespecification in data refinement (Q578901) (← links)
• Refusal testing (Q580961) (← links)
• An intensional characterization of the largest bisimulation (Q580963) (← links)
• Observation equivalence as a testing equivalence (Q580965) (← links)
• Fixed point equations with parameters in the projective model (Q580971) (← links)
• Step failures semantics and a complete proof system (Q582133) (← links)
• Strong normalisation in the \(\pi\)-calculus (Q598201) (← links)
• Symmetries, local names and dynamic (de)-allocation of names (Q618165) (← links)
• On the greatest solutions to weakly linear systems of fuzzy relation inequalities and equations (Q622073) (← links)
• Coalgebras in functional programming and type theory (Q639643) (← links)
• Confluence for process verification (Q672042) (← links)
• Structural operational semantics for weak bisimulations (Q673123) (← links)
• Compilation of the ELECTRE reactive language into finite transition systems (Q673127) (← links)
• Late and early semantics coincide for testing (Q673146) (← links)
• Deciding observational congruence of finite-state CCS expressions by rewriting (Q673974) (← links)
• Translations between modal logics of reactive systems (Q674003) (← links)
• Logical characterizations of simulation and bisimulation for fuzzy transition systems (Q679804) (← links)
• Model-based testing of probabilistic systems (Q682363) (← links)