\textsc{ULTraS} at work: compositionality metaresults for bisimulation and trace semantics

DOI10.1016/j.jlamp.2017.10.002zbMath1381.68195OpenAlexW2766461508MaRDI QIDQ1683708

Marco Bernardo

Publication date: 1 December 2017

Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jlamp.2017.10.002

zbMATH Keywords

compositionalitytrace semanticsbehavioral metamodelsbisimulation semantics

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (2)

Towards general axiomatizations for bisimilarity and trace semantics ⋮ Logical characterization of fluid equivalences

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences
• Structural operational semantics for non-deterministic processes with quantitative aspects
• Probabilistic communicating processes
• Handbook of weighted automata
• Bisimulation through probabilistic testing
• A theory of timed automata
• Approximating labelled Markov processes
• Automatic verification of real-time systems with discrete probability distributions.
• Reactive, generative, and stratified models of probabilistic processes
• Relating strong behavioral equivalences for processes with nondeterminism and probabilities
• Revisiting bisimilarity and its modal logic for nondeterministic and probabilistic processes
• Non-bisimulation-based Markovian behavioral equivalences
• Finite state Markovian decision processes
• Structural Operational Semantics for Weighted Transition Systems
• Bisimulation of Labelled State-to-Function Transition Systems Coalgebraically
• Bisimulation and Logical Preservation for Continuous-Time Markov Decision Processes
• A Theory of Communicating Sequential Processes
• Algebraic laws for nondeterminism and concurrency
• Formal verification of parallel programs
• Bisimulations Meet PCTL Equivalences for Probabilistic Automata
• Revisiting Trace and Testing Equivalences for Nondeterministic and Probabilistic Processes
• A uniform definition of stochastic process calculi
• Foundations of Software Science and Computational Structures
• Scalar Outcomes Suffice for Finitary Probabilistic Testing

This page was built for publication: \textsc{ULTraS} at work: compositionality metaresults for bisimulation and trace semantics