Distributed automata in an assumption-commitment framework

DOI10.1007/BF02717184zbMath1018.68041MaRDI QIDQ1847547

Swarup Mohalik, Ranga S. Ramanujan

Publication date: 27 November 2002

Published in: Sādhanā (Search for Journal in Brave)

zbMATH Keywords

finite state systemssynchronizing distributed processes

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

Kleene Theorems for Product Systems ⋮ Kleene Theorems for Synchronous Products with Matching

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Asynchronous mappings and asynchronous cellular automata
• P-A logic - a compositional proof system for distributed programs
• Notes on finite asynchronous automata
• A Proof System for Communicating Sequential Processes
• Proving Liveness Properties of Concurrent Programs
• Verifying properties of parallel programs
• An automata-theoretic approach to branching-time model checking

This page was built for publication: Distributed automata in an assumption-commitment framework