Adequacy properties of path programs

DOI10.1016/0304-3975(82)90020-2zbMath0478.68015OpenAlexW2092331318MaRDI QIDQ1161276

Eike Best

Publication date: 1982

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

Full work available at URL: https://doi.org/10.1016/0304-3975(82)90020-2

zbMATH Keywords

semanticssyntaxpartial deadlockpath notationPT-nets

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Theory of operating systems (68N25)

Related Items (3)

Concurrent and maximally concurrent evolution of nonsequential systems ⋮ Adequacy properties of path programs ⋮ A formal semantics for concurrent systems with a priority relation

Uses Software

• COSY

Cites Work

• Adequacy properties of path programs
• Formal semantics of a class of high-level primitives of coordinating concurrent processes
• COSY - a system specification language based on paths and processes
• Synchronisationsgraphen
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Adequacy properties of path programs