The limit of split_n-language equivalence

DOI10.1007/3-540-60084-1_111zbMATH Open1412.68157OpenAlexW2159076242MaRDI QIDQ4645217FDOQ4645217

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

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

zbMATH Keywords

concurrencyaction refinementpartial 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)

Cites Work

• Concurrent bisimulations in Petri nets
• Title not available (Why is that?)
• The difference between splitting in \(n\) and \(n+1\)
• Interval graphs and interval orders
• Title not available (Why is that?)
• Bisimulation and action refinement
• Modular construction and partial order semantics of Petri nets
• Axiomatising Finite Concurrent Processes
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (2)

• Synchronization languages and rewriting systems
• Title not available (Why is that?)

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)