Analysis of a class of communicating finite state machines

DOI10.1007/BF01185558zbMath0790.68042MaRDI QIDQ1323365

Wuxu Peng, Sudarshan P. Purushothaman

Publication date: 1992

Published in: Acta Informatica (Search for Journal in Brave)

zbMATH Keywords

reachabilitypolynomial complexitydeadlock detectionunboundedness detectionconcurrency modelgeneral Petri netsnetworks of communicating finite state machinesshuffle-product

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Distributed algorithms (68W15)

Related Items (8)

Eliminating the storage tape in reachability constructions. ⋮ Unnamed Item ⋮ Verification in loosely synchronous queue-connected discrete timed automata. ⋮ Unnamed Item ⋮ A Sound Algorithm for Asynchronous Session Subtyping ⋮ Context-Bounded Analysis of Concurrent Queue Systems ⋮ Counter machines and verification problems. ⋮ Algorithmic analysis of programs with well quasi-ordered domains.

Cites Work

• Unboundedness detection for a class of communicating finite-state machines
• Exposure to deadlock for communicating processes is hard to detect
• On Communicating Finite-State Machines
• Deadlock Detection for a Class of Communicating Finite State Machines
• Properties of Conflict-Free and Persistent Petri Nets
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Analysis of a class of communicating finite state machines