scientific article; zbMATH DE number 1107620

zbMath0885.18004MaRDI QIDQ4373555

Piergiolio Katis, Nicoletta Sabadini, Robert F. C. Walters

Publication date: 20 April 1998

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

zbMATH Keywords

concurrent systemsconcurrencynon-deterministic automatastructured transition systemsalgebra of transition systemsgeometry of distributed systemsPenrose algebra of tensorsspecification of computing systems

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Categories of machines, automata (18B20)

Related Items (20)

Concurrent Process Histories and Resource Transducers ⋮ Feedback, trace and fixed-point semantics ⋮ Categorical foundations for randomly timed automata ⋮ Calculating Colimits Compositionally ⋮ A diagrammatic view of differential equations in physics ⋮ The compositional construction of Markov processes ⋮ Unnamed Item ⋮ The compositional construction of Markov processes II ⋮ On the geometry and algebra of networks with state ⋮ A Programming Language for Spatial Distribution of Net Systems ⋮ Blocked-braid groups ⋮ A Note on an Old-Fashioned Algebra for (Disconnected) Graphs ⋮ Formal composition of hybrid systems ⋮ Bialgebraic foundations for the operational semantics of string diagrams ⋮ An Algebra of Automata That Includes Both Classical and Quantum Entities ⋮ Comparing cospan-spans and tiles via a Hoare-style process calculus ⋮ Concrete Process Categories ⋮ Normal forms for algebras of connections. ⋮ Dynamic connectors for concurrency ⋮ Comparing logics for rewriting: Rewriting logic, action calculi and tile logic

This page was built for publication: