On reduction of asynchronous systems

DOI10.1016/0304-3975(77)90041-XMaRDI QIDQ1241274zbMATH OpenFDO

Authors Y. S. Kwong

Publication date 1978

Published in Theoretical Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Formal languages and automata (68Q45)

Cites work

• scientific article; zbMATH DE number 3471613 (Why is no real title available?)
• scientific article; zbMATH DE number 3302923 (Why is no real title available?)
• Comments on prevention of system deadlocks
• Correctness of parallel programs: The Church-Rosser approach
• Formal verification of parallel programs
• On theories with a combinatorial definition of 'equivalence'
• Parallel program schemata
• Reduction
• Testing for the Church-Rosser Property
• Tree-Manipulating Systems and Church-Rosser Theorems

Cited in

(8)

• Homomorphisms between models of parallel computation
• Computer-based reduction technique for Petri nets
• A unified approach for studying the properties of transition systems
• Automata and concurrency
• Livelocks in parallel programs
• Simulation, reduction and preservation of correctness properties of parallel systems
• Modular implementation of concurrency
• Reduced models for efficient CCS verification

This page was built for publication: On reduction of asynchronous systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1241274)