Step failures semantics and a complete proof system

DOI10.1007/BF00265151MaRDI QIDQ582133zbMATH OpenFDO

Authors Dirk Taubner, Walter Vogler

Publication date 1989

Published in Acta Informatica (Search for Journal in Brave)

zbMATH Keywords

divergenceparallelismdeparallelize operatorHoare's CSPlinear semanticsstep failures semantics

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Abstract data types; algebraic specification (68Q65) Theory of operating systems (68N25)

Recommendations

• scientific article; zbMATH DE number 3990850
• scientific article; zbMATH DE number 3928330
• A Complete Axiomatic Semantics for the CSP Stable-Failures Model
• Of wlp and CSP
• A CSP model with flexible parallel termination semantics

Cites work

• scientific article; zbMATH DE number 4018360 (Why is no real title available?)
• scientific article; zbMATH DE number 3856435 (Why is no real title available?)
• scientific article; zbMATH DE number 3808928 (Why is no real title available?)
• scientific article; zbMATH DE number 3902016 (Why is no real title available?)
• scientific article; zbMATH DE number 3990850 (Why is no real title available?)
• scientific article; zbMATH DE number 4035159 (Why is no real title available?)
• scientific article; zbMATH DE number 4060688 (Why is no real title available?)
• scientific article; zbMATH DE number 4087033 (Why is no real title available?)
• scientific article; zbMATH DE number 4094831 (Why is no real title available?)
• scientific article; zbMATH DE number 3716769 (Why is no real title available?)
• scientific article; zbMATH DE number 48630 (Why is no real title available?)
• scientific article; zbMATH DE number 4182807 (Why is no real title available?)
• A Theory of Communicating Sequential Processes
• A calculus of communicating systems
• A distributed operational semantics of CCS based on condition/event systems
• A linear-history semantics for languages for distributed programming
• Algebraic semantics
• Algèbre de processus et synchronisation
• CIRCAL and the representation of communication, concurrency, and time
• Calculi for synchrony and asynchrony
• Communicating sequential processes
• Decomposition of distributed programs into communication-closed layers
• Denotational semantics of communicating sequential programs
• Finite representations of CCS and TCSP programs by automata and Petri nets
• Higher-level synchronising devices in Meije-SCCS
• Semantics of nondeterminism, concurrency, and communication
• Specification-oriented semantics for communicating processes
• Subset languages of Petri nets. I: The relationship to string languages and normal forms
• Synchronized behaviours of processes and rational relations
• Testing equivalences for processes

Cited in

(7)

• scientific article; zbMATH DE number 3928330 (Why is no real title available?)
• scientific article; zbMATH DE number 3990850 (Why is no real title available?)
• Simulating truly concurrent CSP
• Of wlp and CSP
• Deciding true concurrency equivalences on safe, finite nets
• scientific article; zbMATH DE number 1927430 (Why is no real title available?)
• Deciding true concurrency equivalences on finite safe nets (preliminary report)

This page was built for publication: Step failures semantics and a complete proof system

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