Notes on finite asynchronous automata
From MaRDI portal
Recommendations
- An extension of the notions of traces and of asynchronous automata
- scientific article; zbMATH DE number 1015097
- Mixed product and asynchronous automata
- On the existence of minimum asynchronous automata and on the equivalence problem for unambiguous regular trace languages
- scientific article; zbMATH DE number 871239
Cites work
- scientific article; zbMATH DE number 3808972 (Why is no real title available?)
- scientific article; zbMATH DE number 3654376 (Why is no real title available?)
- scientific article; zbMATH DE number 3757714 (Why is no real title available?)
- scientific article; zbMATH DE number 3497806 (Why is no real title available?)
- scientific article; zbMATH DE number 3594628 (Why is no real title available?)
- scientific article; zbMATH DE number 3607505 (Why is no real title available?)
- An application of the theory of free partially commutative monoids: Asymptotic densities of trace languages
- Combinatorial problems of commutation and rearrangements
- Mixed product and asynchronous automata
- Partial commutations and faithful rational transductions
- Recognizable subsets of some partially Abelian monoids
Cited in
(only showing first 100 items - show all)- Models for quantitative distributed systems and multi-valued logics
- Verification and comparison of transition systems
- Soundness in negotiations
- Realizability of concurrent recursive programs
- Asynchronous cellular automata for infinite traces
- The categorical contours of the Chomsky-Schützenberger representation theorem
- Semantics of Deterministic Shared-Memory Systems
- Petri games: synthesis of distributed systems with causal memory
- Compositions de fonctions de commutation partielle
- Communicating finite-state machines and two-variable logic
- Semicommutations and algebraic languages
- Modelling concurrency with comtraces and generalized comtraces
- Structure of concurrency
- Forwards- and backwards-reachability for cooperating multi-pushdown systems
- Compilation of the ELECTRE reactive language into finite transition systems
- Bicategories of processes
- Determinizing asynchronous automata
- Adding reconfiguration to Zielonka's asynchronous automata
- Distributed automata in an assumption-commitment framework
- Product interval automata
- Communicating finite-state machines, first-order logic, and star-free propositional dynamic logic
- Bounded time-stamping in message-passing systems
- A class of rational trace relations closed under composition
- On the complementation of Büchi asynchronous cellular automata
- On the control of asynchronous automata
- Semigroups arising from asynchronous automata.
- scientific article; zbMATH DE number 7559475 (Why is no real title available?)
- The free partially commutative Lie algebra: Bases and ranks
- Asynchronous cellular automata for pomsets
- Keeping track of the latest gossip in a distributed system
- A quadratic construction for Zielonka automata with acyclic communication structure
- An expressively complete local past propositional dynamic logic over Mazurkiewicz traces and its applications
- Deterministic asynchronous automata for infinite traces
- scientific article; zbMATH DE number 7566078 (Why is no real title available?)
- Mathematical Foundations of Computer Science 2005
- On interactive knowledge with bounded communication
- 2-asynchronous automata
- scientific article; zbMATH DE number 4037203 (Why is no real title available?)
- Solving parity games by a reduction to SAT
- Trace monoids with idempotent generators and measure-only quantum automata
- Automated synthesis of distributed controllers
- An extension of the notions of traces and of asynchronous automata
- Solving high-level Petri games
- Compositional synthesis of asynchronous automata
- Two optimal parallel algorithms on the commutation class of a word
- Representation of computations in concurrent automata by dependence orders
- scientific article; zbMATH DE number 7649934 (Why is no real title available?)
- Basic notions of universal algebra for language theory and graph grammars
- Realizability of Concurrent Recursive Programs
- High-level representation of benchmark families for Petri games
- Trace languages defined by regular string languages
- scientific article; zbMATH DE number 4112050 (Why is no real title available?)
- Undecidability of partial order logics
- A PO characterisation of reconfiguration
- Reordering Derivatives of Trace Closures of Regular Languages.
- A product version of dynamic linear time temporal logic
- Asynchronous automata versus asynchronous cellular automata
- Probabilistic asynchronous automata
- Kleene Theorems for Synchronous Products with Matching
- ENFORCING CONCURRENT TEMPORAL BEHAVIORS
- Logical definability on infinite traces
- A Canonical Contraction for Safe Petri Nets
- Automata and Logics for Concurrent Systems: Five Models in Five Pages
- Kleene theorem for higher-dimensional automata
- Logic and languages of higher-dimensional automata
- Theory of traces
- Semi-commutations and rational expressions
- Automata for epistemic temporal logic with synchronous communication
- Weighted asynchronous cellular automata
- Time-stamps for Mazurkiewicz traces.
- Shared-memory systems and charts
- Two recognizable string-matching problems over free partially commutative monoids
- Unambiguous shared-memory systems
- Atomic semicommutations
- MSO Logic for Unambiguous Shared-Memory Systems
- Asynchronous trace-matching automata
- Temporal logics for concurrent recursive programs: satisfiability and model checking
- scientific article; zbMATH DE number 3497800 (Why is no real title available?)
- Synthesis and Analysis of Petri Nets from Causal Specifications
- An extension of Kleene's and Ochmański's theorems to infinite traces
- Controlling loosely cooperating processes
- Models and logics for true concurrency.
- Series-parallel languages and the bounded-width property
- Recognizable trace languages, distributed automata and the distribution problem
- A Kleene theorem and model checking algorithms for existentially bounded communicating automata
- A Nice labelling for tree-like event structures of degree 3
- A survey on automata with translucent letters
- scientific article; zbMATH DE number 679806 (Why is no real title available?)
- A theory of regular MSC languages
- The synthesis problem for repeatedly communicating Petri games
- Recognizable closures and submonoids of free partially commutative monoids
- Event structures and trace monoids
- Membership problems for regular and context-free trace languages
- A study on shuffle, stopwatches and independently evolving clocks
- Distributed Asynchronous Games With Causal Memory are Undecidable
- Probabilistic estimation of the number of prefixes of a trace
- Mixed product and asynchronous automata
- Distributed Control of Discrete-Event Systems: A First Step
- Hypernode automata
- Active learning for sound negotiations
This page was built for publication: Notes on finite asynchronous automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3761703)
