Pages that link to "Item:Q3761703"
From MaRDI portal
The following pages link to Notes on finite asynchronous automata (Q3761703):
Displaying 50 items.
- Undecidability of partial order logics (Q294640) (← links)
- A quadratic construction for Zielonka automata with acyclic communication structure (Q407518) (← links)
- Solving parity games by a reduction to SAT (Q414902) (← links)
- Asynchronous trace-matching automata (Q466372) (← links)
- Temporal logics for concurrent recursive programs: satisfiability and model checking (Q472794) (← links)
- Petri games: synthesis of distributed systems with causal memory (Q515654) (← links)
- Compositional synthesis of asynchronous automata (Q551202) (← links)
- Automata for epistemic temporal logic with synchronous communication (Q616040) (← links)
- Modelling concurrency with comtraces and generalized comtraces (Q651308) (← links)
- Basic notions of universal algebra for language theory and graph grammars (Q671349) (← links)
- Logical definability on infinite traces (Q672860) (← links)
- Compilation of the ELECTRE reactive language into finite transition systems (Q673127) (← links)
- Bicategories of processes (Q674474) (← links)
- Structure of concurrency (Q685384) (← links)
- Controlling loosely cooperating processes (Q896910) (← links)
- Distribution and synchronized automata (Q917329) (← links)
- A Nice labelling for tree-like event structures of degree 3 (Q979077) (← links)
- Weighted asynchronous cellular automata (Q1022595) (← links)
- Mixed product and asynchronous automata (Q1099643) (← links)
- Theory of traces (Q1107296) (← links)
- 2-asynchronous automata (Q1109571) (← links)
- Recognizable closures and submonoids of free partially commutative monoids (Q1178709) (← links)
- Event structures and trace monoids (Q1183599) (← links)
- Probabilistic estimation of the number of prefixes of a trace (Q1184996) (← links)
- Two recognizable string-matching problems over free partially commutative monoids (Q1190454) (← links)
- Semicommutations and algebraic languages (Q1199527) (← links)
- The free partially commutative Lie algebra: Bases and ranks (Q1199767) (← links)
- String matching problems over free partially commutative monoids (Q1207940) (← links)
- Representation of computations in concurrent automata by dependence orders (Q1269906) (← links)
- Atomic semicommutations (Q1314382) (← links)
- An extension of Kleene's and Ochmański's theorems to infinite traces (Q1318685) (← links)
- On the existence of minimum asynchronous automata and on the equivalence problem for unambiguous regular trace languages (Q1322488) (← links)
- Recognizable trace languages, distributed automata and the distribution problem (Q1323363) (← links)
- Asynchronous automata versus asynchronous cellular automata (Q1334661) (← links)
- Deterministic asynchronous automata for infinite traces (Q1338892) (← links)
- On the complementation of asynchronous cellular Büchi automata (Q1349891) (← links)
- Series-parallel languages and the bounded-width property (Q1566734) (← links)
- Asynchronous cellular automata for pomsets (Q1583242) (← links)
- Realizability of concurrent recursive programs (Q1620953) (← links)
- Mixed languages (Q1770385) (← links)
- Semi-commutations and Petri nets (Q1822948) (← links)
- Membership problems for regular and context-free trace languages (Q1824384) (← links)
- Product interval automata (Q1847544) (← links)
- Distributed automata in an assumption-commitment framework (Q1847547) (← links)
- Bounded time-stamping in message-passing systems (Q1853588) (← links)
- Two optimal parallel algorithms on the commutation class of a word (Q1882917) (← links)
- Realizability of high-level message sequence charts: closing the gaps (Q1884911) (← links)
- A study on shuffle, stopwatches and independently evolving clocks (Q1938360) (← links)
- The synthesis problem for repeatedly communicating Petri games (Q2165240) (← links)
- Solving high-level Petri games (Q2182671) (← links)