Adequacy-preserving transformations of COSY path programs

DOI10.1016/0304-3975(92)90327-CzbMath0745.68075MaRDI QIDQ1185020

Maciej Koutny

Publication date: 28 June 1992

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

zbMATH Keywords

path programsverification of the behavioural properties of concurrent systems

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (1)

On Interval Semantics of Inhibitor and Activator Nets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A method for stepwise refinement and abstraction of Petri nets
• Specification-oriented semantics for communicating processes
• Concurrent Machines
• Automatic verification of finite-state concurrent systems using temporal logic specifications
• Algebraic laws for nondeterminism and concurrency
• Proving the Correctness of Multiprocess Programs

This page was built for publication: Adequacy-preserving transformations of COSY path programs