The limit of split_ n-language equivalence

DOI10.1006/INCO.1996.0048MaRDI QIDQ1923087zbMATH OpenOpenAlexFDO

Authors Walter Vogler

Publication date 25 November 1996

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/inco.1996.0048

zbMATH Keywords

Petri netssplitting

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• The limit of \(\operatorname{split}_n\)-language equivalence
• The difference between splitting in \(n\) and \(n+1\)
• Split and ST bisimulation semantics
• scientific article; zbMATH DE number 176137

Cited in

(7)

• Decidability of split equivalence
• The limit of \(\operatorname{split}_n\)-language equivalence
• Partial order semantics and read arcs
• The difference between splitting in \(n\) and \(n+1\)
• Bisimulations respecting duration and causality for the non-interleaving applied \(\pi\)-calculus
• Vertical implementation
• scientific article; zbMATH DE number 176137 (Why is no real title available?)

This page was built for publication: The limit of split\(_ n\)-language equivalence

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1923087)