\textsc{ULTraS} at work: compositionality metaresults for bisimulation and trace semantics
type: Item
instance of: scholarly article
title: \textsc{ULTraS} at work: compositionality metaresults for bisimulation and trace semantics
zbMATH Open document ID: 1381.68195
author: Marco Bernardo
published in: Journal of Logical and Algebraic Methods in Programming
publication date: 2017-12-01T00:00:00Z
Mathematics Subject Classification ID: 68Q85
Mathematics Subject Classification ID: 68Q55
zbMATH DE Number: 6814743
zbMATH Keywords: behavioral metamodels
zbMATH Keywords: compositionality
zbMATH Keywords: bisimulation semantics
zbMATH Keywords: trace semantics
MaRDI profile type: Publication
full work available at URL: j.jlamp.2017.10.002
OpenAlex ID: W2766461508
cites work: Structural operational semantics.
cites work: A theory of timed automata
cites work: Non-bisimulation-based Markovian behavioral equivalences
cites work: A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences
cites work: Revisiting Trace and Testing Equivalences for Nondeterministic and Probabilistic Processes
cites work: Relating strong behavioral equivalences for processes with nondeterminism and probabilities
cites work: Revisiting bisimilarity and its modal logic for nondeterministic and probabilistic processes
cites work: A Theory of Communicating Sequential Processes
cites work: Foundations of Software Science and Computational Structures
cites work: A uniform definition of stochastic process calculi
cites work: Scalar Outcomes Suffice for Finitary Probabilistic Testing
cites work: Finite state Markovian decision processes
cites work: Approximating labelled Markov processes
cites work: Handbook of weighted automata
cites work: The linear time -- branching time spectrum. I: The semantics of concrete, sequential processes.
cites work: Reactive, generative, and stratified models of probabilistic processes
cites work: Algebraic laws for nondeterminism and concurrency
cites work: Formal verification of parallel programs
cites work: Structural Operational Semantics for Weighted Transition Systems
cites work: Automatic verification of real-time systems with discrete probability distributions.
cites work: Bisimulation through probabilistic testing
cites work: Bisimulation of Labelled State-to-Function Transition Systems Coalgebraically
cites work: Structural operational semantics for non-deterministic processes with quantitative aspects
cites work: Bisimulation and Logical Preservation for Continuous-Time Markov Decision Processes
cites work: Q4315289
cites work: Probabilistic communicating processes
cites work: Bisimulations Meet PCTL Equivalences for Probabilistic Automata
cites work: Q4324960
cites work: Q4965819
DOI: 10.1016/J.JLAMP.2017.10.002
Recommended article: Towards general axiomatizations for bisimilarity and trace semantics
Recommended article: Compositionality and bisimulation: A negative result
Recommended article: Beyond Bisimulation: The “up-to” Techniques
Recommended article: Compositional bisimulation metric reasoning with Probabilistic Process Calculi
Recommended article: Q4261091
Recommended article: Q4608688
Recommended article: Compositional verification of concurrent systems by combining bisimulations
Recommended article: Deriving Bisimulation Congruences with Borrowed Contexts
Recommended article: A compositional protocol verification using relativized bisimulation
Recommended article: \(\tau\)-bisimulations and full abstraction for refinement of actions
description: scientific article; zbMATH DE number 6814743