A menagerie of non-finitely based process semantics over BPA* – from ready simulation to completed traces
From MaRDI portal
Publication:4236208
Recommendations
- Processes as terms: non-well-founded models for bisimulation
- scientific article; zbMATH DE number 4119652
- scientific article; zbMATH DE number 1863166
- scientific article; zbMATH DE number 4016181
- A denotational semantics for a process-based simulation language
- On context bisimulation for parameterized higher-order processes
- A short proof of the decidability of bisimulation for normed BPA- processes
- Bisimulation for higher-order process calculi
- scientific article; zbMATH DE number 1829371
Cited in
(14)- A complete equational axiomatization for MPA with string iteration
- On a question of A. Salomaa The equational theory of regular expressions over a singleton alphabet is not finitely based
- Nonaxiomatisability of equivalences over finite state processes
- The equational logic of fixed points
- Language preorder as a precongruence
- The max-plus algebra of the natural numbers has no finite equational basis
- scientific article; zbMATH DE number 2038703 (Why is no real title available?)
- Axiomatizations for the perpetual loop in process algebra
- Trace simulation semantics is not finitely based over BCCSP
- Non-regular iterators in process algebra
- Nested semantics over finite trees are equationally hard
- Non-finite axiomatisability results via reductions: CSP parallel composition and CCS restriction
- An algebraic theory of nondeterministic finite automata
- Bisimilarity is not finitely based over BPA with interrupt
This page was built for publication: A menagerie of non-finitely based process semantics over BPA* – from ready simulation to completed traces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4236208)
