The following pages link to Communication and concurrency (Q3992568):
Displaying 50 items.
- On the greatest solutions to weakly linear systems of fuzzy relation inequalities and equations (Q622073) (← links)
- On the expressiveness and decidability of higher-order process calculi (Q627133) (← links)
- Probabilistic contracts: a compositional reasoning methodology for the design of systems with stochastic and/or non-deterministic aspects (Q633299) (← links)
- Generalising Conduché's theorem (Q633801) (← links)
- Totality in arena games (Q636307) (← links)
- Timed mobility in process algebra and Petri nets (Q638567) (← links)
- Structural operational semantics through context-dependent behaviour (Q638568) (← links)
- Thread algebra for poly-threading (Q640299) (← links)
- A timed calculus for wireless systems (Q650891) (← links)
- Hardness of preorder checking for basic formalisms (Q650916) (← links)
- Equivalences for a biological process algebra (Q652149) (← links)
- A knowledge-based analysis of global function computation (Q660991) (← links)
- Extensional Petri net (Q667521) (← links)
- Denotational linear time semantics and sequential composition (Q671406) (← links)
- Forum: A multiple-conclusion specification logic (Q671512) (← links)
- Modelling causality via action dependencies in branching time semantics (Q671596) (← links)
- \(\pi\)-calculus, internal mobility, and agent-passing calculi (Q671684) (← links)
- Metric completion versus ideal completion (Q672047) (← links)
- Models for concurrency: Towards a classification (Q672053) (← links)
- Locality and interleaving semantics in calculi for mobile processes (Q672123) (← links)
- From CML to its process algebra (Q672132) (← links)
- Probabilistic communicating processes (Q672230) (← links)
- A complete axiomatization of timed bisimulation for a class of timed regular behaviours (Q672231) (← links)
- Infinite normal forms for non-linear term rewriting systems (Q672235) (← links)
- Undecidability of bisimilarity for Petri nets and some related problems (Q672326) (← links)
- Location equivalence in a parametric setting (Q672708) (← links)
- A multiset semantics for the pi-calculus with replication (Q672867) (← links)
- Trapping mutual exclusion in the box calculus (Q672869) (← links)
- Petri nets and bisimulation (Q672873) (← links)
- Structural operational semantics for weak bisimulations (Q673123) (← links)
- On the implementation of concurrent calculi in net calculi: two case studies (Q673785) (← links)
- The weakest deadlock-preserving congruence (Q673911) (← links)
- Computable concurrent processes (Q673972) (← links)
- Deciding observational congruence of finite-state CCS expressions by rewriting (Q673974) (← links)
- Translations between modal logics of reactive systems (Q674003) (← links)
- A theory of processes with durational actions (Q674005) (← links)
- Symbolic bisimulations (Q674194) (← links)
- A process algebraic view of input/output automata (Q674195) (← links)
- Transition system specifications with negative premises (Q685387) (← links)
- Modal logics for mobile processes (Q685408) (← links)
- The expressive power of implicit specifications (Q685409) (← links)
- Universal axioms for bisimulations (Q685411) (← links)
- Observing localities (Q685414) (← links)
- Computational interpretations of linear logic (Q685430) (← links)
- Graph rewriting for a partial ordering semantics of concurrent constraints programming (Q685459) (← links)
- Algorithms for task allocation in ants. (A study of temporal polyethism: Theory) (Q688415) (← links)
- Communicating processes with value-passing and assignments (Q688827) (← links)
- A CCS-based investigation of deadlock in a multi-process electronic mail system (Q688829) (← links)
- Computation of the greatest simulations and bisimulations between fuzzy automata (Q690916) (← links)
- Approximate bisimulation: a bridge between computer science and control theory (Q693690) (← links)
