Computing property-preserving behaviour abstractions from trace reductions

DOI10.1145/383962.384027zbMath1333.68180MaRDI QIDQ2787684

Ulrich Ultes-Nitsche, Simon st. James

Publication date: 4 March 2016

Published in: Proceedings of the twentieth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/383962.384027

zbMATH Keywords

partial-order methods; behaviour abstraction; satisfaction within fairness; trace reduction; weakly continuation-closed homomorphisms

Mathematics Subject Classification ID

68Q60: Specification and verification (program logics, model checking, etc.)

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

68M14: Distributed systems