The following pages link to (Q4857386):
Displaying 50 items.
- Free and cofree acts of dcpo-monoids on directed complete posets. (Q262979) (← links)
- History-preserving bisimilarity for higher-dimensional automata via open maps (Q265804) (← links)
- A geometric view of partial order reduction (Q265807) (← links)
- Declarative event based models of concurrency and refinement in psi-calculi (Q272301) (← links)
- Topological abstraction of higher-dimensional automata (Q278749) (← links)
- Function spaces from coherent continuous domains to RB-domains (Q281709) (← links)
- Transition systems from event structures revisited (Q293333) (← links)
- ST-structures (Q338620) (← links)
- Contextual equivalences in configuration structures and reversibility (Q347363) (← links)
- Combine and conquer: relating BIP and Reo (Q347371) (← links)
- Transfer of trust in event-based reputation systems (Q418797) (← links)
- Inverse-limit and topological aspects of abstract interpretation (Q418811) (← links)
- Uniform and Bernoulli measures on the boundary of trace monoids (Q491977) (← links)
- On the largest Cartesian closed category of stable domains (Q517047) (← links)
- On the resolution-based family of abstract argumentation semantics and its grounded instance (Q543626) (← links)
- Distributed temporal logic for the analysis of security protocol models (Q549724) (← links)
- Models for name-passing processes: Interleaving and causal (Q598191) (← links)
- Abstraction for concurrent objects (Q615951) (← links)
- A faithful computational model of the real numbers (Q671999) (← links)
- Models for concurrency: Towards a classification (Q672053) (← links)
- An event structure semantics for general Petri nets (Q672871) (← links)
- Domain representability of metric spaces (Q674414) (← links)
- Configuration structures, event structures and Petri nets (Q843106) (← links)
- Two categories of effective continuous cpos (Q854182) (← links)
- Section-retraction-pairs between fuzzy domains (Q868288) (← links)
- Infinitary rewriting: meta-theory and convergence (Q884993) (← links)
- Formal topological characterizations of various continuous domains (Q1004687) (← links)
- An algebraic characterization of independence of Petri net processes (Q1028983) (← links)
- Computations via Newtonian and relativistic kinematic systems (Q1036523) (← links)
- Unifying computers and dynamical systems using the theory of synchronous concurrent algorithms (Q1036533) (← links)
- Fuzzy complete lattices (Q1040912) (← links)
- On linear logic planning and concurrency (Q1041042) (← links)
- Entailment-based actions for coordination (Q1127518) (← links)
- Algebraic processing of programming languages (Q1129126) (← links)
- A conservative look at operational semantics with variable binding (Q1273877) (← links)
- A domain-theoretic approach to computability on the real line (Q1274807) (← links)
- Context-free event domains are recognizable (Q1286370) (← links)
- Effective domain representations of \({\mathcal H}(X)\), the space of compact subsets (Q1292396) (← links)
- Computable Banach spaces via domain theory (Q1292403) (← links)
- Concrete models of computation for topological algebras (Q1292413) (← links)
- Computation by `While' programs on topological partial algebras (Q1292414) (← links)
- Computation on metric spaces via domain theory (Q1295303) (← links)
- Full abstraction for the second order subset of an Algol-like language (Q1369235) (← links)
- Representability of locally compact regular spaces by domains and formal spaces (Q1391747) (← links)
- The bounded-complete hull of an \(\alpha\)-space (Q1392140) (← links)
- Revisiting timing in process algebra. (Q1394990) (← links)
- Undecidability of domino games and hhp-bisimilarity. (Q1401953) (← links)
- Riemann and Edalat integration on domains. (Q1427783) (← links)
- Weak confluence and \(\tau\)-inertness (Q1575263) (← links)
- Domain representations of topological spaces (Q1583255) (← links)
