An introduction to compositional methods for concurrency and their application to real-time.

DOI10.1007/BF02811338zbMath1075.68616OpenAlexW2076699618MaRDI QIDQ5955749

J. J. M. Hooman, Willem Paul de Roever

Publication date: 18 February 2002

Published in: Sādhanā (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02811338

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)

Unnamed Item

Uses Software

• Ada95

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Specification and compositional verification of real-time systems
• P-A logic - a compositional proof system for distributed programs
• A proof technique for parallel programs
• A model and temporal proof system for networks of processes
• Compositional semantics for real-time distributed computing
• A proof technique for communicating sequential processes
• Compositionality, Concurrency and Partial Correctness. Proof Theories for Networks of Processes, and their Relationship
• An axiomatic proof technique for parallel programs
• Axiomatic semantics of communicating sequential processes
• Tentative steps toward a development method for interfering programs
• Correctness Proofs of Communicating Processes: Three Illustrative Examples From the Literature
• Process algebra for synchronous communication
• A Proof System for Communicating Sequential Processes
• Proofs of Networks of Processes
• Real-Time Behavior of Programs
• An axiomatic basis for computer programming
• Factorizing proofs in timed CSP

This page was built for publication: An introduction to compositional methods for concurrency and their application to real-time.