Pages that link to "Item:Q1067408"

The following pages link to Algebra of communicating processes with abstraction (Q1067408):

Displaying 50 items.

• Verification of \(\mathrm{EB}^3\) specifications using CADP (Q282110) (← links)
• Modelling and verifying the AODV routing protocol (Q324632) (← links)
• Combine and conquer: relating BIP and Reo (Q347371) (← links)
• Behavioural equivalences of a probabilistic pi-calculus (Q362281) (← links)
• An algebra of behavioural types (Q418153) (← links)
• Value-passing CCS with noisy channels (Q428864) (← links)
• Formal communication elimination and sequentialization equivalence proofs for distributed system models (Q466919) (← links)
• Diagnosis from scenarios (Q481349) (← links)
• Partially-commutative context-free processes: expressibility and tractability (Q532392) (← links)
• On cool congruence formats for weak bisimulations (Q549196) (← links)
• Fixing Zeno gaps (Q549197) (← links)
• \(\pi\)-calculus, internal mobility, and agent-passing calculi (Q671684) (← links)
• Universal axioms for bisimulations (Q685411) (← links)
• Observing localities (Q685414) (← links)
• Process algebra and constraint programming for modeling interactions in MAS (Q814899) (← links)
• An algebraic approach for modelling organisation, roles and contexts in MAS (Q814900) (← links)
• On process equivalence = equation solving in CCS (Q839034) (← links)
• Cones and foci: A mechanical framework for protocol verification (Q853730) (← links)
• Preferential choice and coordination conditions (Q864506) (← links)
• An abstract interpretation toolkit for \(\mu\)CRL (Q883139) (← links)
• Revisiting sequential composition in process calculi (Q890611) (← links)
• Product line process theory (Q898612) (← links)
• A calculus and logic of bunched resources and processes (Q906271) (← links)
• Issues in the design of a parallel object-oriented language (Q909434) (← links)
• Algebraic specification of concurrent systems (Q914405) (← links)
• CSP is a retract of CCS (Q960852) (← links)
• Computing with actions and communications (Q998092) (← links)
• The compression structure of a process (Q1044743) (← links)
• Specification-oriented semantics for communicating processes (Q1060838) (← links)
• Algebra of communicating processes with abstraction (Q1067408) (← links)
• On the consistency of Koomen's fair abstraction rule (Q1090103) (← links)
• Rewriting with a nondeterministic choice operator (Q1096383) (← links)
• Algebraic solutions to recursion schemes (Q1098617) (← links)
• Unification problems with one-sided distributivity (Q1099650) (← links)
• Global renaming operators in concrete process algebra (Q1106660) (← links)
• Transition systems, metric spaces and ready sets in the semantics of uniform concurrency (Q1107303) (← links)
• An incompleteness result in process algebra (Q1113665) (← links)
• The equivalence in the DCP model (Q1177152) (← links)
• \(\tau\)-bisimulations and full abstraction for refinement of actions (Q1183474) (← links)
• A compositional protocol verification using relativized bisimulation (Q1193593) (← links)
• A calculus of mobile processes. I (Q1198548) (← links)
• Enriched categorical semantics for distributed calculi (Q1208210) (← links)
• From algebra to operational semantics (Q1209325) (← links)
• TIC: a tImed calculus (Q1261314) (← links)
• LOTOS extended with probabilistic behaviours (Q1261318) (← links)
• A formal axiomatization for alphabet reasoning with parametrized processes (Q1271852) (← links)
• Example verifications using alphabet axioms (Q1271853) (← links)
• A decision algorithm for distributive unification (Q1275018) (← links)
• A theory of processes with localities (Q1329198) (← links)
• Automatizing parametric reasoning on distributed concurrent systems (Q1346610) (← links)