Bisimulation can't be traced

DOI10.1145/200836.200876zbMATH Open0886.68027OpenAlexW1966112122MaRDI QIDQ4369863FDOQ4369863

Authors: Bard Bloom, Albert R. Meyer, Sorin Istrail 

Publication date: 2 February 1998

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://hdl.handle.net/1813/6990

Recommendations

• Trace simulation semantics is not finitely based over BCCSP
• scientific article; zbMATH DE number 4166873
• Bisimulation and divergence
• scientific article; zbMATH DE number 1222559
• Bisimulation and effectiveness
• Bisimulation by unification
• Unprovability of the logical characterization of bisimulation
• Bisimulation and action refinement
• scientific article; zbMATH DE number 176514
• Bisimulation and co-induction: some problems

zbMATH Keywords

bisimulationready simulationconcurrent language CCS

Mathematics Subject Classification ID

Theory of programming languages (68N15)

Cited In (only showing first 100 items - show all)

• Probabilistic divide \& congruence: branching bisimilarity
• Modelling and analysing neural networks using a hybrid process algebra
• Rational operational models
• Turing machines, transition systems, and interaction
• On the expressibility of priority
• A process algebraic view of input/output automata
• Bialgebraic methods in structural operational semantics (invited talk)
• Bialgebras for structural operational semantics: an introduction
• Conjunction on processes: Full abstraction via ready-tree semantics
• Structural operational semantics for weak bisimulations
• Category theory for operational semantics
• Title not available (Why is that?)
• Divide and congruence: from decomposition of modal formulas to preservation of branching and \(\eta \)-bisimilarity
• Rule formats for timed processes
• On the axiomatisability of priority
• An axiomatic semantics for Esterel
• Ready simulation for concurrency: it's logical!
• Turing machines, transition systems, and interaction
• Structural operational semantics and modal logic, revisited
• Modular bisimulation theory for computations and values
• On the axiomatizability of priority. II
• SOS rule formats for zero and unit elements
• SOS formats and meta-theory: 20 years after
• On cool congruence formats for weak bisimulations
• Algebraic specification of agent computation
• Finite axiom systems for testing preorder and De Simone process languages
• A congruence rule format for name-passing process calculi
• Transition system specifications with negative premises
• SOS specifications for uniformly continuous operators
• A conservative look at operational semantics with variable binding
• Sequent calculi for process verification: Hennessy-Milner logic for an arbitrary GSOS
• Quantales, finite observations and strong bisimulation
• Observation equivalence as a testing equivalence
• Structural operational semantics for continuous state stochastic transition systems
• Testing equivalence as a bisimulation equivalence
• Semantics and expressiveness of ordered SOS
• A \(\pi \)-calculus with explicit substitutions: the late semantics
• Branching bisimulation for probabilistic systems: characteristics and decidability
• The expressiveness of CSP with priority
• Rule formats for distributivity
• Weak bisimulation as a congruence in MSOS
• Ordered SOS process languages for branching and eager bisimulations
• On rule formats for zero and unit elements
• Bisimilarity of open terms.
• Axiomatizing GSOS with termination
• Trace-based verification of imperative programs with I/O
• Rooted branching bisimulation as a congruence
• Compositional bisimulation metric reasoning with Probabilistic Process Calculi
• Notions of bisimulation and congruence formats for SOS with data
• Structural congruence for bialgebraic semantics
• The power of reachability testing for timed automata
• A stable programming language
• Process languages with discrete relative time based on the ordered SOS format and rooted eager bisimulation
• Compositionality of Hennessy-Milner logic by structural operational semantics
• On recursive operations over logic LTS
• SOS rule formats for idempotent terms and idempotent unary operators
• Characteristic formulae for timed autoamta
• The max-plus algebra of the natural numbers has no finite equational basis
• GSOS for probabilistic transition systems (extended abstract)
• Two-thirds simulation indexes and modal logic characterization
• A coalgebraic presentation of structured transition systems
• Structural Operational Semantics for Weighted Transition Systems
• Bisimulations for communicating transactions (extended abstract)
• A comparison of Statecharts step semantics
• Deciding bisimulation equivalences for a class of non-finite-state programs
• Fair testing
• Compositional SOS and beyond: A coalgebraic view of open systems
• Impossible futures and determinism
• Structural operational semantics for non-deterministic processes with quantitative aspects
• Some undecidable properties of SOS specifications
• Ensuring liveness properties of distributed systems: open problems
• Structural operational semantics for stochastic and weighted transition systems
• Adding recursive constructs to bialgebraic semantics
• The meaning of negative premises in transition system specifications. II
• Non-deterministic structures of computation
• Compositional weak metrics for group key update
• Enhanced coalgebraic bisimulation
• Bialgebraic methods and modal logic in structural operational semantics
• A general account of coinduction up-to
• Title not available (Why is that?)
• Proving the validity of equations in GSOS languages using rule-matching bisimilarity
• When are prime formulae characteristic?
• Axiomatizing weak ready simulation semantics over BCCSP
• The equational theory of weak complete simulation semantics over BCCSP
• SOS-based modal decomposition on nondeterministic probabilistic processes
• CSP is a retract of CCS
• Open maps, behavioural equivalences, and congruences
• Dynamic connectors for concurrency
• Coinductive Characterisations Reveal Nice Relations Between Preorders and Equivalences
• Title not available (Why is that?)
• Title not available (Why is that?)
• Divergence and unique solution of equations
• Up-to techniques for branching bisimilarity
• Tile formats for located and mobile systems.
• Basic observables for processes
• Back to the format: a survey on SOS for probabilistic processes
• From rewrite rules to bisimulation congruences
• A precongruence format for should testing preorder
• The equational theory of prebisimilarity over basic CCS with divergence
• Natural Quantum Operational Semantics with Predicates

This page was built for publication: Bisimulation can't be traced

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4369863)