scientific article; zbMATH DE number 821282

No author found.

Publication date: 28 November 1995

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Collections of articles of miscellaneous specific interest (00B15) Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65) Continuous lattices and posets, applications (06B35) General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to computer science (68-00) Theory of numerations, effectively presented structures (03D45) Combinatory logic and lambda calculus (03B40)

Related Items (only showing first 100 items - show all)

History-preserving bisimilarity for higher-dimensional automata via open maps ⋮ A geometric view of partial order reduction ⋮ When does the class \([{\mathcal A} \longrightarrow {\mathcal B}\) consist of continuous domains?] ⋮ Declarative event based models of concurrency and refinement in psi-calculi ⋮ Axiomatizing GSOS with termination ⋮ Topological abstraction of higher-dimensional automata ⋮ Function spaces from coherent continuous domains to RB-domains ⋮ Syntax and consistent equation semantics of hybrid Chi ⋮ Categorical foundations for randomly timed automata ⋮ Branching time and orthogonal bisimulation equivalence ⋮ Paracategories. II: Adjunctions, fibrations and examples from probabilistic automata theory ⋮ Parametrized fixed points and their applications to session types ⋮ Transition systems from event structures revisited ⋮ Configuration structures, event structures and Petri nets ⋮ Instruction-level security analysis for information flow in stack-based assembly languages ⋮ Dialectica logical principles ⋮ Continuity in quantitative domains ⋮ Two categories of effective continuous cpos ⋮ ST-structures ⋮ Contextual equivalences in configuration structures and reversibility ⋮ Combine and conquer: relating BIP and Reo ⋮ Full abstraction for the second order subset of an Algol-like language ⋮ Section-retraction-pairs between fuzzy domains ⋮ Partial arithmetical data types of rational numbers and their equational specification ⋮ Models for name-passing processes: Interleaving and causal ⋮ Entailment-based actions for coordination ⋮ Algebraic processing of programming languages ⋮ Infinitary rewriting: meta-theory and convergence ⋮ Characterising spectra of equivalences for event structures, logically ⋮ Abstraction for concurrent objects ⋮ Representability of locally compact regular spaces by domains and formal spaces ⋮ The bounded-complete hull of an \(\alpha\)-space ⋮ A counterexample to Thiagarajan's conjecture on regular event structures ⋮ Revisiting timing in process algebra. ⋮ A stable non-interleaving early operational semantics for the pi-calculus ⋮ Causality analysis and fault ascription in component-based systems ⋮ Dialectica principles via Gödel doctrines ⋮ Undecidability of domino games and hhp-bisimilarity. ⋮ Transfer of trust in event-based reputation systems ⋮ Inverse-limit and topological aspects of abstract interpretation ⋮ Riemann and Edalat integration on domains. ⋮ Distance and routing labeling schemes for cube-free median graphs ⋮ Uniform and Bernoulli measures on the boundary of trace monoids ⋮ A faithful computational model of the real numbers ⋮ Models for concurrency: Towards a classification ⋮ An event structure semantics for general Petri nets ⋮ The wheel of rational numbers as an abstract data type ⋮ Causality versus true-concurrency ⋮ Domain representability of metric spaces ⋮ On the largest Cartesian closed category of stable domains ⋮ First-order logics of quasiary predicates ⋮ A partial solution to an open problem of Amadio and Curien ⋮ Conflict vs causality in event structures ⋮ Trust in event structures ⋮ Directed complete poset congruences ⋮ Hybrid process algebra ⋮ Models of computation for partial functions on the reals ⋮ Computable total functions on metric algebras, universal algebraic specifications and dynamical systems ⋮ On the resolution-based family of abstract argumentation semantics and its grounded instance ⋮ Distributed temporal logic for the analysis of security protocol models ⋮ Continuity of posets via Scott topology and sobrification ⋮ Models for a paraconsistent set theory ⋮ Measure extension theorems for \(T_{0}\)-spaces ⋮ Hausdorff coalgebras ⋮ Asynchronous games. II: The true concurrency of innocence ⋮ A logic for the stepwise development of reactive systems ⋮ Formal topological characterizations of various continuous domains ⋮ Reasoning about distributed information with infinitely many agents ⋮ Concurrent semantics for fusions: weak prime domains and connected event structures ⋮ A conservative look at operational semantics with variable binding ⋮ A domain-theoretic approach to computability on the real line ⋮ An algebraic characterization of independence of Petri net processes ⋮ Computations via Newtonian and relativistic kinematic systems ⋮ Unifying computers and dynamical systems using the theory of synchronous concurrent algorithms ⋮ Context-free event domains are recognizable ⋮ Weak confluence and \(\tau\)-inertness ⋮ Fuzzy complete lattices ⋮ On linear logic planning and concurrency ⋮ 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 ⋮ Minimisation of event structures ⋮ Domain representations of topological spaces ⋮ Universal coalgebra: A theory of systems ⋮ Molecular interaction. ⋮ Relational presheaves, change of base and weak simulation ⋮ Synchronization languages and rewriting systems ⋮ Extension of valuations on locally compact sober spaces ⋮ 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. ⋮ A categorical representation of algebraic domains based on variations of rough approximable concepts ⋮ Relating conflict-free stable transition and event models via redex families ⋮ Free and cofree acts of dcpo-monoids on directed complete posets.

This page was built for publication: