The limit of splitn-language equivalence

DOI10.1007/3-540-60084-1_111zbMath1412.68157OpenAlexW2159076242MaRDI QIDQ4645217

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

partial order semanticsconcurrencyaction refinement

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)

Related Items (1)

Synchronization languages and rewriting systems

Cites Work

• Modular construction and partial order semantics of Petri nets
• Bisimulation and action refinement
• Interval graphs and interval orders
• The difference between splitting in \(n\) and \(n+1\)
• Concurrent bisimulations in Petri nets
• Axiomatising Finite Concurrent Processes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The limit of splitn-language equivalence