Metric Semantics and Full Abstractness for Action Refinement and Probabilistic Choice

DOI10.1016/S1571-0661(05)80038-6zbMath1264.68104MaRDI QIDQ4923369

E. P. de Vink, J. W. de Bakker, Jerry den Hartog

Publication date: 6 June 2013

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

Mathematics Subject Classification ID

Fixed-point theorems (47H10) Semantics in the theory of computing (68Q55) Miscellaneous applications of functional analysis (46N99)

Related Items

Linking operational semantics and algebraic semantics for a probabilistic timed shared-variable language ⋮ The complexity space of partial functions: a connection between complexity analysis and denotational semantics ⋮ Unnamed Item

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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Modular construction and partial order semantics of Petri nets
• Probabilistic communicating processes
• Refinement of actions in event structures and causal trees
• Failures semantics based on interval semiwords is a congruence for refinement
• Bisimulation through probabilistic testing
• Reactive, generative, and stratified models of probabilistic processes
• A causal operational semantics of action refinement
• Comparing syntactic and semantic action refinement
• Bisimulation for probabilistic transition systems: A coalgebraic approach
• Towards action-refinement in process algebras

This page was built for publication: Metric Semantics and Full Abstractness for Action Refinement and Probabilistic Choice