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
- An application of the theory of free partially commutative monoids: Asymptotic densities of trace languages
- Combinatorial problems of commutation and rearrangements
- 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?)
- 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)- Weighted asynchronous cellular automata
- Mixed product and asynchronous automata
- Theory of traces
- 2-asynchronous automata
- Recognizable closures and submonoids of free partially commutative monoids
- Event structures and trace monoids
- Probabilistic estimation of the number of prefixes of a trace
- Two recognizable string-matching problems over free partially commutative monoids
- Semicommutations and algebraic languages
- The free partially commutative Lie algebra: Bases and ranks
- String matching problems over free partially commutative monoids
- Representation of computations in concurrent automata by dependence orders
- Atomic semicommutations
- An extension of Kleene's and Ochmański's theorems to infinite traces
- On the existence of minimum asynchronous automata and on the equivalence problem for unambiguous regular trace languages
- Recognizable trace languages, distributed automata and the distribution problem
- Asynchronous automata versus asynchronous cellular automata
- Deterministic asynchronous automata for infinite traces
- On the complementation of asynchronous cellular Büchi automata
- Series-parallel languages and the bounded-width property
- Asynchronous cellular automata for pomsets
- Realizability of concurrent recursive programs
- Mixed languages
- Semi-commutations and Petri nets
- Membership problems for regular and context-free trace languages
- Product interval automata
- Distributed automata in an assumption-commitment framework
- Bounded time-stamping in message-passing systems
- Two optimal parallel algorithms on the commutation class of a word
- Realizability of high-level message sequence charts: closing the gaps
- A study on shuffle, stopwatches and independently evolving clocks
- Semigroups arising from asynchronous automata.
- The synthesis problem for repeatedly communicating Petri games
- Solving high-level Petri games
- Communicating finite-state machines, first-order logic, and star-free propositional dynamic logic
- Classifying recognizable infinitary trace languages using word automata
- Contracts for cross-organizational workflows as timed dynamic condition response graphs
- Time-stamps for Mazurkiewicz traces.
- A Kleene theorem and model checking algorithms for existentially bounded communicating automata
- A theory of regular MSC languages
- Models for quantitative distributed systems and multi-valued logics
- On interactive knowledge with bounded communication
- Classifying recognizable infinitary trace languages using word automata
- Undecidability of partial order logics
- Automata and Logics for Concurrent Systems: Five Models in Five Pages
- Shared-memory systems and charts
- Compositions de fonctions de commutation partielle
- CD-systems of stateless deterministic R(1)-automata governed by an external pushdown store
- Soundness in negotiations
- Distributed Asynchronous Automata
- On Distributed Monitoring and Synthesis
- Communicating finite-state machines and two-variable logic
- Automated synthesis of distributed controllers
- A Canonical Contraction for Safe Petri Nets
- MSO Logic for Unambiguous Shared-Memory Systems
- Semantics of Deterministic Shared-Memory Systems
- Unambiguous shared-memory systems
- Realizability of Concurrent Recursive Programs
- Trace languages defined by regular string languages
- scientific article; zbMATH DE number 4037203 (Why is no real title available?)
- scientific article; zbMATH DE number 4112050 (Why is no real title available?)
- An extension of the notions of traces and of asynchronous automata
- A quadratic construction for Zielonka automata with acyclic communication structure
- scientific article; zbMATH DE number 3497800 (Why is no real title available?)
- Solving parity games by a reduction to SAT
- scientific article; zbMATH DE number 679806 (Why is no real title available?)
- Determinizing asynchronous automata
- On the complementation of Büchi asynchronous cellular automata
- A Kleene theorem for recognizable languages over concurrency monoids
- Asynchronous trace-matching automata
- Temporal logics for concurrent recursive programs: satisfiability and model checking
- Probabilistic asynchronous automata
- scientific article; zbMATH DE number 871239 (Why is no real title available?)
- Distributed Control of Discrete-Event Systems: A First Step
- It is easy to be wise after the event: communicating finite-state machines capture first-order logic with ``happened before
- Distributed Asynchronous Games With Causal Memory are Undecidable
- Verification and comparison of transition systems
- scientific article; zbMATH DE number 7559475 (Why is no real title available?)
- Asynchronous wreath product and cascade decompositions for concurrent behaviours
- Subclasses of recognizable trace languages
- Automated synthesis: a distributed viewpoint
- On the control of asynchronous automata
- Keeping track of the latest gossip in a distributed system
- Petri games: synthesis of distributed systems with causal memory
- Kleene theorems for product systems
- Semi-commutations and rational expressions
- Asynchronous cellular automata for infinite traces
- Kleene Theorems for Synchronous Products with Matching
- ENFORCING CONCURRENT TEMPORAL BEHAVIORS
- Mathematical Foundations of Computer Science 2005
- Compositional synthesis of asynchronous automata
- Translating asynchronous games for distributed synthesis
- Reordering Derivatives of Trace Closures of Regular Languages.
- Models and logics for true concurrency.
- Trace monoids with idempotent generators and measure-only quantum automata
- A product version of dynamic linear time temporal logic
- High-level representation of benchmark families for Petri games
- Automata for epistemic temporal logic with synchronous communication
- Asynchronous cellular automata for pomsets without auto-concurrency
- A PO characterisation of reconfiguration
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)
