The following pages link to (Q3883467):
Displaying 50 items.
- Modelling and analysing neural networks using a hybrid process algebra (Q264526) (← links)
- Bounded situation calculus action theories (Q286407) (← links)
- A logic of separating modalities (Q290917) (← links)
- Lattice properties of congruences for stochastic relations (Q424543) (← links)
- Program equivalence in a simple language with state (Q456473) (← links)
- PLQP \& Company: decidable logics for quantum algorithms (Q472733) (← links)
- Rough approximations based on bisimulations (Q505252) (← links)
- A linear translation from CTL\(^*\) to the first-order modal \(\mu \)-calculus (Q549180) (← links)
- Expressive logics for coalgebras via terminal sequence induction (Q558417) (← links)
- Refusal testing (Q580961) (← links)
- Observation equivalence as a testing equivalence (Q580965) (← links)
- Encapsulating deontic and branching time specifications (Q714879) (← links)
- Algèbre de processus et synchronisation (Q789894) (← links)
- A fair calculus of communicating systems (Q793508) (← links)
- A logical characterization of observation equivalence (Q802306) (← links)
- A calculus and logic of bunched resources and processes (Q906271) (← links)
- Reasoning about networks with many identical finite state processes (Q921983) (← links)
- On the complexity of checking semantic equivalences between pushdown processes and finite-state processes (Q988552) (← links)
- Kleisli morphisms and randomized congruences for the Giry monad (Q995624) (← links)
- A complete inference system for a class of regular behaviours (Q1057072) (← links)
- A proof-theoretic characterization of observational equivalence (Q1060006) (← links)
- On powerdomains and modality (Q1067409) (← links)
- Merging regular processes by means of fixed-point theory (Q1082070) (← links)
- About fair asynchrony (Q1085603) (← links)
- A context dependent equivalence between processes (Q1088404) (← links)
- Characterizing finite Kripke structures in propositional temporal logic (Q1123183) (← links)
- Partial abstract types (Q1169290) (← links)
- Experimenting with process equivalence (Q1194327) (← links)
- Synchronization trees (Q1348524) (← links)
- Testing equivalences for processes (Q1348526) (← links)
- Trees and semantics (Q1391740) (← links)
- Undecidable problems in unreliable computations. (Q1401309) (← links)
- Mathematical modal logic: A view of its evolution (Q1422628) (← links)
- A formalized general theory of syntax with bindings (Q1687739) (← links)
- Using coalgebras and the Giry monad for interpreting game logics -- a tutorial (Q1712599) (← links)
- Second-order propositional modal logic: expressiveness and completeness results (Q1731834) (← links)
- A brief history of process algebra (Q1781995) (← links)
- A formalized general theory of syntax with bindings: extended version (Q1984791) (← links)
- A logical and graphical framework for reaction systems (Q2034775) (← links)
- A game for linear-time-branching-time spectroscopy (Q2044187) (← links)
- A process algebraic approach to reaction systems (Q2044947) (← links)
- Saturated Kripke structures as Vietoris coalgebras (Q2104479) (← links)
- Bisimulation for Feller-Dynkin processes (Q2133163) (← links)
- Trust evidence logic (Q2146059) (← links)
- Characteristic invariants in Hennessy-Milner logic (Q2182678) (← links)
- Strategies, model checking and branching-time properties in Maude (Q2239275) (← links)
- Expressiveness of probabilistic modal logics: a gradual approach (Q2417857) (← links)
- A description based on languages of the final non-deterministic automaton (Q2449045) (← links)
- A modal proof theory for final polynomial coalgebras (Q2503317) (← links)
- Final coalgebras and the Hennessy-Milner property (Q2576941) (← links)
