Distributed automata in an assumption-commitment framework
From MaRDI portal
Recommendations
- Parallel composition of assumption-commitment specifications: A unifying approach for shared variable and distributed message passing concurrency
- Assumption-commitment support for CSP model checking
- Assumption-commitment support for CSP model checking
- Using assumptions to distribute CTL model checking
- Distribution and synchronized automata
Cites work
- A Proof System for Communicating Sequential Processes
- An automata-theoretic approach to branching-time model checking
- Asynchronous mappings and asynchronous cellular automata
- scientific article; zbMATH DE number 52331 (Why is no real title available?)
- scientific article; zbMATH DE number 4119618 (Why is no real title available?)
- scientific article; zbMATH DE number 3302923 (Why is no real title available?)
- Notes on finite asynchronous automata
- P-A logic - a compositional proof system for distributed programs
- Proving Liveness Properties of Concurrent Programs
- Verifying properties of parallel programs
Cited in
(7)- Parallel composition of assumption-commitment specifications: A unifying approach for shared variable and distributed message passing concurrency
- Cooperating Distributed Tree Automata
- Modular constructions of distributing automata
- Assumption-commitment support for CSP model checking
- Kleene theorems for product systems
- Kleene Theorems for Synchronous Products with Matching
- Distributed ω-Automata
This page was built for publication: Distributed automata in an assumption-commitment framework
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1847547)
