scientific article

No author found.

Publication date: 11 October 2001

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Collections of articles of miscellaneous specific interest (00B15) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to computer science (68-00)

Related Items

Bisimilar and logically equivalent programs in PDL with parallel operator, The origins of structural operational semantics, Bisimilar and logically equivalent programs in PDL, Verification of $\mathrm{EB}^3$ specifications using CADP, CSP-CASL -- a new integration of process algebra and algebraic specification, Algebraic-coalgebraic specification in CoCASL, Non-bisimulation-based Markovian behavioral equivalences, Ultraproducts and possible worlds semantics in institutions, Infinite unfair shuffles and associativity, Process Algebra and Model Checking, What is a free name in a process algebra?, Computation as social agency: what, how and who, Priority and abstraction in process algebra, The \$-calculus process algebra for problem solving: A paradigmatic shift in handling hard computational problems, Bisimulation on speed: Lower time bounds, Unnamed Item, Behavioural equivalences of a probabilistic pi-calculus, Unnamed Item, Bisimulation on speed: Worst-case efficiency, Conjunction on processes: Full abstraction via ready-tree semantics, A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences, Arithmetical datatypes with true fractions, Concurrent weighted logic, Algebraic theory of probabilistic processes., On the axiomatisability of priority. III: Priority strikes again, A Simpler Alternative: Minimizing Transition Systems Modulo Alternating Simulation Equivalence, Back to the format: a survey on SOS for probabilistic processes, Towards a process calculus for REST: current state of the art, Attributed transition systems with hidden transitions, Unnamed Item, Mathematical modal logic: A view of its evolution, Unguarded recursion on coinductive resumptions, Unifying Guarded and Unguarded Iteration, Unnamed Item, Relational Concurrent Refinement: Automata, Team bisimilarity, and its associated modal logic, for BPP nets, Tracking Information, Towards general axiomatizations for bisimilarity and trace semantics, More Relational Concurrent Refinement: Traces and Partial Relations, Analysis of the structure of attributed transition systems without hidden transitions, FSP and FLTL framework for specification and verification of middle-agents, Cryptographic protocol logic: satisfaction for (timed) Dolev-Yao cryptography, Unnamed Item, Relating strong behavioral equivalences for processes with nondeterminism and probabilities, Dynamic consistency in process algebra: from paradigm to ACP, Safe reasoning with logic LTS, Metrics for weighted transition systems: axiomatization and complexity, Changing system interfaces consistently: a new refinement strategy for CSP$\|$B, Dynamic Consistency in Process Algebra: From Paradigm to ACP, Measuring the confinement of probabilistic systems, Generating models of infinite-state communication protocols using regular inference with abstraction, A Complete Axiomatic System for a Process-Based Spatial Logic, Unnamed Item, A brief history of process algebra, On the usability of process algebra: An architectural view, Ready simulation for concurrency: it's logical!, Bisimulation on speed: a unified approach, A metalanguage for guarded iteration, An axiomatic semantics for $\mathsf{ioco} \underline{\mathsf{s}}$ conformance relation, Changing System Interfaces Consistently: A New Refinement Strategy for CSP||B, Modelling Divergence in Relational Concurrent Refinement, Fifty years of Hoare's logic, Systems specification by basic protocols, Tempus fugit: How to plug it, The How and Why of Interactive Markov Chains, Transactional Reduction of Component Compositions, Decidable Extensions of Hennessy-Milner Logic, On the semantics of communicating hardware processes and their translation into LOTOS for the verification of asynchronous circuits with CADP, Relational concurrent refinement. III: Traces, partial relations and automata, Equivalence Checking for a Finite Higher Order π-Calculus, Unnamed Item, The linear time-branching time spectrum of equivalences for stochastic systems with non-determinism, Modelling simultaneous games in dynamic logic, A Behavioural Theory of Recursive Algorithms, A new game equivalence, its logic and algebra, Uncertainty representation in dynamical systems using rough set theory, On linear logic planning and concurrency, A Logical Process Calculus, Processes against tests: on defining contextual equivalences, Synchronized shuffles, Probabilistic temporal logics via the modal mu-calculus, Final coalgebras and the Hennessy-Milner property, Process algebras for systems diagnosis., A Formalization of Anonymity and Onion Routing, On Probabilistic Techniques for Data Flow Analysis, Compositional verification of asynchronous concurrent systems using CADP, Denotational fixed-point semantics for constructive scheduling of synchronous concurrency, Process-algebraic approaches for multi-agent systems: an overview