scientific article; zbMATH DE number 795666
From MaRDI portal
Publication:4845486
zbMath0841.68042MaRDI QIDQ4845486
Publication date: 12 September 1995
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Abstract data types; algebraic specification (68Q65)
Related Items
Concurrent and maximally concurrent evolution of nonsequential systems ⋮ A timed model for communicating sequential processes ⋮ Nested semantics over finite trees are equationally hard ⋮ Nonaxiomatisability of equivalences over finite state processes ⋮ Concurrency and atomicity ⋮ Fully abstract semantics for higher order communicating systems ⋮ To every manifest domain a CSP expression -- a rôle for mereology in computer science ⋮ Retracing some paths in process algebra ⋮ On describing the behavior and implementation of distributed systems ⋮ Static slicing of explicitly synchronized languages ⋮ Hardness of preorder checking for basic formalisms ⋮ Modelling concurrency with comtraces and generalized comtraces ⋮ Models of nondeterministic regular expressions ⋮ A temporal logic approach to discrete event control for the safety canonical class ⋮ The reactive simulatability (RSIM) framework for asynchronous systems ⋮ The Fork95 programming language: Design, implementation, application. ⋮ From algebra to operational semantics ⋮ Asynchronous Logic Circuits and Sheaf Obstructions ⋮ Transforming sequential systems into concurrent systems ⋮ A fully abstract denotational semantics for the calculus of higher-order communicating systems ⋮ A brief history of process algebra ⋮ Modular specification of process algebras ⋮ Performance evaluation in stochastic process algebra dtsdPBC ⋮ Reachability is decidable for weakly extended process rewrite systems ⋮ Calculi for synchrony and asynchrony ⋮ Algèbre de processus et synchronisation ⋮ Nets, sequential components and concurrency relations ⋮ Hybrid action systems ⋮ Absolute versus relative time in process algebras. ⋮ On the suitability of trace semantics for modular proofs of communicating processes ⋮ Nonexpressibility of fairness and signaling ⋮ Langages infinitaires et produit de mixage ⋮ Algebra of communicating processes with abstraction ⋮ On powerdomains and modality ⋮ Viewing CSP Specifications with UML-RT Diagrams
