Precongruence formats for decorated trace semantics
From MaRDI portal
Publication:5277691
DOI10.1145/963927.963929zbMath1367.68209arXivcs/0204039MaRDI QIDQ5277691
Bard Bloom, W. J. Fokkink, Robert J. van Glabbeek
Publication date: 12 July 2017
Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/cs/0204039
68Q55: Semantics in the theory of computing
68Q60: Specification and verification (program logics, model checking, etc.)
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Related Items
Unnamed Item, Divide and congruence III: Stability & divergence, Back to the format: a survey on SOS for probabilistic processes, Divide and congruence: from decomposition of modal formulas to preservation of branching and \(\eta \)-bisimilarity, SOS formats and meta-theory: 20 years after, A precongruence format for should testing preorder, Bialgebraic methods and modal logic in structural operational semantics, SOS specifications for uniformly continuous operators, Divide and congruence. II: From decomposition of modal formulas to preservation of delay and weak bisimilarity, Verification of asynchronous systems with an unspecified component, A comparison of Statecharts step semantics, Probabilistic divide \& congruence: branching bisimilarity, Ensuring liveness properties of distributed systems: open problems, Out for coffee: with Rob, Congruence from the operator's point of view. Syntactic requirements on modal characterizations, Divide and congruence. III: From decomposition of modal formulas to preservation of stability and divergence, Compositionality of Hennessy-Milner logic by structural operational semantics, When are prime formulae characteristic?, Logical characterisations, rule formats and compositionality for input-output conformance simulation, The expressiveness of CSP with priority, Modal logic and the approximation induction principle, Proving the validity of equations in GSOS languages using rule-matching bisimilarity, Compositional Reasoning for Multi-modal Logics, A Pre-congruence Format for XY-simulation
