Generating non-conspiratorial executions

DOI10.1016/J.IPL.2007.03.008MaRDI QIDQ2379964zbMATH OpenOpenAlexFDO

Authors J. L. Arjona, Rafael Corchuelo, David Ruiz

Publication date 24 March 2010

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://idus.us.es/handle/11441/66563

zbMATH Keywords

fairnessconcurrencydistributed systemsconspiraciesequivalence robustness

Mathematics Subject Classification ID

Theory of software (68N99)

Recommendations

• Distributed Computing
• Applications and Theory of Petri Nets 2004
• scientific article; zbMATH DE number 2104631
• Keep it fair: equivalences
• scientific article; zbMATH DE number 3901999

Cites work

• scientific article; zbMATH DE number 1927585 (Why is no real title available?)
• scientific article; zbMATH DE number 2090635 (Why is no real title available?)
• scientific article; zbMATH DE number 839543 (Why is no real title available?)
• Action systems in incremental and aspect-oriented modeling
• Distributed Computing
• Distributed cooperation with action systems
• Fairness and conspiracies
• Fairness and hyperfairness
• Fairness and hyperfairness in multi-party interactions
• Fairness and related properties in transition systems - a temporal logic to deal with fairness
• Fairness in systems based on multiparty interactions
• On equivalence-completions of fairness assumptions
• On fairness notions in distributed systems. I: A characterization of implementability
• On fairness notions in distributed systems. II: Equivalence-completions and their hierarchies
• Refinement of actions and equivalence notions for concurrent systems
• Refinement of fair action systems
• Two decentralized algorithms for strong interaction fairness for systems with unbounded speed variability

This page was built for publication: Generating non-conspiratorial executions

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