Concurrent Machines
From MaRDI portal
Recommendations
Cited in
(44)- An algebraic characterization of independence of Petri net processes
- On a fast decomposition method in some models of concurrent computations
- Concurrency and atomicity
- Executions: A new partial-order semantics of Petri nets
- Event structures and trace monoids
- Adequacy-preserving transformations of COSY path programs
- Multitraces, hypertraces and partial order semantics
- Stable trace automata vs. full trace automata
- Labelled domains and automata with concurrency
- Petri nets, traces, and local model checking
- Event-based functional decomposition
- A stable non-interleaving early operational semantics for the pi-calculus
- On the expressiveness of higher dimensional automata
- Transformations of sequential specifications into concurrent specifications by synchronization guards
- History-preserving bisimilarity for higher-dimensional automata via open maps
- scientific article; zbMATH DE number 3876608 (Why is no real title available?)
- CONCURRENT AUTOMATA AND DOMAINS
- From domains to automata with concurrency
- A Kleene theorem for recognizable languages over concurrency monoids
- Algebraic structure of step traces and interval traces
- Languages of higher-dimensional automata
- Petri nets, traces, and local model checking
- Formal relationships between geometrical and classical models for concurrency
- Higher-dimensional automata modeling shared-variable systems
- Recognizable and logically definable languages of infinite computations in concurrent automata
- scientific article; zbMATH DE number 5222378 (Why is no real title available?)
- A stable non-interleaving early operational semantics for the pi-calculus
- Models for name-passing processes: Interleaving and causal
- First-order axioms for asynchrony
- Comparing transition systems with independence and asynchronous transition systems
- Transition systems of Elementary Net Systems with inhibitor arcs
- Interval traces with mutex relation
- A Myhill-Nerode theorem for higher-dimensional automata
- Languages and logical definability in concurrency monoids
- Closure and decision properties for higher-dimensional automata
- Myhill-Nerode theorem for higher-dimensional automata
- Models for concurrency: Towards a classification
- Recognizable languages in concurrency monoids
- Petri nets and bisimulation
- Computable concurrent processes
- Structure of concurrency
- The poset of infinitary traces
- Bisimulations and logics for higher-dimensional automata
- Closure and decision properties for higher-dimensional automata
This page was built for publication: Concurrent Machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3691067)
