Precongruence Formats for Decorated Trace Semantics
B. Bloom, W. J. Fokkink, R. J. van Glabbeek
Abstract
This paper explores the connection between semantic equivalences and preorders for concrete sequential processes, represented by means of labelled transition systems, and formats of transition system specifications using Plotkin's structural approach. For several preorders in the linear time - branching time spectrum a format is given, as general as possible, such that this preorder is a precongruence for all operators specifiable in that format. The formats are derived using the modal characterizations of the corresponding preorders.
Create a lesson
Related papers
Global Trace Condition for Injective Transition Graphs
Stefano Berardi, Ugo de'Liguoro, Daniel Osorio-Valencia
Aero-VPA: Few-Step Flow-Matching Control over Non-Reconstructive JEPA Latents for Agile Flight on Edge Hardware
Yeonseok Lee
Polynomial VASS MDPs
Michal Ajdarow
Proceedings 23rd International Conference on Quantum Physics and Logic
John van de Wetering, Ognyan Oreshkov, Ana Belén Sainz
Final coalgebras over R-modules
Oisín Flynn-Connolly, Henning Basold, Chase Ford
Propositional Dynamic Logic with Program Costs
Krishna Manoorkar, Wolfgang Poiger