Branching time and abstraction in bisimulation semantics
From MaRDI portal
Publication:4371679
DOI10.1145/233551.233556zbMath0882.68085OpenAlexW1985161650MaRDI QIDQ4371679
W. P. Weijland, Robert J. van Glabbeek
Publication date: 21 January 1998
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://ir.cwi.nl/pub/5564
Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (only showing first 100 items - show all)
Characteristic formulae for fixed-point semantics: a general framework ⋮ An O ( m log n ) Algorithm for Computing Stuttering Equivalence and Branching Bisimulation ⋮ Pushdown Automata and Context-Free Grammars in Bisimulation Semantics ⋮ Partial-Order Reduction ⋮ Process Algebra and Model Checking ⋮ Discrete time process algebra with abstraction ⋮ Bisimulation as a logical relation ⋮ Concurrent bisimulations in Petri nets ⋮ On the Executability of Interactive Computation ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Confluence of processes and systems of objects ⋮ On divergence-sensitive weak probabilistic bisimilarity ⋮ Axiomatizing flat iteration ⋮ Weighted and branching bisimilarities from generalized open maps ⋮ Secure Implementation of Asynchronous Method Calls and Futures ⋮ Back to the format: a survey on SOS for probabilistic processes ⋮ Reactive bisimulation semantics for a process algebra with timeouts ⋮ Probabilistic weak bisimulation and axiomatization for probabilistic models ⋮ Equivalence checking 40 years after: a review of bisimulation tools ⋮ Apartness and distinguishing formulas in Hennessy-Milner logic ⋮ A predicate transformer for choreographies. Computing preconditions in choreographic programming ⋮ Comparing the expressiveness of the \(\pi \)-calculus and CCS ⋮ Minimisation of spatial models using branching bisimilarity ⋮ Expressiveness modulo bisimilarity of regular expressions with parallel composition ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Model Based Importance Analysis for Minimal Cut Sets ⋮ A Context-Free Process as a Pushdown Automaton ⋮ Unnamed Item ⋮ A ground-complete axiomatisation of finite-state processes in a generic process algebra ⋮ Efficient local correctness checking for single and alternating boolean equation systems ⋮ Confluence Reduction for Probabilistic Systems ⋮ Distributed Control of Discrete-Event Systems: A First Step ⋮ An O(m log n) algorithm for branching bisimilarity on labelled transition systems ⋮ Sharp Congruences Adequate with Temporal Logics Combining Weak and Strong Modalities ⋮ Causal Semantics for BPP Nets with Silent Moves ⋮ Embedding Untimed into Timed Process Algebra; the Case for Explicit Termination ⋮ Complete Axiomatization for Divergent-Sensitive Bisimulations in Basic Process Algebra with Prefix Iteration ⋮ Branching Bisimulation Congruence for Probabilistic Systems ⋮ Unnamed Item ⋮ A Basic Parallel Process as a Parallel Pushdown Automaton ⋮ Normed Processes, Unique Decomposition, and Complexity of Bisimulation Equivalences ⋮ Adaptation of Open Component-Based Systems ⋮ Quantales, finite observations and strong bisimulation ⋮ Deciding bisimulation-like equivalences with finite-state processes ⋮ Inheritance of behavior ⋮ On Compositionality, Efficiency, and Applicability of Abstraction in Probabilistic Systems ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Inheritance of workflows: An approach to tackling problems related to change ⋮ Process algebra for performance evaluation ⋮ On the semantics of durational actions ⋮ Non-regular iterators in process algebra ⋮ The How and Why of Interactive Markov Chains ⋮ Proved trees ⋮ Refining the Process Rewrite Systems Hierarchy via Ground Tree Rewrite Systems ⋮ Folk Theorems on the Correspondence between State-Based and Event-Based Systems ⋮ Refining the Process Rewrite Systems Hierarchy via Ground Tree Rewrite Systems ⋮ Thread algebra for noninterference ⋮ Unnamed Item ⋮ Reactive Turing Machines ⋮ Bisimulations Meet PCTL Equivalences for Probabilistic Automata ⋮ Canonical Solutions to Recursive Equations and Completeness of Equational Axiomatisations. ⋮ Branching Bisimulation Games ⋮ Efficient on-the-fly Algorithm for Checking Alternating Timed Simulation ⋮ Axiomatizing Weak Ready Simulation Semantics over BCCSP ⋮ The Value-Passing Calculus ⋮ Compositional weak metrics for group key update ⋮ Divide and congruence III: Stability & divergence ⋮ Unnamed Item ⋮ Remarks on Testing Probabilistic Processes ⋮ Bisimulation and Simulation Relations for Markov Chains ⋮ Parallel Processes with Implicit Computational Capital ⋮ Process languages with discrete relative time based on the ordered SOS format and rooted eager bisimulation ⋮ When is partial trace equivalence adequate? ⋮ Model independent approach to probabilistic models ⋮ Timed process calculi with deterministic or stochastic delays: commuting between durational and durationless actions ⋮ Branching time and orthogonal bisimulation equivalence ⋮ Bisimulation maps in presheaf categories ⋮ Operational semantics for Petri net components ⋮ Focus points and convergent process operators: A proof strategy for protocol verification ⋮ Formal modelling and verification of GALS systems using GRL and CADP ⋮ Branching bisimilarity is an equivalence indeed! ⋮ Priority and abstraction in process algebra ⋮ Compositional verification of concurrent systems by combining bisimulations ⋮ Cones and foci: A mechanical framework for protocol verification ⋮ Comparative branching-time semantics for Markov chains ⋮ Preferential choice and coordination conditions ⋮ Probabilistic bisimulation for realistic schedulers ⋮ A generic framework for checking semantic equivalences between pushdown automata and finite-state automata ⋮ A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences ⋮ Divide and congruence. II: From decomposition of modal formulas to preservation of delay and weak bisimilarity ⋮ Out for coffee: with Rob ⋮ All congruences below stability-preserving fair testing or CFFD ⋮ Coupled similarity: the first 32 years ⋮ On the probabilistic bisimulation spectrum with silent moves ⋮ A linear-time branching-time perspective on interface automata ⋮ Characteristic invariants in Hennessy-Milner logic
This page was built for publication: Branching time and abstraction in bisimulation semantics
