On the expressiveness of higher dimensional automata

DOI10.1016/j.tcs.2006.02.012zbMath1092.68071OpenAlexW2110308671MaRDI QIDQ2491631

Robert J. van Glabbeek

Publication date: 29 May 2006

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://unsworks.unsw.edu.au/fapi/datastream/unsworks:7779/SOURCE01?view=true

zbMATH Keywords

Petri netscausalityexpressivenessconcurrencyevent structureshigher-dimensional automatahistory-preserving bisimulationst-bisimulation

Mathematics Subject Classification ID

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

Related Items

History-preserving bisimilarity for higher-dimensional automata via open maps, Behavioural logics for configuration structures, Declarative event based models of concurrency and refinement in psi-calculi, Weak equivalence of higher-dimensional automata, Topological abstraction of higher-dimensional automata, Semantic domains of timed event structures, Protocol scheduling, ST-structures, Languages of higher-dimensional automata, Geometric analysis of nondeterminacy in dynamical systems, Unnamed Item, Posets with interfaces as a model for concurrency, Unnamed Item, A stable non-interleaving early operational semantics for the pi-calculus, Weak morphisms of higher dimensional automata, Combinatorics of labelling in higher-dimensional automata, Some collapsing operations for 2-dimensional precubical sets, Formal Relationships Between Geometrical and Classical Models for Concurrency, Algebraic topology and concurrency, Simplicial models of trace spaces, Labeled homology of higher-dimensional automata, On symmetric higher-dimensional automata and bisimilarity, Minimisation of event structures, Dipaths and dihomotopies in a cubical complex

Cites Work

• Petri nets and bisimulation
• Concurrent transition systems
• A calculus of communicating systems
• Petri nets, event structures and domains. I
• Branching processes of Petri nets
• Semantics of systems of concurrent processes. LITP Spring School on theoretical computer science, La Roche Posay, France, 23-27 April 1990. Proceedings
• The difference between splitting in \(n\) and \(n+1\)
• Topological deformation of higher dimensional automata
• Some geometric perspectives in concurrency theory
• A model category for the homotopy theory of concurrency
• Flow does not model flows up to weak dihomotopy
• Homological properties of non-deterministic branchings of mergings in higher dimensional automata
• Comparing globular complex and flow
• Concurrent bisimulations in Petri nets
• On the Specification of Higher Dimensional Automata
• The non-sequential behaviour of Petri nets
• Concurrent Machines
• Process Algebra
• Transition and cancellation in concurrency and branching time
• Geometry and concurrency: a user's guide
• On the classification of dipaths in geometric models for concurrency
• Loops, ditopology and deadlocks
• Homotopy invariants of higher dimensional categories and concurrency in computer science
• Higher dimensional automata revisited
• Mathematical Foundations of Computer Science 2004
• Extraction of concurrent processes from higher dimensional automata
• CONCUR 2005 – Concurrency Theory
• CONCUR 2003 - Concurrency Theory
• Refinement of actions and equivalence notions for concurrent systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item