scientific article; zbMATH DE number 1412988
From MaRDI portal
zbMATH Open0941.68087MaRDI QIDQ4941495FDOQ4941495
Authors: Wan Fokkink 
Publication date: 9 March 2000
Title of this publication is not available (Why is that?)
Recommendations
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)
Cited In (71)
- Runtime composition of systems of interacting cyber-physical components
- A full process algebraic representation of ant colony optimization
- Focus points and convergent process operators
- External behaviour of systems of state machines with variables
- A Generic Process Algebra
- Modeling for Verification
- Modelling mutual exclusion in a process algebra with time-outs
- Defining actions in concurrent declarative programming
- Interleaving strategies
- Independence abstractions and models of concurrency
- Analyzing a \(\chi\) model of a turntable system using Spin, CADP and Uppaal
- Correctness checking of a quantum protocol for reliable communications via feedback
- Process algebra and model checking
- A theory of stochastic systems. II: Process algebra
- Automatic verification of distributed systems: the process algebra approach.
- Special issue: Process algebra
- Process Algebra
- Title not available (Why is that?)
- Dynamic consistency in process algebra: from paradigm to ACP
- Process algebra with strategic interleaving
- Program algebra with a jump-shift instruction
- Derivation tree analysis for accelerated fixed-point computation
- Bisimilar and logically equivalent programs in PDL
- Towards modelling of local reversibility
- Title not available (Why is that?)
- Inheritance of behavior
- An axiomatization for quantum processes to unifying quantum and classical computing
- Entanglement in quantum process algebra
- Formal verification for KMB09 protocol
- Probabilistic process algebra to unifying quantum and classical computing in closed systems
- Linearization in parallel pCRL
- Process algebra: equational theories of communicating processes. With forewords by Tony Hoare, Robin Milner and Jan Bergstra.
- SAT-based verification for timed component connectors
- Global renaming operators in concrete process algebra
- Equivalence of recursive specifications in process algebra
- Bisimilar and logically equivalent programs in PDL with parallel operator
- A process calculus with finitary comprehended terms
- Process algebra and conditional composition
- Non-regular iterators in process algebra
- Analysis of a distributed system for lifting trucks.
- Modelling of DNA mismatch repair with a reversible process calculus
- A structural approach to graph transformation based on symmetric Petri nets
- Matching logic explained
- Automated verification of automata communicating via FIFO and bag buffers
- Axiomatizing GSOS with termination
- Revisiting sequential composition in process calculi
- A formalization of anonymity and onion routing
- On the semantics of communicating hardware processes and their translation into LOTOS for the verification of asynchronous circuits with CADP
- Process algebra with recursive operations
- Congruence from the operator's point of view. Syntactic requirements on modal characterizations
- Formal enforcement of security policies on concurrent systems
- A brief history of process algebra
- On the usability of process algebra: An architectural view
- A formal framework for distributed cyber-physical systems
- Towards a process calculus for REST: current state of the art
- Applications of Process Algebra
- Execution architectures for program algebra
- A unified rule format for bounded nondeterminism in SOS with terms as labels
- Reactive bisimulation semantics for a process algebra with timeouts
- The cones and foci proof technique for timed transition systems
- Algebra unifies operational calculi
- Title not available (Why is that?)
- Title not available (Why is that?)
- A propositional dynamic logic for concurrent programs based on the \(\pi\)-calculus
- Branching time and orthogonal bisimulation equivalence
- Communicating Sequential Processes. The First 25 Years
- Ensuring liveness properties of distributed systems: open problems
- Processes with infinite liveness requirements
- Title not available (Why is that?)
- Process algebras as support for sustainable systems of services
- Modeling and verification of reconfigurable printing system based on process algebra
Uses Software
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4941495)
