The following pages link to Communication and concurrency (Q3992568):
Displaying 50 items.
- Revisiting sequential composition in process calculi (Q890611) (← links)
- Behavioural equivalences for coalgebras with unobservable moves (Q890618) (← links)
- Axiomatizing Lüttgen \& Vogler's ready simulation for finite processes in \(\mathrm{CLL}_{R}\) (Q893593) (← links)
- Generating symbolic traces in the insertion modeling system (Q895075) (← links)
- Theory of interaction (Q896903) (← links)
- Unique parallel decomposition in branching and weak bisimulation semantics (Q896916) (← links)
- On the existence and decidability of unique decompositions of processes in the applied \(\pi\)-calculus (Q896922) (← links)
- Product line process theory (Q898612) (← links)
- Nondeterministic automata: equivalence, bisimulations, and uniform relations (Q903611) (← links)
- A calculus and logic of bunched resources and processes (Q906271) (← links)
- A functional programming approach to the specification and verification of concurrent systems (Q909439) (← links)
- Automated analysis of mutual exclusion algorithms using CCS (Q911263) (← links)
- A reification calculus for model-oriented software specification (Q911753) (← links)
- SnS can be modally characterized (Q914397) (← links)
- Interpreting one concurrent calculus in another (Q915484) (← links)
- A model of reconfiguration in communicating sequential processes (Q918723) (← links)
- Defining, analysing and implementing communication protocols using attribute grammars (Q919803) (← links)
- Modeling spiking neural networks (Q924684) (← links)
- On finite alphabets and infinite bases (Q924717) (← links)
- Using bisimulation proof techniques for the analysis of distributed abstract machines (Q935472) (← links)
- A timed semantics of Orc (Q935476) (← links)
- Approximate simulation relations for hybrid systems (Q939013) (← links)
- Bisimulations in calculi modelling membranes (Q939161) (← links)
- A compositional Petri net translation of general \(\pi\)-calculus terms (Q939164) (← links)
- Pathway analysis for BioAmbients (Q953532) (← links)
- A simple calculus for proteins and cells (Q953549) (← links)
- On the decidability and complexity of the structural congruence for beta-binders (Q953553) (← links)
- On the expressiveness of interaction (Q960859) (← links)
- Combinatorics of labelling in higher-dimensional automata (Q960860) (← links)
- Slicing for modern program structures: a theory for eliminating irrelevant loops (Q963331) (← links)
- An operational semantics for a calculus for wireless systems (Q964487) (← links)
- Typed event structures and the linear \(\pi \)-calculus (Q964488) (← links)
- Categorical simulations (Q964545) (← links)
- On the observational theory of the CPS-calculus (Q968276) (← links)
- Algebra and logic for access control (Q968301) (← links)
- Lifting non-finite axiomatizability results to extensions of process algebras (Q969643) (← links)
- On metrics for probabilistic systems: definitions and algorithms (Q971582) (← links)
- An exact correspondence between a typed pi-calculus and polarised proof-nets (Q974114) (← links)
- A precongruence format for should testing preorder (Q974134) (← links)
- The equational theory of prebisimilarity over basic CCS with divergence (Q975471) (← links)
- On the expressibility of priority (Q975534) (← links)
- Ready to preorder: the case of weak process semantics (Q975539) (← links)
- Is observational congruence on \(\mu \)-expressions axiomatisable in equational Horn logic? (Q979076) (← links)
- On the complexity of checking semantic equivalences between pushdown processes and finite-state processes (Q988552) (← links)
- Ready simulation for concurrency: it's logical! (Q988555) (← links)
- Fuzzy relation equations and reduction of fuzzy automata (Q988575) (← links)
- Partial model checking via abstract interpretation (Q990121) (← links)
- On the semantics of communicating hardware processes and their translation into LOTOS for the verification of asynchronous circuits with CADP (Q1001805) (← links)
- Approximately bisimilar symbolic models for nonlinear control systems (Q1004115) (← links)
- Synthesising CCS bisimulation using graph rewriting (Q1004288) (← links)
