Publication:4857386

zbMath0876.68001MaRDI QIDQ4857386

No author found.

Publication date: 28 November 1995

zbMATH Keywords

Mathematics Subject Classification ID

68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)

00B15: Collections of articles of miscellaneous specific interest

03B70: Logic in computer science

68Q55: Semantics in the theory of computing

68Q60: Specification and verification (program logics, model checking, etc.)

68Q65: Abstract data types; algebraic specification

06B35: Continuous lattices and posets, applications

68-00: General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to computer science

03D45: Theory of numerations, effectively presented structures

03B40: Combinatory logic and lambda calculus

Related Items

A coalgebraic presentation of structured transition systems, Inheritance of behavior, Real time process algebra with time-dependent conditions, Models for name-passing processes: Interleaving and causal, A faithful computational model of the real numbers, Models for concurrency: Towards a classification, An event structure semantics for general Petri nets, Domain representability of metric spaces, Two categories of effective continuous cpos, Section-retraction-pairs between fuzzy domains, Infinitary rewriting: meta-theory and convergence, Formal topological characterizations of various continuous domains, An algebraic characterization of independence of Petri net processes, Entailment-based actions for coordination, Algebraic processing of programming languages, A conservative look at operational semantics with variable binding, A domain-theoretic approach to computability on the real line, Context-free event domains are recognizable, Effective domain representations of \({\mathcal H}(X)\), the space of compact subsets, Computable Banach spaces via domain theory, Concrete models of computation for topological algebras, Computation by `While' programs on topological partial algebras, Computation on metric spaces via domain theory, Full abstraction for the second order subset of an Algol-like language, Representability of locally compact regular spaces by domains and formal spaces, The bounded-complete hull of an \(\alpha\)-space, Revisiting timing in process algebra., Undecidability of domino games and hhp-bisimilarity., Riemann and Edalat integration on domains., Weak confluence and \(\tau\)-inertness, Domain representations of topological spaces, Universal coalgebra: A theory of systems, CSP, partial automata, and coalgebras., Constructive design of a hierarchy of semantics of a transition system by abstract interpretation, Axiomatizing the subsumption and subword preorders on finite and infinite partial words, Bisimulation indexes and their applications, Impossible futures and determinism, Domain representations of partial functions, with applications to spatial objects and constructive volume geometry., Foundation of a computable solid modelling., Relating conflict-free stable transition and event models via redex families, Hybrid process algebra, Computable total functions on metric algebras, universal algebraic specifications and dynamical systems, Models for a paraconsistent set theory, Measure extension theorems for \(T_{0}\)-spaces, Molecular interaction., Synchronization languages and rewriting systems, Extension of valuations on locally compact sober spaces, When does the class \([{\mathcal A} \longrightarrow {\mathcal B}\) consist of continuous domains?], Axiomatizing GSOS with termination, Categorical foundations for randomly timed automata, Branching time and orthogonal bisimulation equivalence, Paracategories. II: Adjunctions, fibrations and examples from probabilistic automata theory, Syntax and consistent equation semantics of hybrid Chi, Instruction-level security analysis for information flow in stack-based assembly languages, Continuity in quantitative domains, Causality versus true-concurrency, Continuity of posets via Scott topology and sobrification, Asynchronous games. II: The true concurrency of innocence, Programming Experimental Procedures for Newtonian Kinematic Machines