scientific article
From MaRDI portal
Publication:3857704
zbMath0423.68012MaRDI QIDQ3857704
Publication date: 1979
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
fixed pointstopologyinfinite computationssemantics of recursive programscontext free grammars over infinite wordsconvergency of computationsrecursive program schemes generating algebraic infinite trees
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Theory of computing (68Q99)
Related Items
Merging regular processes by means of fixed-point theory, The greatest fixed-points and rational omega-tree languages, A hierarchy of domains for real-time distributed computing, De Bakker-Zucker processes revisited, Infinite streams and finite observations in the semantics of uniform concurrency, Linear time and branching time semantics for recursion with merge, On some structural properties of a subclass of \(\infty\)-regular languages, Subword topology, A domain equation for bisimulation, On a subclass of \(\infty\)-regular languages, Applications of compactness in the Smyth powerdomain of streams, Transition systems, metric spaces and ready sets in the semantics of uniform concurrency, Designing equivalent semantic models for process creation, A timed model for communicating sequential processes, Semantics of production systems, On the uniqueness of fixed points of endofunctors in a category of complete metric spaces, Continuous monoids and yields of infinite trees, The contraction property is sufficient to guarantee the uniqueness of fixed points of endofunctors in a category of complete metric spaces, Terminal metric spaces of finitely branching and image finite linear processes, Trees and semantics, Limiting semantics of numerical programs, Contractions in comparing concurrency semantics, On infinite words obtained by iterating morphisms, A continuous semantics for unbounded nondeterminism, Unnamed Item, Domain theory in logical form, Generalizing finiteness conditions of labelled transition systems, Four domains for concurrency, Contraction algebras and unification of (infinite) terms, Metric semantics for true concurrent real time, An introduction to metric semantics: Operational and denotational models for programming and specification languages, Unnamed Item, Automata on infinite objects and their applications to logic and programming, Underspecification for a simple process algebra of recursive processes., Whither semantics?, Topology on words, A fixed point approach to parallel discrete event simulation, Nivat's processing systems: decision problems related to protection and synchronization, Infinite arrays and infinite computations, Some remarks on non-algebraic adherences, On infinite computations in denotational semantics, Separately continuous algebras, Infinitary tree languages recognized by \(\omega\)-automata, Infinite arrays and controlled deterministic table 0L array systems, Automates boustrophédon et mots infinis, Line Languages, Comparative semantics for flow of control in logic programming without logic, On infinite words obtained by selective substitution grammars, The comparison of a cpo-based semantics with a cms-based semantics for \(CSP\), A short scientific biography of Maurice Nivat, Bisimulation indexes and their applications, Infinite Lyndon words
