scientific article; zbMATH DE number 4043216
From MaRDI portal
Publication:3780411
Recommendations
- Analysis of a class of communicating finite state machines
- scientific article; zbMATH DE number 177258
- On the decidability of correctness problems for a communicating automata net
- scientific article; zbMATH DE number 177520
- Boundedness, empty channel detection, and synchronization for communicating finite automata
Cited in
(20)- Exposure to deadlock for communicating processes is hard to detect
- The complexity of reachability in distributed communicating processes
- Reduction and covering of infinite reachability trees
- Analysis of a class of communicating finite state machines
- Well-abstracted transition systems: Application to FIFO automata.
- A multiparameter analysis of the boundedness problem for vector addition systems
- Communicating processes, scheduling, and the complexity of nontermination
- Deadlock detection in communicating stream X-machine systems
- scientific article; zbMATH DE number 3881887 (Why is no real title available?)
- Priority Networks of Communicating Finite State Machines
- scientific article; zbMATH DE number 3907779 (Why is no real title available?)
- Proving Liveness and Termination of Systolic Arrays Using Communicating Finite State Machines
- scientific article; zbMATH DE number 177258 (Why is no real title available?)
- scientific article; zbMATH DE number 177520 (Why is no real title available?)
- Construction of Deadlock-free Designs of Communication Protocols from Observations
- On the undecidability of deadlock detection in families of nets
- Undecidable verification problems for programs with unreliable channels
- scientific article; zbMATH DE number 7471708 (Why is no real title available?)
- Non axiomatisability of positive relation algebras with constants, via graph homomorphisms
- Testing for unboundedness of fifo channels
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3780411)
