Bisimulation can't be traced
From MaRDI portal
Publication:4369863
DOI10.1145/200836.200876zbMath0886.68027OpenAlexW1966112122MaRDI QIDQ4369863
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
Related Items (only showing first 100 items - show all)
Modelling and analysing neural networks using a hybrid process algebra ⋮ Rational operational models ⋮ Characteristic formulae for fixed-point semantics: a general framework ⋮ Proving the validity of equations in GSOS languages using rule-matching bisimilarity ⋮ The meaning of negative premises in transition system specifications. II ⋮ Adding recursive constructs to bialgebraic semantics ⋮ Sequent calculi for process verification: Hennessy-Milner logic for an arbitrary GSOS ⋮ Axiomatizing GSOS with termination ⋮ Process languages with discrete relative time based on the ordered SOS format and rooted eager bisimulation ⋮ Non-strongly Stable Orders Also Define Interesting Simulation Relations ⋮ When is partial trace equivalence adequate? ⋮ Towards Bialgebraic Semantics for the Linear Time – Branching Time Spectrum ⋮ Testing equivalence as a bisimulation equivalence ⋮ The Equational Theory of Weak Complete Simulation Semantics over BCCSP ⋮ Compositionality of Hennessy-Milner logic by structural operational semantics ⋮ A format for semantic equivalence comparison ⋮ A general SOS theory for the specification of probabilistic transition systems ⋮ Ready to preorder: an algebraic and general proof ⋮ A \(\pi\)-calculus with explicit substitutions ⋮ Structural Operational Semantics and Modal Logic, Revisited ⋮ Structural congruence for bialgebraic semantics ⋮ Two-thirds simulation indexes and modal logic characterization ⋮ Fair testing ⋮ A unified rule format for bounded nondeterminism in SOS with terms as labels ⋮ Conjunction on processes: Full abstraction via ready-tree semantics ⋮ SOS formats and meta-theory: 20 years after ⋮ Structural operational semantics for stochastic and weighted transition systems ⋮ SOS specifications for uniformly continuous operators ⋮ Weak Bisimulation as a Congruence in MSOS ⋮ Divide and congruence. II: From decomposition of modal formulas to preservation of delay and weak bisimilarity ⋮ When Are Prime Formulae Characteristic? ⋮ Open maps, behavioural equivalences, and congruences ⋮ A general conservative extension theorem in process algebras with inequalities ⋮ Trace-based verification of imperative programs with I/O ⋮ Axiomatizing Lüttgen \& Vogler's ready simulation for finite processes in \(\mathrm{CLL}_{R}\) ⋮ The power of reachability testing for timed automata ⋮ Logical characterisations, rule formats and compositionality for input-output conformance simulation ⋮ On the axiomatisability of priority. III: Priority strikes again ⋮ Compositional equivalences based on open pNets ⋮ Divide and congruence: from decomposition of modal formulas to preservation of branching and \(\eta \)-bisimilarity ⋮ Complete and ready simulation semantics are not finitely based over BCCSP, even with a singleton alphabet ⋮ Logical Characterisations and Compositionality of Input-Output Conformance Simulation ⋮ SOS rule formats for idempotent terms and idempotent unary operators ⋮ Bialgebras for structural operational semantics: an introduction ⋮ Axiomatizing weak simulation semantics over BCCSP ⋮ Rooted branching bisimulation as a congruence ⋮ Characteristic Formulae for Timed Automata ⋮ A semantic framework for open processes ⋮ Structural operational semantics for weak bisimulations ⋮ A process algebraic view of input/output automata ⋮ Structural operational semantics for non-deterministic processes with quantitative aspects ⋮ Some undecidable properties of SOS specifications ⋮ Transition system specifications with negative premises ⋮ A general account of coinduction up-to ⋮ CSP is a retract of CCS ⋮ Rule formats for distributivity ⋮ Probabilistic divide \& congruence: branching bisimilarity ⋮ Notions of bisimulation and congruence formats for SOS with data ⋮ On the axiomatizability of priority. II ⋮ SOS rule formats for zero and unit elements ⋮ On cool congruence formats for weak bisimulations ⋮ Category theory for operational semantics ⋮ Turing machines, transition systems, and interaction ⋮ Ensuring liveness properties of distributed systems: open problems ⋮ A precongruence format for should testing preorder ⋮ The equational theory of prebisimilarity over basic CCS with divergence ⋮ On the expressibility of priority ⋮ Branching bisimulation for probabilistic systems: characteristics and decidability ⋮ A stable programming language ⋮ Divide and congruence. III: From decomposition of modal formulas to preservation of stability and divergence ⋮ Observational congruences for dynamically reconfigurable tile systems ⋮ Ready simulation for concurrency: it's logical! ⋮ Observation equivalence as a testing equivalence ⋮ An axiomatic semantics for \(\mathsf{ioco} \underline{\mathsf{s}}\) conformance relation ⋮ The expressiveness of CSP with priority ⋮ Refinement Sensitive Formal Semantics of State Machines With Persistent Choice ⋮ Semantics and expressiveness of ordered SOS ⋮ Generating priority rewrite systems for OSOS process languages ⋮ (Bi)simulations up-to characterise process semantics ⋮ A congruence rule format for name-passing process calculi ⋮ Bialgebraic methods and modal logic in structural operational semantics ⋮ Bialgebraic foundations for the operational semantics of string diagrams ⋮ A conservative look at operational semantics with variable binding ⋮ Rule Formats for Timed Processes ⋮ Finite axiom systems for testing preorder and De Simone process languages ⋮ GSOS for probabilistic transition systems ⋮ Distributive laws for monotone specifications ⋮ A comparison of Statecharts step semantics ⋮ Structural operational semantics for continuous state stochastic transition systems ⋮ Tile formats for located and mobile systems. ⋮ Bisimilarity of open terms. ⋮ Ordered SOS process languages for branching and eager bisimulations ⋮ Bialgebraic Methods in Structural Operational Semantics ⋮ Simulations Up-to and Canonical Preorders ⋮ Process Algebra Having Inherent Choice: Revised Semantics for Concurrent Systems ⋮ Dynamic connectors for concurrency ⋮ Compositional SOS and beyond: A coalgebraic view of open systems ⋮ Impossible futures and determinism ⋮ Algebraic specification of agent computation ⋮ The max-plus algebra of the natural numbers has no finite equational basis
This page was built for publication: Bisimulation can't be traced
