scientific article
From MaRDI portal
Publication:4054644
zbMath0299.68007MaRDI QIDQ4054644
Publication date: 1974
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (98)
Partial metric monoids and semivaluation spaces ⋮ Dataflow computing and Eager and Lazy evaluations ⋮ A model and temporal proof system for networks of processes ⋮ A theory for nondeterminism, parallelism, communication, and concurrency ⋮ A generalized Kahn Principle for abstract asynchronous networks ⋮ A fully abstract trace model for dataflow and asynchronous networks ⋮ Semantic Foundations for Deterministic Dataflow and Stream Processing ⋮ There is no fully abstract fixpoint semantics for non-deterministic languages with infinite computations ⋮ Parametrized fixed points and their applications to session types ⋮ Modeling concurrency with partial orders ⋮ Stability, sequentiality and demand driven evaluation in dataflow ⋮ Modeling for Verification ⋮ An algebra of processes ⋮ Fairness, Resources, and Separation ⋮ A Petri nets semantics for data flow networks ⋮ Productivity of stream definitions ⋮ Merged processes: a new condensed representation of Petri net behaviour ⋮ Scalable and structured scheduling ⋮ The SL synchronous language, revisited ⋮ Specification and refinement of networks of asynchronously communicating agents using the assumption/commitment paradigm ⋮ On schematological equivalence of partially interpreted dataflow networks ⋮ Concurrent transition systems ⋮ Linear dynamic Kahn networks are deterministic ⋮ Temporal analysis of data flow control systems ⋮ The Banach fixed point theorem in fuzzy quasi-metric spaces with application to the domain of words ⋮ On nets, algebras and modularity ⋮ Towards a complete hierarchy of compositional dataflow models ⋮ Compositional relational semantics for indeterminate dataflow networks ⋮ Hyperspaces of a weightable quasi-metric space: application to models in the theory of computation ⋮ Formal verification of synchronous data-flow program transformations toward certified compilers ⋮ Specification and verification of concurrent systems by causality and realizability ⋮ Fixed points of mappings with a contractive iterate at a point in partial metric spaces ⋮ Semantics of nondeterminism, concurrency, and communication ⋮ Programming with streams in Coq a case study: The Sieve of Eratosthenes ⋮ The temporal semantics of concurrent programs ⋮ An extensional treatment of dataflow deadlock ⋮ A generalized contraction principle with control functions on partial metric spaces ⋮ Applications of utility functions defined on quasi-metric spaces ⋮ DS-partial metric spaces and domain theory ⋮ Deadlock absence proofs for networks of communicating processes ⋮ Ordered fractal semigroups as a model of computation ⋮ A functional programming approach to the specification and verification of concurrent systems ⋮ Non-standard semantics of hybrid systems modelers ⋮ Modeling of complex systems. II: A minimalist and unified semantics for heterogeneous integrated systems ⋮ Equational reasoning about nondeterministic processes ⋮ Unnamed Item ⋮ Proposition de semantique denotationnelle pour des réseaux de processus avec opérateur de melange équitable ⋮ Unnamed Item ⋮ Irreducible fractal structures for Moran type theorems ⋮ Unnamed Item ⋮ Recursion equation sets computing logic programs ⋮ Fractal dimension for fractal structures: applications to the domain of words ⋮ Domain theory for concurrency ⋮ Connectedness and synchronization ⋮ An extensional fixed-point semantics for nondeterministic data flow ⋮ Clocks in dataflow languages ⋮ Specification and design of shared resource arbitration ⋮ An extensional treatment of lazy data flow deadlock ⋮ A denotational theory of synchronous reactive systems ⋮ Axiomatic treatment of processes with shared variables revisited ⋮ CPO semantics of timed interactive actor networks ⋮ The fixed-point theory of strictly causal functions ⋮ Network algebra in Java ⋮ Conversation protocols: a formalism for specification and verification of reactive electronic services ⋮ A functional model for describing and reasoning about time behaviour of computing systems ⋮ The algebra of stream processing functions ⋮ A coarse-grained reconfigurable computing architecture with loop self-pipelining ⋮ Parallelizing XML data-streaming workflows via MapReduce ⋮ Unnamed Item ⋮ Resource control for synchronous cooperative threads ⋮ A type-based analysis of causality loops in hybrid systems modelers ⋮ An algebraic theory for behavioral modeling and protocol synthesis in system design ⋮ Verification approach of Metropolis design framework for embedded systems ⋮ Toward an algebraic theory of systems ⋮ A Hoare logic for dynamic networks of asynchronously communicating deterministic processes ⋮ PASCAL in LCF: Semantics and examples of proof ⋮ Algebraic quantitative semantics for efficient online temporal monitoring ⋮ Actors without Directors: A Kahnian View of Heterogeneous Systems ⋮ Signal language to describe the interaction of parallel processes ⋮ Asynchronous sequential processes ⋮ A fixed point approach to parallel discrete event simulation ⋮ A fully abstract semantics for concurrent constraint programming ⋮ A proof of the Kahn principle for input/output automata ⋮ Message Sequence Charts in the Development Process — Roles and Limitations ⋮ Rethinking arithmetic for deep neural networks ⋮ Bicompleting weightable quasi-metric spaces and partial metric spaces ⋮ Non-interleaving Semantics with Causality for Nondeterministic Dataflow ⋮ Computing the behaviour of asynchronous processes ⋮ A linear-history semantics for languages for distributed programming ⋮ A proof of the determinacy property of the data flow schema ⋮ On the suitability of trace semantics for modular proofs of communicating processes ⋮ Event Structure Spans for Nondeterministic Dataflow ⋮ Reactive Concurrent Programming Revisited ⋮ Defining concurrent processes constructively ⋮ A model of concurrency with fair merge and full recursion ⋮ Denotational fixed-point semantics for constructive scheduling of synchronous concurrency ⋮ A denotational semantics and dataflow construction for logic programs ⋮ Automated analysis of fault-tolerance in distributed systems
This page was built for publication:
