Pages that link to "Item:Q2639646"
From MaRDI portal
The following pages link to A domain equation for bisimulation (Q2639646):
Displaying 50 items.
- A characterization of finitary bisimulation (Q287256) (← links)
- Stone coalgebras (Q703523) (← links)
- Ready to preorder: an algebraic and general proof (Q843212) (← links)
- A logical approach to stable domains (Q859843) (← links)
- An irregular filter model (Q930872) (← links)
- Lifting non-finite axiomatizability results to extensions of process algebras (Q969643) (← links)
- The equational theory of prebisimilarity over basic CCS with divergence (Q975471) (← links)
- Duality for modal \(\mu\)-logics (Q1128984) (← links)
- A fixpoint approach to finite delay and fairness (Q1129259) (← links)
- Full abstractness for a functional/concurrent language with higher-order value-passing (Q1271466) (← links)
- A general theory of action languages (Q1286273) (← links)
- Quantitative semantics, topology, and possibility measures (Q1295211) (← links)
- Topology, domain theory and theoretical computer science (Q1295216) (← links)
- A co-induction principle for recursively defined domains (Q1318702) (← links)
- Plain CHOCS. A second generation calculus for higher order processes (Q1323361) (← links)
- Stone duality and representation of stable domain (Q1368465) (← links)
- The connection between initial and unique solutions of domain equations in the partial order and metric approach (Q1377300) (← links)
- Trees and semantics (Q1391740) (← links)
- A semantic theory for value-passing processes based on the late approach (Q1398368) (← links)
- Approximating labelled Markov processes (Q1398379) (← links)
- A fully abstract model for the \(\pi\)-calculus. (Q1400720) (← links)
- Localic sup-lattices and tropological systems. (Q1427786) (← links)
- Towards a unified view of bisimulation: A comparative study (Q1575240) (← links)
- Universal coalgebra: A theory of systems (Q1583483) (← links)
- A fully abstract denotational semantics for the \(\pi\)-calculus (Q1605174) (← links)
- Distinguishing between communicating transactions (Q1706141) (← links)
- A category of compositional domain-models for separable Stone spaces. (Q1853606) (← links)
- Toward an infinitary logic of domains: Abramsky logic for transition systems (Q1854320) (← links)
- Bisimilarity of open terms. (Q1854331) (← links)
- Corrigendum: ``A domain equation for bisimulation'' by S. Abramsky (Q1854414) (← links)
- Adding recursive constructs to bialgebraic semantics (Q1878714) (← links)
- A unified rule format for bounded nondeterminism in SOS with terms as labels (Q2403821) (← links)
- A static analysis of cryptographic processes: the denotational approach (Q2484412) (← links)
- Combining effects: sum and tensor (Q2500483) (← links)
- Labelled Markov Processes as Generalised Stochastic Relations (Q2864159) (← links)
- Systems Modelling via Resources and Processes: Philosophy, Calculus, Semantics, and Logic (Q2864163) (← links)
- Weak Bisimilarity Coalgebraically (Q2888485) (← links)
- Relating Coalgebraic Notions of Bisimulation (Q2888487) (← links)
- Connection between logical and algebraic approaches to concurrent systems (Q3060196) (← links)
- MODELLING AND ANALYSIS OF PKI-BASED SYSTEMS USING PROCESS CALCULI (Q3444848) (← links)
- Processes as terms: non-well-founded models for bisimulation (Q4279257) (← links)
- Domain mu-calculus (Q4460689) (← links)
- Bialgebraic Semantics and Recursion (Q4917044) (← links)
- Continuous Domain Theory in Logical Form (Q4922080) (← links)
- Reasoning about higher-order processes (Q5096732) (← links)
- CPO models for a class of GSOS languages (Q5096748) (← links)
- Processes and hyperuniverses (Q5096893) (← links)
- A case study in programming coinductive proofs: Howe’s method (Q5236557) (← links)
- (Q5856409) (← links)
- A structural co-induction theorem (Q5890042) (← links)