scientific article
From MaRDI portal
zbMath0474.68074MaRDI QIDQ3929062
Publication date: 1981
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Process languages with discrete relative time based on the ordered SOS format and rooted eager bisimulation, Termination, deadlock and divergence, A characterization of finitary bisimulation, Compositionality of Hennessy-Milner logic by structural operational semantics, Branching time and orthogonal bisimulation equivalence, A context dependent equivalence between processes, A domain equation for bisimulation, Mechanising a type-safe model of multithreaded Java with a verified compiler, SOS formats and meta-theory: 20 years after, Testing probabilistic equivalence through reinforcement learning, Unnamed Item, Divide and congruence. II: From decomposition of modal formulas to preservation of delay and weak bisimilarity, CPO models for a class of GSOS languages, On implementations and semantics of a concurrent programming language, Theory of interaction, Trade-offs in true concurrency: Pomsets and mazurkiewicz traces, Divide and congruence: from decomposition of modal formulas to preservation of branching and \(\eta \)-bisimilarity, More on bisimulations for higher order \(\pi\)-calculus, Proof systems for satisfiability in Hennessy-Milner logic with recursion, The name discipline of uniform receptiveness, Bisimulation through probabilistic testing, Axiomatizing weak simulation semantics over BCCSP, Rooted branching bisimulation as a congruence, Deciding orthogonal bisimulation, \(\pi\)-calculus, internal mobility, and agent-passing calculi, Structural operational semantics for weak bisimulations, Late and early semantics coincide for testing, Translations between modal logics of reactive systems, The \({\mathcal NU}\) system as a development system for concurrent programs: \(\delta{\mathcal NU}\), A compositional protocol verification using relativized bisimulation, Computing maximal weak and other bisimulations, Experimenting with process equivalence, Process calculus based upon evaluation to committed form, Graphical versus logical specifications, Bisimulation and action refinement, Structured operational semantics and bisimulation as a congruence, Lifting non-finite axiomatizability results to extensions of process algebras, On the computational complexity of bisimulation, redux, The equational theory of prebisimilarity over basic CCS with divergence, A fully abstract denotational model for observational precongruence, Quantales, finite observations and strong bisimulation, A fully abstract denotational semantics for the calculus of higher-order communicating systems, Agreement between conformance and composition, Modal logics for communicating systems, Refusal testing, Observation equivalence as a testing equivalence, Non-regular iterators in process algebra, Bisimulation and divergence, Process calculus based upon evaluation to committed form, On transformations of concurrent-object programs, Axiomatizing Weak Ready Simulation Semantics over BCCSP, Finite axiom systems for testing preorder and De Simone process languages, Processes against tests: on defining contextual equivalences, The compression structure of a process, Corrigendum: ``A domain equation for bisimulation by S. Abramsky, Ordered SOS process languages for branching and eager bisimulations, A proof-theoretic characterization of observational equivalence, Specification-oriented semantics for communicating processes, A logical characterization of observation equivalence
