scientific article

From MaRDI portal

Revision as of 07:30, 4 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3142557

Jump to:navigation, search

zbMath0783.68042MaRDI QIDQ3142557

No author found.

Publication date: 9 January 1994

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

zbMATH Keywords

process algebra concurrency nondeterminism process calculi behavioural semantics transition graphs

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Semantics in the theory of computing (68Q55) Research exposition (monographs, survey articles) pertaining to computer science (68-02)

Related Items (8)

A note on the complexity of deciding bisimilarity of normed unary processes ⋮ On reachability equivalence for BPP-nets ⋮ An algebra of behavioural types ⋮ Complete SAT-Based Model Checking for Context-Free Processes ⋮ Constrained properties, semilinear systems, and Petri nets ⋮ Behavioural equivalence for infinite systems — Partially decidable! ⋮ Deciding bisimulation and trace equivalences for systems with many identical processes ⋮ Pushdown processes: Games and model-checking

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3142557&oldid=16436407"