Towards general axiomatizations for bisimilarity and trace semantics
From MaRDI portal
Publication:2237336
DOI10.1007/978-3-030-73785-6_3OpenAlexW3155482678MaRDI QIDQ2237336
Publication date: 27 October 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-73785-6_3
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- Quantitative Kleene coalgebras
- Interactive Markov chains. And the quest for quantified quality
- Handbook of weighted automata
- A complete inference system for a class of regular behaviours
- Bisimulation through probabilistic testing
- A theory of timed automata
- Turning SOS rules into equations
- A logic for reasoning about time and reliability
- Automatic verification of real-time systems with discrete probability distributions.
- \textsc{ULTraS} at work: compositionality metaresults for bisimulation and trace semantics
- Alternative characterizations of probabilistic trace equivalences on coherent resolutions of nondeterminism
- Relating strong behavioral equivalences for processes with nondeterminism and probabilities
- Revisiting bisimilarity and its modal logic for nondeterministic and probabilistic processes
- Finite state Markovian decision processes
- Sound and Complete Axiomatizations of Coalgebraic Language Equivalence
- Structural Operational Semantics for Weighted Transition Systems
- Bisimulation of Labelled State-to-Function Transition Systems Coalgebraically
- A Theory of Communicating Sequential Processes
- Readies and Failures in the Algebra of Communicating Processes
- Formal verification of parallel programs
- On the discriminating power of passivation and higher-order interaction
- Bisimulations Meet PCTL Equivalences for Probabilistic Automata
- Revisiting Trace and Testing Equivalences for Nondeterministic and Probabilistic Processes
- Axiomatizing Bisimulation Equivalences and Metrics from Probabilistic SOS Rules
- A uniform definition of stochastic process calculi
- A Compositional Approach to Performance Modelling
- Sound and Complete Axiomatization of Trace Semantics for Probabilistic Systems
- Scalar Outcomes Suffice for Finitary Probabilistic Testing
- A complete axiomatisation for trace congruence of finite state behaviors
- CONCUR 2003 - Concurrency Theory
This page was built for publication: Towards general axiomatizations for bisimilarity and trace semantics