The following pages link to (Q4248252):
Displaying 50 items.
- Modelling and analysing neural networks using a hybrid process algebra (Q264526) (← links)
- Modelling and verification of weighted spiking neural systems (Q264538) (← links)
- Reversibility in the higher-order \(\pi\)-calculus (Q264996) (← links)
- Bisimilar and logically equivalent programs in PDL (Q281144) (← links)
- A strand graph semantics for DNA-based computation (Q288814) (← links)
- Concurrent abstract state machines (Q303691) (← links)
- On the diversity of asynchronous communication (Q315311) (← links)
- A verifiable low-level concurrent programming model based on colored Petri nets (Q350966) (← links)
- Behavioural equivalences of a probabilistic pi-calculus (Q362281) (← links)
- Using bigraphs to model topological graphs embedded in orientable surfaces (Q383361) (← links)
- A cylinder computation model for many-core parallel computing (Q391222) (← links)
- Divide and congruence: from decomposition of modal formulas to preservation of branching and \(\eta \)-bisimilarity (Q418189) (← links)
- Processes in space (Q418828) (← links)
- Bisimulations for fuzzy automata (Q423147) (← links)
- Value-passing CCS with noisy channels (Q428864) (← links)
- Finite abstractions for hybrid systems with stable continuous dynamics (Q434462) (← links)
- A formal model for service-oriented interactions (Q436383) (← links)
- Typing access control and secure information flow in sessions (Q462485) (← links)
- Bounded memory Dolev-Yao adversaries in collaborative systems (Q462499) (← links)
- Constructing and visualizing chemical reaction networks from pi-calculus models (Q470031) (← links)
- Lattice-valued simulations for quantitative transition systems (Q473367) (← links)
- Semi-automated verification of security proofs of quantum cryptographic protocols (Q491263) (← links)
- A calculus of quality for robustness against unreliable communication (Q492911) (← links)
- Modeling ontology evolution with SetPi (Q497901) (← links)
- Rough approximations based on bisimulations (Q505252) (← links)
- An empirical comparison of formalisms for modelling and analysis of dynamic reconfiguration of dependable systems (Q520240) (← links)
- Design of a biomolecular device that executes process algebra (Q537851) (← links)
- Strand algebras for DNA computing (Q537852) (← links)
- Channel-based coordination via constraint satisfaction (Q541681) (← links)
- An improved algorithm for determinization of weighted and fuzzy automata (Q543822) (← links)
- Information hiding in probabilistic concurrent systems (Q549174) (← links)
- A fully abstract may testing semantics for concurrent objects (Q557787) (← links)
- Weakening the perfect encryption assumption in Dolev-Yao adversaries (Q557896) (← links)
- simpA: an agent-oriented approach for programming concurrent applications on top of Java (Q608358) (← links)
- On the potential advantages of exploiting behavioural information for contract-based service discovery and composition (Q615893) (← links)
- A bisimulation-like proof method for contextual properties in untyped \(\lambda \)-calculus with references and deallocation (Q615949) (← links)
- Nominal abstraction (Q617715) (← links)
- A pure labeled transition semantics for the applied pi calculus (Q621583) (← links)
- On the greatest solutions to weakly linear systems of fuzzy relation inequalities and equations (Q622073) (← links)
- Timed mobility in process algebra and Petri nets (Q638567) (← links)
- \textsf{CaPiTo}: Protocol stacks for services (Q640297) (← links)
- Characterizing contextual equivalence in calculi with passivation (Q651309) (← links)
- Computation of the greatest simulations and bisimulations between fuzzy automata (Q690916) (← links)
- Conversation protocols: a formalism for specification and verification of reactive electronic services (Q703491) (← links)
- Fundamentals of session types (Q714736) (← links)
- The calculus of context-aware ambients (Q716296) (← links)
- Reduction of fuzzy automata by means of fuzzy quasi-orders (Q726556) (← links)
- Relating state-based and process-based concurrency through linear logic (full-version) (Q731895) (← links)
- The computational status of physics (Q734210) (← links)
- Towards verification of computation orchestration (Q736807) (← links)
