The following pages link to Concurrent Machines (Q3691067):
Displayed 31 items.
- History-preserving bisimilarity for higher-dimensional automata via open maps (Q265804) (← links)
- Models for name-passing processes: Interleaving and causal (Q598191) (← links)
- Models for concurrency: Towards a classification (Q672053) (← links)
- Recognizable languages in concurrency monoids (Q672317) (← links)
- Petri nets and bisimulation (Q672873) (← links)
- Structure of concurrency (Q685384) (← links)
- The poset of infinitary traces (Q689293) (← links)
- An algebraic characterization of independence of Petri net processes (Q1028983) (← links)
- Concurrency and atomicity (Q1124366) (← links)
- Executions: A new partial-order semantics of Petri nets (Q1183595) (← links)
- Event structures and trace monoids (Q1183599) (← links)
- Adequacy-preserving transformations of COSY path programs (Q1185020) (← links)
- Multitraces, hypertraces and partial order semantics (Q1203122) (← links)
- Stable trace automata vs. full trace automata (Q1276249) (← links)
- Labelled domains and automata with concurrency (Q1346626) (← links)
- Petri nets, traces, and local model checking (Q1391100) (← links)
- Event-based functional decomposition (Q2304530) (← links)
- A stable non-interleaving early operational semantics for the pi-calculus (Q2423752) (← links)
- On the expressiveness of higher dimensional automata (Q2491631) (← links)
- Transformations of sequential specifications into concurrent specifications by synchronization guards (Q2638794) (← links)
- From domains to automata with concurrency (Q4630301) (← links)
- A kleene theorem for recognizable languages over concurrency monoids (Q4632442) (← links)
- Algebraic Structure of Step Traces and Interval Traces (Q4988962) (← links)
- Languages of higher-dimensional automata (Q5076390) (← links)
- Petri nets, traces, and local model checking (Q5096394) (← links)
- Formal Relationships Between Geometrical and Classical Models for Concurrency (Q5179022) (← links)
- (Q5232910) (← links)
- RECOGNIZABLE AND LOGICALLY DEFINABLE LANGUAGES OF INFINITE COMPUTATIONS IN CONCURRENT AUTOMATA (Q5248980) (← links)
- A Stable Non-interleaving Early Operational Semantics for the Pi-Calculus (Q5738986) (← links)
- First-order axioms for asynchrony (Q6044130) (← links)
- Comparing transition systems with independence and asynchronous transition systems (Q6104367) (← links)