scientific article
From MaRDI portal
Publication:3795195
zbMath0649.68019MaRDI QIDQ3795195
Eugene W. Stark, Prakash Panangaden
Publication date: 1988
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
dataflow networksnetworks of communicating processesfair mergeindeterminate behaviorreasoning about concurrent systemsmonotone networksindeterminate branchingmonotone port automata
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Theory of operating systems (68N25)
Related Items (20)
A generalized Kahn Principle for abstract asynchronous networks ⋮ Connections between a concrete and an abstract model of concurrent systems ⋮ A category-theoretic semantics for unbounded indeterminacy ⋮ From Sequential Specifications to Eventual Consistency ⋮ Labelled domains and automata with concurrency ⋮ Fairness, Resources, and Separation ⋮ Concurrent transition systems ⋮ An operator net model for distributed systems ⋮ Towards a complete hierarchy of compositional dataflow models ⋮ Compositional relational semantics for indeterminate dataflow networks ⋮ From domains to automata with concurrency ⋮ A kleene theorem for recognizable languages over concurrency monoids ⋮ The expressive power of delay operators in SCCS ⋮ Recognizable languages in concurrency monoids ⋮ The expressive power of indeterminate dataflow primitives ⋮ Turing machines, transition systems, and interaction ⋮ The expressive power of delay operators in SCCS ⋮ Representation of computations in concurrent automata by dependence orders ⋮ A proof of the Kahn principle for input/output automata ⋮ Nonexpressibility of fairness and signaling
This page was built for publication:
