On reduction of asynchronous systems

DOI10.1016/0304-3975(77)90041-XzbMath0365.68022MaRDI QIDQ1241274

Y. S. Kwong

Publication date: 1978

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

Mathematics Subject Classification ID

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

Related Items (8)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Correctness of parallel programs: The Church-Rosser approach
• Parallel program schemata
• On theories with a combinatorial definition of 'equivalence'
• Testing for the Church-Rosser Property
• Reduction
• Formal verification of parallel programs
• Comments on prevention of system deadlocks
• Tree-Manipulating Systems and Church-Rosser Theorems

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