scientific article; zbMATH DE number 1296290
From MaRDI portal
Publication:4248252
\(\pi\)-calculuscalculus of communicating systemsconcurrencyextension of CCS with mobilitymodelling and verificationparallelismprogramming languages
Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Logic in computer science (03B70) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Theory of programming languages (68N15) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Grammars and rewriting systems (68Q42) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Recommendations
- The -calculus: A theory of mobile processes
- On hierarchical communication topologies in the -calculus
- On the expressiveness of -calculus for encoding mobile ambients
- Encoding distributed areas and local communication into the -calculus
- Encoding mobile ambients into the \(\pi \)-calculus
- scientific article; zbMATH DE number 30325
- Reflecting mobile ambients into the \(\pi \)-calculus
- On the expressiveness of the -calculus and the mobile ambients
Cited in
(only showing first 100 items - show all)- An algebra of hybrid systems
- Fully abstract models and refinements as tools to compare agents in timed coordination languages
- Bialgebraic methods and modal logic in structural operational semantics
- A theory of structural stationarity in the \(\pi\)-calculus
- A calculus of mobile processes. I
- An algebraic verification of a mobile network
- Typing correspondence assertions for communication protocols
- Reachability problems for sequential dynamical systems with threshold functions.
- Domain theory for concurrency
- A UTP approach for rTiMo
- Timed-pNets: a communication behavioural semantic model for distributed systems
- Fuzzy approximations of fuzzy relational structures
- Multiparty session types, beyond duality
- The symbiosis of concurrency and verification: teaching and case studies
- A formal approach to open multiparty interactions
- A monotone framework for CCS
- Secrecy and group creation
- Decidability of infinite-state timed CCP processes and first-order LTL
- Coalgebraic minimization of HD-automata for the -calculus using polymorphic types
- A coordination approach to mobile components
- Locating reaction with 2-categories
- A hierarchy of equivalences for asynchronous calculi
- A brief history of process algebra
- Process algebra for hybrid systems
- Bestow and atomic: concurrent programming using isolation, delegation and grouping
- Computation of the greatest right and left invariant fuzzy quasi-orders and fuzzy equivalences
- Molecular interaction.
- On the expressiveness of choice quantification
- A theory of bisimulation for a fragment of concurrent ML with local names
- Modelling biochemical pathways through enhanced -calculus
- BioAmbients: an abstraction for biological compartments
- A spatial logic for concurrency. I
- A system for compositional verification of asynchronous objects
- Denotational semantics of channel mobility in UTP-CSP
- Reversible computation in nature inspired rule-based systems
- Modeling ontology evolution via pi-calculus
- Realisability of pomsets
- Ensuring liveness properties of distributed systems: open problems
- Is there any real substance to the claims for a ``new computationalism?
- A process calculus BigrTiMo of mobile systems and its formal semantics
- Matching logic explained
- Applications and extensions of context-sensitive rewriting
- \( \pi\) with leftovers: a mechanisation in Agda
- The combined use of the web ontology language (OWL) and abstract state machines (ASM) for the definition of a specification language for business processes
- Nominal unification with letrec and environment-variables
- SMT-based generation of symbolic automata
- Replacement freeness: a criterion for separating process calculi
- The \texttt{link}-calculus for open multiparty interactions
- Correct audit logging in concurrent systems
- Limited approximate bisimulations and the corresponding rough approximations
- A network-conscious \(\pi\)-calculus and its coalgebraic semantics
- Dichotomy results for fixed point counting in Boolean dynamical systems
- Stochastic biological modelling in the presence of multiple compartments
- An intermediate language for the stochastic simulation of biological systems
- A control flow analysis for Beta-binders with and without static compartments
- A calculus of branching processes
- A mathematical modelling for workflows
- Non decomposable connectives of linear logic
- Interactive verification of architectural design patterns in FACTum
- Session typing and asynchronous subtyping for the higher-order \(\pi\)-calculus
- Compositional verification of asynchronous concurrent systems using CADP
- A structural transformation from p- to MSVL
- Continuity controlled hybrid automata
- Similarity between preferential models
- What is a free name in a process algebra?
- The \$-calculus process algebra for problem solving: A paradigmatic shift in handling hard computational problems
- Types and full abstraction for polyadic -calculus
- A perspective on service orchestration
- A static analysis for brane calculi providing global occurrence counting information
- Reduction semantics in Markovian process algebra
- A general overview of formal languages for individual-based modelling of ecosystems
- A stable non-interleaving early operational semantics for the pi-calculus
- A reduction semantics for direct-style asynchronous observables
- Communicating by compatibility
- Expressiveness of propositional projection temporal logic with star
- Exception handling for copyless messaging
- A logic of behaviour in context
- Self-assembling graphs
- Tutorial on separation results in process calculi via leader election problems
- Behavioural equivalences for dynamic web data
- CCS with priority guards
- Full abstraction for polymorphic \(\pi \)-calculus
- Free-algebra models for the \(\pi \)-calculus
- On process rate semantics
- Symmetric electoral systems for ambient calculi
- Pure bigraphs: structure and dynamics
- A CPS encoding of name-passing in higher-order mobile embedded resources
- Leader election in rings of ambient processes
- A type system for lock-free processes
- Types for the ambient calculus
- Ensuring termination by typability
- Explicit fusions
- \(\pi\)-calculus with noisy channels
- Communication and mobility control in boxed ambients
- On an open problem of Amadio and Curien: The finite antichain condition
- Type-based information flow analysis for the \(\pi\)-calculus
- Dynamic input/output automata: a formal and compositional model for dynamic systems
- Formal verification of temporal properties for reduced overhead in grid scientific workflows
- Formal verification technique for grid service chain model and its application
- Modelling and analysing neural networks using a hybrid process algebra
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 Q4248252)
