The limit of split_n-language equivalence

DOI10.1007/3-540-60084-1_111MaRDI QIDQ4645217zbMATH OpenOpenAlexFDO

Authors Walter Vogler

Publication date 10 January 2019

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-60084-1_111

zbMATH Keywords

action refinementconcurrencypartial order semantics

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• The limit of split\(_ n\)-language equivalence
• The difference between splitting in \(n\) and \(n+1\)
• scientific article; zbMATH DE number 176137
• Refinement of actions and equivalence notions for concurrent systems
• Split and ST bisimulation semantics

Cites work

• Axiomatising Finite Concurrent Processes
• Bisimulation and action refinement
• Concurrent bisimulations in Petri nets
• scientific article; zbMATH DE number 3735177 (Why is no real title available?)
• scientific article; zbMATH DE number 17804 (Why is no real title available?)
• scientific article; zbMATH DE number 176137 (Why is no real title available?)
• scientific article; zbMATH DE number 3795366 (Why is no real title available?)
• scientific article; zbMATH DE number 827980 (Why is no real title available?)
• Interval graphs and interval orders
• Modular construction and partial order semantics of Petri nets
• The difference between splitting in \(n\) and \(n+1\)

Cited in

(4)

• The difference between splitting in \(n\) and \(n+1\)
• Synchronization languages and rewriting systems
• The limit of split\(_ n\)-language equivalence
• scientific article; zbMATH DE number 176137 (Why is no real title available?)

This page was built for publication: The limit of \(\operatorname{split}_n\)-language equivalence

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