Bisimulation can't be traced
From MaRDI portal
Publication:4369863
DOI10.1145/200836.200876zbMath0886.68027MaRDI 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
68N15: Theory of programming languages
Related Items
On the axiomatisability of priority, Variable binding operators in transition system specifications, Quantales, finite observations and strong bisimulation, A coalgebraic presentation of structured transition systems, From rewrite rules to bisimulation congruences, Explicit substitutions for \(\pi\)-congruences, An axiomatic semantics for Esterel, Observation equivalence as a testing equivalence, Structural operational semantics for weak bisimulations, A process algebraic view of input/output automata, Transition system specifications with negative premises, Category theory for operational semantics, Turing machines, transition systems, and interaction, Algebraic specification of agent computation, Fair testing, Conjunction on processes: Full abstraction via ready-tree semantics, SOS formats and meta-theory: 20 years after, A conservative look at operational semantics with variable binding, When is partial trace equivalence adequate?, A \(\pi\)-calculus with explicit substitutions, Open maps, behavioural equivalences, and congruences, A general conservative extension theorem in process algebras with inequalities, The power of reachability testing for timed automata, Finite axiom systems for testing preorder and De Simone process languages, Dynamic connectors for concurrency, Compositional SOS and beyond: A coalgebraic view of open systems, Impossible futures and determinism, Observational congruences for dynamically reconfigurable tile systems, A comparison of Statecharts step semantics, Tile formats for located and mobile systems., Bisimilarity of open terms., Ordered SOS process languages for branching and eager bisimulations, The max-plus algebra of the natural numbers has no finite equational basis, 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, A format for semantic equivalence comparison, Rooted branching bisimulation as a congruence, Testing equivalence as a bisimulation equivalence, Compositionality of Hennessy-Milner logic by structural operational semantics, A semantic framework for open processes, Notions of bisimulation and congruence formats for SOS with data, Branching bisimulation for probabilistic systems: characteristics and decidability, A stable programming language, Characteristic Formulae for Timed Automata, Branching vs. Linear Time: Semantical Perspective, Correcting a Space-Efficient Simulation Algorithm, New Bisimulation Semantics for Distributed Systems
