scientific article; zbMATH DE number 4119655

MaRDI QIDQ4733430zbMATH OpenFDO

Authors

Publication date 1989

zbMATH Keywords

change of atomicityconcurrencyfull abstractionlabelled partial ordersnoninterleaved models

Mathematics Subject Classification ID

Partial orders, general (06A06) Semantics in the theory of computing (68Q55) Abstract data types; algebraic specification (68Q65)

Recommendations

• scientific article; zbMATH DE number 1435946
• A fully abstract denotational model for higher-order processes
• A fully abstract denotational semantics for the \(\pi\)-calculus
• Fully abstract denotational models for nonuniform concurrent languages
• A singleton failures semantics for communicating sequential processes

Cited in

(15)

• Fully abstract models and refinements as tools to compare agents in timed coordination languages
• A semantic characterization for faults in replicated systems
• The difference between splitting in \(n\) and \(n+1\)
• Progress assumption in concurrent systems
• Algebra and theory of order-deterministic pomsets
• On hierarchically developing reactive systems
• Processes against tests: on defining contextual equivalences
• Fully abstract semantics for a coordination model with asynchronous communication and enhanced matching
• scientific article; zbMATH DE number 3937124 (Why is no real title available?)
• Metric Semantics and Full Abstractness for Action Refinement and Probabilistic Choice
• scientific article; zbMATH DE number 1435946 (Why is no real title available?)
• CONCUR 2003 - Concurrency Theory
• Processes, systems \& tests: defining contextual equivalences
• Structure of concurrency
• Bisimulation and action refinement

This page was built for publication:

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