ST-structures

DOI10.1016/j.jlamp.2015.10.009zbMath1353.68208OpenAlexW2397501793MaRDI QIDQ338620

Christian Johansen

Publication date: 7 November 2016

Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jlamp.2015.10.009

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

Declarative event based models of concurrency and refinement in psi-calculi, Languages of higher-dimensional automata, Unnamed Item, A stable non-interleaving early operational semantics for the pi-calculus, Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• History-preserving bisimilarity for higher-dimensional automata via open maps
• Concurrent Kleene algebra and its foundations
• Configuration structures, event structures and Petri nets
• The difference between splitting in \(n\) and \(n+1\)
• Components of the fundamental category
• Contextual Petri nets, asymmetric event structures, and processes
• Computer science today. Recent trends and developments
• Components of the fundamental category. II
• On the expressiveness of higher dimensional automata
• Algebraic topology and concurrency
• Dipaths and dihomotopies in a cubical complex
• A Logic for True Concurrency
• Modal Logic over Higher Dimensional Automata
• Transition and cancellation in concurrency and branching time
• Higher dimensional automata revisited
• Formal Relationships Between Geometrical and Classical Models for Concurrency
• Foundations of Software Science and Computational Structures
• CONCUR 2005 – Concurrency Theory
• Refinement of actions and equivalence notions for concurrent systems