Step failures semantics and a complete proof system

DOI10.1007/BF00265151zbMath0689.68105MaRDI QIDQ582133

Walter Vogler, Dirk Taubner

Publication date: 1989

Published in: Acta Informatica (Search for Journal in Brave)

zbMATH Keywords

parallelismdivergencedeparallelize 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)

Related Items

Deciding true concurrency equivalences on safe, finite nets ⋮ Deciding true concurrency equivalences on finite safe nets (preliminary report) ⋮ Simulating Truly Concurrent CSP

Cites Work

• Subset languages of Petri nets. I: The relationship to string languages and normal forms
• Algèbre de processus et synchronisation
• A linear-history semantics for languages for distributed programming
• Calculi for synchrony and asynchrony
• Decomposition of distributed programs into communication-closed layers
• Specification-oriented semantics for communicating processes
• Higher-level synchronising devices in Meije-SCCS
• Denotational semantics of communicating sequential programs
• A distributed operational semantics of CCS based on condition/event systems
• Semantics of nondeterminism, concurrency, and communication
• A calculus of communicating systems
• Algebraic semantics
• Synchronized behaviours of processes and rational relations
• Finite representations of CCS and TCSP programs by automata and Petri nets
• Testing equivalences for processes
• CIRCAL and the representation of communication, concurrency, and time
• A Theory of Communicating Sequential Processes
• Communicating sequential processes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item