scientific article; zbMATH DE number 1412988

Publication date: 9 March 2000

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

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (53)

Bisimilar and logically equivalent programs in PDL with parallel operator ⋮ Axiomatizing GSOS with termination ⋮ Bisimilar and logically equivalent programs in PDL ⋮ Branching time and orthogonal bisimulation equivalence ⋮ Modeling for Verification ⋮ Algebra Unifies Operational Calculi ⋮ Modelling of DNA mismatch repair with a reversible process calculus ⋮ A Propositional Dynamic Logic for Concurrent Programs Based on the π-Calculus ⋮ Automated verification of automata communicating via FIFO and bag buffers ⋮ A formal framework for distributed cyber-physical systems ⋮ A unified rule format for bounded nondeterminism in SOS with terms as labels ⋮ Execution architectures for program algebra ⋮ Processes with infinite liveness requirements ⋮ A process calculus with finitary comprehended terms ⋮ Congruence from the operator's point of view. Syntactic requirements on modal characterizations ⋮ Revisiting sequential composition in process calculi ⋮ Modelling mutual exclusion in a process algebra with time-outs ⋮ Analysis of a distributed system for lifting trucks. ⋮ A full process algebraic representation of ant colony optimization ⋮ Reactive bisimulation semantics for a process algebra with timeouts ⋮ Independence Abstractions and Models of Concurrency ⋮ Towards a process calculus for REST: current state of the art ⋮ SAT-based verification for timed component connectors ⋮ Unnamed Item ⋮ Modeling and verification of reconfigurable printing system based on process algebra ⋮ Program algebra with a jump-shift instruction ⋮ Process algebra with strategic interleaving ⋮ Dynamic consistency in process algebra: from paradigm to ACP ⋮ Derivation tree analysis for accelerated fixed-point computation ⋮ An axiomatization for quantum processes to unifying quantum and classical computing ⋮ Probabilistic process algebra to unifying quantum and classical computing in closed systems ⋮ Entanglement in quantum process algebra ⋮ Formal verification for KMB09 protocol ⋮ Ensuring liveness properties of distributed systems: open problems ⋮ Inheritance of behavior ⋮ Linearization in parallel pCRL ⋮ Unnamed Item ⋮ Formal enforcement of security policies on concurrent systems ⋮ Non-regular iterators in process algebra ⋮ Interleaving Strategies ⋮ Matching logic explained ⋮ A structural approach to graph transformation based on symmetric Petri nets ⋮ On the semantics of communicating hardware processes and their translation into LOTOS for the verification of asynchronous circuits with CADP ⋮ Towards Modelling of Local Reversibility ⋮ Correctness checking of a quantum protocol for reliable communications via feedback ⋮ Defining Actions in Concurrent Declarative Programming ⋮ Analyzing a \(\chi\) model of a turntable system using Spin, CADP and Uppaal ⋮ A theory of stochastic systems. II: Process algebra ⋮ A Formalization of Anonymity and Onion Routing ⋮ The cones and foci proof technique for timed transition systems ⋮ Process algebra and conditional composition ⋮ Equivalence of recursive specifications in process algebra ⋮ Process algebras as support for sustainable systems of services

Uses Software

PVS

This page was built for publication: