The following pages link to Concurrent transition systems (Q1119395):
Displaying 26 items.
- Mind the gap: expanding communication options in decentralized discrete-event control (Q646415) (← links)
- Models for concurrency: Towards a classification (Q672053) (← links)
- Recognizable languages in concurrency monoids (Q672317) (← links)
- Equality of languages coincides with isomorphism of reachable state graphs for bounded and persistent Petri nets (Q1041759) (← links)
- Conditional rewriting logic as a unified model of concurrency (Q1190488) (← links)
- The expressive power of indeterminate dataflow primitives (Q1201292) (← links)
- Nonexpressibility of fairness and signaling (Q1309386) (← links)
- Labelled domains and automata with concurrency (Q1346626) (← links)
- Petri nets, traces, and local model checking (Q1391100) (← links)
- Relating conflict-free stable transition and event models via redex families (Q1608893) (← links)
- On the expressiveness of higher dimensional automata (Q2491631) (← links)
- Algebraic topology and concurrency (Q2500494) (← links)
- The conflict-free reduction geometry (Q2581368) (← links)
- Directed Homotopy in Non-Positively Curved Spaces (Q3300792) (← links)
- Decomposition Theorems for Bounded Persistent Petri Nets (Q3510855) (← links)
- The geometry of orthogonal reduction spaces (Q4571994) (← links)
- The true concurrency of differential interaction nets (Q4577982) (← links)
- From domains to automata with concurrency (Q4630301) (← links)
- A kleene theorem for recognizable languages over concurrency monoids (Q4632442) (← links)
- Proof-relevant π-calculus: a constructive account of concurrency and causality (Q4691184) (← links)
- Compositional relational semantics for indeterminate dataflow networks (Q5096251) (← links)
- On relating rewriting systems and graph grammars to event structures (Q5096291) (← links)
- Petri nets, traces, and local model checking (Q5096394) (← links)
- Relative normalization in Deterministic Residual Structures (Q5878909) (← links)
- Connections between a concrete and an abstract model of concurrent systems (Q5887511) (← links)
- Models and logics for true concurrency. (Q5955751) (← links)
