A brief history of process algebra
From MaRDI portal
Publication:1781995
DOI10.1016/J.TCS.2004.07.036zbMATH Open1080.68072OpenAlexW2101206446MaRDI QIDQ1781995FDOQ1781995
Publication date: 10 June 2005
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://research.tue.nl/nl/publications/a-brief-history-of-process-algebra(76252f00-0009-4f27-9e24-79af986cc846).html
Recommendations
Cites Work
- Kronos: A verification tool for real-time systems
- Uppaal in a nutshell
- Hybrid process algebra
- Process algebra for hybrid systems
- A structural approach to operational semantics
- The linear time -- branching time spectrum. I: The semantics of concrete, sequential processes.
- Structural operational semantics.
- Process algebra for synchronous communication
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Calculi for synchrony and asynchrony
- A calculus of mobile processes. II
- Title not available (Why is that?)
- A Compositional Approach to Performance Modelling
- An axiomatic basis for computer programming
- Title not available (Why is that?)
- A calculus of communicating systems
- Handbook of process algebra
- Verification on infinite structures.
- Verifying properties of parallel programs
- A Powerdomain Construction
- Communicating sequential processes
- Title not available (Why is that?)
- The algorithmic analysis of hybrid systems
- A timed model for communicating sequential processes
- A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time
- The algebra of timed processes, ATP: Theory and application
- Real time process algebra
- Branching time and abstraction in bisimulation semantics
- A Theory of Communicating Sequential Processes
- Process Algebra
- Guarded commands, nondeterminacy and formal derivation of programs
- Title not available (Why is that?)
- Algèbre de processus et synchronisation
- Title not available (Why is that?)
- A complete inference system for a class of regular behaviours
- Axiomatizing probabilistic processes: ACP with generative probabilities
- Mobile ambients
- Application of a stochastic name-passing calculus to representation and simulation of molecular processes
- The origins of structural operational semantics
- Title not available (Why is that?)
- Process algebra with timing
- Applications of Process Algebra
- Title not available (Why is that?)
- Processes and the denotational semantics of concurrency
- Title not available (Why is that?)
- A Proof System for Communicating Sequential Processes
- Algebraic process verification.
- Title not available (Why is that?)
- Programming languages and their definition. Selected papers ed. by C. B. Jones
- Title not available (Why is that?)
- Concurrent Processes and Their Syntax
- Flowgraphs and Flow Algebras
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Calculi for interaction
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (38)
- Processes with local and global liveness requirements
- Algebraic and fixed point equations over inverse limits of algebras
- Concurrencies in reversible concurrent calculi
- A process calculus for privacy-preserving protocols in location-based service systems
- Title not available (Why is that?)
- Logical Inference by DNA Strand Algebra
- Title not available (Why is that?)
- Reasoning About Resources in the Embedded Systems Language Hume
- A symbolic investigation of superspreaders
- The correctness of concurrencies in (reversible) concurrent calculi
- Intensional Couplings in Variable-Structure Models
- 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
- Independence Abstractions and Models of Concurrency
- SAT-based verification for timed component connectors
- Using process algebra to develop predator-prey models of within-host parasite dynamics
- Process algebra having inherent choice: revised semantics for concurrent systems
- Formal Enforcement of Security Policies on Parallel Systems with Risk Integration
- Declarative Programming with Algebra
- CCS with Hennessy's merge has no finite-equational axiomatization
- Title not available (Why is that?)
- From individuals to populations: a mean field semantics for process algebra
- Causal Unfoldings
- Concurrent algorithm for integrating three-dimensional B-spline functions into machines with shared memory such as GPU
- Coupled similarity: the first 32 years
- Formal enforcement of security policies on concurrent systems
- From symbolic constraint automata to Promela
- Multiphysics modelling of immune processes using distributed parameter systems
- Logic of simultaneity
- Reconciling real and stochastic time: the need for probabilistic refinement
- On linear logic planning and concurrency
- Planning-based knowing how: a unified approach
- Algebra and logic for resource-based systems modelling
- Hume box calculus: Robust system development through software transformation
- Quantum process algebra with priorities
- Сравнительный логический анализ субстанциальной и процессуальной онтологий
Uses Software
This page was built for publication: A brief history of process algebra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1781995)