Action refinement applied to late decisions

DOI10.1007/S00165-006-0088-YMaRDI QIDQ2432235zbMATH OpenOpenAlexFDO

Authors Harald Fecher, Mila Majster-Cederbaum

Publication date 25 October 2006

Published in Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00165-006-0088-y

zbMATH Keywords

action refinementcoarsest congruenceequivalenceevent structuretrue concurrency

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Taking decisions late: end-based choice combined with action refinement
• Refinement of actions and equivalence notions for concurrent systems
• scientific article; zbMATH DE number 4213438
• Bisimulation and action refinement
• Action refinement and equivalence notions for timed event structures

Cited in

(3)

• Taking decisions late: end-based choice combined with action refinement
• scientific article; zbMATH DE number 1795753 (Why is no real title available?)
• Refinement of actions and equivalence notions for concurrent systems

This page was built for publication: Action refinement applied to late decisions

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