Structural operational semantics for weak bisimulations
From MaRDI portal
Recommendations
- Structured operational semantics and bisimulation as a congruence
- Structural operational semantics and bounded nondeterminism
- A structural approach to operational semantics
- Formal Methods in Computer-Aided Design
- Bialgebras for structural operational semantics: an introduction
- Operational semantics and generalized weakest preconditions
- Structural Operational Semantics for Weighted Transition Systems
- Structuring operational semantics: simplification and computation
- Weak Bisimulation Approximants
- Towards weak bisimulation for coalgebras
Cites work
- A calculus of communicating systems
- A complete axiomatisation for observational congruence of finite-state behaviours
- A structural approach to operational semantics
- A Theory of Communicating Sequential Processes
- Algebraic laws for nondeterminism and concurrency
- Bisimulation can't be traced
- Branching time and abstraction in bisimulation semantics
- Calculi for synchrony and asynchrony
- Concurrent testing of processes
- scientific article; zbMATH DE number 4016181 (Why is no real title available?)
- scientific article; zbMATH DE number 3744561 (Why is no real title available?)
- scientific article; zbMATH DE number 42752 (Why is no real title available?)
- scientific article; zbMATH DE number 177854 (Why is no real title available?)
- Observation equivalence as a testing equivalence
- Process Algebra
- Structured operational semantics and bisimulation as a congruence
- Transition system specifications with negative premises
- Turning SOS rules into equations
Cited in
(41)- Structured operational semantics and bisimulation as a congruence
- A conservative look at operational semantics with variable binding
- Operational semantics and generalized weakest preconditions
- Branching bisimilarity is an equivalence indeed!
- Towards a unified view of bisimulation: A comparative study
- Finite axiom systems for testing preorder and De Simone process languages
- Language preorder as a precongruence
- Divide and congruence. II: From decomposition of modal formulas to preservation of delay and weak bisimilarity
- Tile formats for located and mobile systems.
- Bisimilarity of open terms.
- Ordered SOS process languages for branching and eager bisimulations
- Rule formats for compositional non-interference properties
- Process languages with discrete relative time based on the ordered SOS format and rooted eager bisimulation
- A format for semantic equivalence comparison
- Rooted branching bisimulation as a congruence
- Probabilistic divide \& congruence: branching bisimilarity
- Ensuring liveness properties of distributed systems: open problems
- Reusing artifact-centric business process models: a behavioral consistent specialization approach
- Divide and congruence. III: From decomposition of modal formulas to preservation of stability and divergence
- On constructibility and unconstructibility of LTS operators from other LTS operators
- The expressiveness of CSP with priority
- Modelling and analysing neural networks using a hybrid process algebra
- Notes on generative probabilistic bisimulation
- Weak bisimilarity coalgebraically
- Weak bisimulation as a congruence in MSOS
- scientific article; zbMATH DE number 6828930 (Why is no real title available?)
- Up-to techniques for branching bisimilarity
- New Bisimulation Semantics for Distributed Systems
- Divide and congruence: from decomposition of modal formulas to preservation of branching and -bisimilarity
- Modular bisimulation theory for computations and values
- Bisimulations of probabilistic Boolean networks
- A general account of coinduction up-to
- Theoretical Aspects of Computing – ICTAC 2005
- On cool congruence formats for weak bisimulations
- Non finite axiomatisability of weak bisimulation-based congruences
- Bialgebraic reasoning on higher-order program equivalence
- Rooted branching bisimulation as a congruence for probabilistic transition systems
- Fair testing
- SOS formats and meta-theory: 20 years after
- Non-expansive \(\varepsilon\)-bisimulations for probabilistic processes
- A precongruence format for should testing preorder
This page was built for publication: Structural operational semantics for weak bisimulations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q673123)
