scientific article; zbMATH DE number 1296290

Publication date: 7 June 1999

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

parallelism programming languages concurrency $\pi$-calculus calculus of communicating systems extension of CCS with mobility modelling and verification

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Theory of programming languages (68N15) Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Logic in computer science (03B70) 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) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Grammars and rewriting systems (68Q42) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items

Modelling and analysing neural networks using a hybrid process algebra, Modelling and verification of weighted spiking neural systems, Reversibility in the higher-order $\pi$-calculus, Bisimilar and logically equivalent programs in PDL, A UTP approach for rTiMo, A strand graph semantics for DNA-based computation, Timed-pNets: a communication behavioural semantic model for distributed systems, Concurrent abstract state machines, A closer look at constraints as processes, An exercise in structural congruence, On the diversity of asynchronous communication, AutoSyn: A new approach to automated synthesis of composite web services with correctness guarantee, Fuzzy approximations of fuzzy relational structures, Creol: A type-safe object-oriented model for distributed concurrent systems, Multiparty session types, beyond duality, A calculus and logic of resources and processes, Complexity of reachability problems for finite discrete dynamical systems, A core calculus for correlation in orchestration languages, A pi-calculus based semantics for WS-BPEL, A verifiable low-level concurrent programming model based on colored Petri nets, Axiomatisation and decidability of multi-dimensional Duration Calculus, Behavioural equivalences of a probabilistic pi-calculus, Axiomatizations for probabilistic finite-state behaviors, Representing the MSR cryptoprotocol specification language in an extension of rewriting logic with dependent types, simpA: an agent-oriented approach for programming concurrent applications on top of Java, Using bigraphs to model topological graphs embedded in orientable surfaces, Modeling individual's aging within a bacterial population using a pi-calculus paradigm, A cylinder computation model for many-core parallel computing, On the potential advantages of exploiting behavioural information for contract-based service discovery and composition, A bisimulation-like proof method for contextual properties in untyped $\lambda $-calculus with references and deallocation, Strategy based semantics for mobility with time and access permissions, Nominal abstraction, A pure labeled transition semantics for the applied pi calculus, On the greatest solutions to weakly linear systems of fuzzy relation inequalities and equations, A complete axiom system for propositional projection temporal logic with cylinder computation model, Typing correspondence assertions for communication protocols, Reachability problems for sequential dynamical systems with threshold functions., Variability encoding: from compile-time to load-time variability, Divide and congruence: from decomposition of modal formulas to preservation of branching and $\eta $-bisimilarity, Processes in space, Bisimulations for fuzzy automata, Typed context awareness ambient calculus for pervasive applications, Verification of distributed systems with the axiomatic system of MSVL, Nondeterministic automata: equivalence, bisimulations, and uniform relations, Value-passing CCS with noisy channels, Finite abstractions for hybrid systems with stable continuous dynamics, A formal model for service-oriented interactions, Timed mobility in process algebra and Petri nets, The symbiosis of concurrency and verification: teaching and case studies, \textsf{CaPiTo}: Protocol stacks for services, Characterizing contextual equivalence in calculi with passivation, Typing access control and secure information flow in sessions, Bounded memory Dolev-Yao adversaries in collaborative systems, Constructing and visualizing chemical reaction networks from pi-calculus models, Lattice-valued simulations for quantitative transition systems, A formal approach to open multiparty interactions, Domain theory for concurrency, The neglected pillar of material computation, A timed semantics of Orc, Bisimulations in calculi modelling membranes, Semi-automated verification of security proofs of quantum cryptographic protocols, A calculus of quality for robustness against unreliable communication, Modeling ontology evolution with SetPi, Rough approximations based on bisimulations, A monotone framework for CCS, Pathway analysis for BioAmbients, A simple calculus for proteins and cells, An empirical comparison of formalisms for modelling and analysis of dynamic reconfiguration of dependable systems, nano$\kappa$: A calculus for the modeling and simulation of nano devices, Synapses as stochastic concurrent systems, CSP is a retract of CCS, On generic context lemmas for higher-order calculi with sharing, Computation of the greatest simulations and bisimulations between fuzzy automata, Typed event structures and the linear $\pi $-calculus, Design of a biomolecular device that executes process algebra, Strand algebras for DNA computing, Secrecy and group creation, Channel-based coordination via constraint satisfaction, An improved algorithm for determinization of weighted and fuzzy automata, Information hiding in probabilistic concurrent systems, Conversation protocols: a formalism for specification and verification of reactive electronic services, A fully abstract may testing semantics for concurrent objects, Weakening the perfect encryption assumption in Dolev-Yao adversaries, A formal semantics for the Taverna 2 workflow model, Fundamentals of session types, The calculus of context-aware ambients, Fuzzy relation equations and reduction of fuzzy automata, Reduction of fuzzy automata by means of fuzzy quasi-orders, Relating state-based and process-based concurrency through linear logic (full-version), An algebra of hybrid systems, The computational status of physics, Fully abstract models and refinements as tools to compare agents in timed coordination languages, Towards verification of computation orchestration, An imperative pure calculus, Bialgebraic methods and modal logic in structural operational semantics, A theory of structural stationarity in the $\pi$-calculus, On the refinement of liveness properties of distributed systems, Process-algebraic approaches for multi-agent systems: an overview, Process algebras as support for sustainable systems of services, Towards an algebraic theory of typed mobile processes, On projecting processes into session types, Semantics of value recursion for Monadic Input/Output, Coalgebraic Symbolic Semantics, Relating Functional and Imperative Session Types, MODELLING AND ANALYSIS OF PKI-BASED SYSTEMS USING PROCESS CALCULI, Modeling for Verification, Trees from Functions as Processes, Robin Milner's Work on Concurrency, Static Trace-Based Deadlock Analysis for Synchronous Mini-Go, Complete algebraic semantics for second-order rewriting systems based on abstract syntax with variable binding, A Declarative View of Signaling Pathways, On the Relationship between π-Calculus and Finite Place/Transition Petri Nets, Mobile Processes and Termination, Rigid Families for the Reversible $$\pi $$ -Calculus, Unnamed Item, Algebras of UTxO blockchains, Computing Behavioral Relations for Probabilistic Concurrent Systems, Order algebras: a quantitative model of interaction, Weak Bisimulation as a Congruence in MSOS, A General Theory of Barbs, Contexts, and Labels, A Probabilistic Applied Pi–Calculus, CCS with Replication in the Chomsky Hierarchy: The Expressive Power of Divergence, PROPOSITIONAL DYNAMIC LOGIC FOR REASONING ABOUT FIRST-CLASS AGENT INTERACTION PROTOCOLS, Unnamed Item, Symmetry structure in discrete models of biochemical systems: natural subsystems and the weak control hierarchy in a new model of computation driven by interactions, On Beta-Binders Communications, Towards Slime Mould Based Computer, How to prove decidability of equational theories with second-order computation analyser SOL, Mind the Shapes: Abstraction Refinement Via Topology Invariants, A Propositional Dynamic Logic for CCS Programs, Unnamed Item, Unnamed Item, Information flow safety in multiparty sessions, A New Roadmap for Linking Theories of Programming, Linked data privacy, On Recursion, Replication and Scope Mechanisms in Process Calculi, Comparative Analysis of Statistical Model Checking Tools, Unnamed Item, Unnamed Item, Unnamed Item, Observing Success in the Pi-Calculus, Structural Rewriting in the pi-Calculus., PHYSARUM SPATIAL LOGIC, Topological Construction of Parameterized Bisimulation Limit, Employing Costs in Multiagent Systems with Timed Migration and Timed Communication, A Formal Environment Model for Multi-Agent Systems, A Testing Theory for a Higher-Order Cryptographic Language, Types for Role-Based Access Control of Dynamic Web Data, Imaginary groups: lazy monoids and reversible computation, A Translation of Beta-binders in a Prioritized Pi-calculus, Control Flow Analysis of Generalised Boolean Networks, A Petri Net Interpretation of Open Reconfigurable Systems, FSP and FLTL framework for specification and verification of middle-agents, Diagrammatic confluence for Constraint Handling Rules, Symmetry and Interactivity in Programming, Typing Correspondence Assertions for Communication Protocols, Tree Process Calculus, Stochastic Bigraphs, Counting the Cost in the Picalculus (Extended Abstract), Relating State-Based and Process-Based Concurrency through Linear Logic, Labelled Transitions for Mobile Ambients (As Synthesized via a Graphical Encoding), Decidable Fragments of a Higher Order Calculus with Locations, A Calculus for Mobile Ad-hoc Networks with Static Location Binding, Two Graph-Based Techniques for Software Architecture Reconfiguration, An algebraic characterization of equivalent preferential models, The ARC Programming Model – Language Constructs for Coordination, Control Flow Analysis for Brane Calculi, Modelling and Verifying Mobile Systems Using π-Graphs, On GS-Monoidal Theories for Graphs with Nesting, A Typed Calculus for Querying Distributed XML Documents, Proof-relevant π-calculus: a constructive account of concurrency and causality, Unnamed Item, Psim: A Computational Platform for Metabolic P Systems, On the Reachability Problem in P Systems with Mobile Membranes, A Hybrid Approach to Modeling Biological Systems, Reactive Systems, Barbed Semantics, and the Mobile Ambients, P SYSTEMS AND TOPOLOGY: SOME SUGGESTIONS FOR RESEARCH, Unnamed Item, Finite-Chain Graded Modal Logic, The Orc Programming Language, The Decidability of the Reachability Problem for CCS!, Cryptographic Verification by Typing for a Sample Protocol Implementation, Process Algebra Modelling Styles for Biomolecular Processes, Algebra and logic for resource-based systems modelling, PiStache: Implementing π-Calculus in Scala, An expressiveness study of priority in process calculi, A Theory Agenda for Component-Based Design, Stochastic Model Checking of the Stochastic Quality Calculus, Active Evaluation Contexts for Reaction Semantics, Coordination Models Orc and Reo Compared, Prototyping Concurrent Systems with Agents and Artifacts: Framework and Core Calculus, Automated Synthesis of Enforcing Mechanisms for Security Properties in a Timed Setting, Observational Semantics for a Concurrent Lambda Calculus with Reference Cells and Futures, Bisimulation and Co-induction: Some Problems, Probabilistic π-Calculus and Event Structures, A Static Analysis for Beta-Binders, A Spatial Extension to the π Calculus, Signal Transduction Pathways as Concurrent Reactive Systems: A Modeling and Simulation Approach Using LSCs and the Play-Engine, Efficient Stochastic Simulation of Biological Systems with Multiple Variable Volumes, A Well-behaved LTS for the Pi-calculus, Distributed Adaptive Systems, Concurrent Process Histories and Resource Transducers, On Completeness of Cost Metrics and Meta-Search Algorithms in $-Calculus, Translation of CCS into CSP, correct up to strong bisimulation, Bonding calculus, Programming language semantics: It’s easy as 1,2,3, Semantics of dynamic hiding in mobile UTP-CSP, Adversarial logic, Comparing the expressiveness of the $\pi $-calculus and CCS, Strand spaces with choice via a process algebra semantics, A process calculus for spiking neural P systems, Comparing the Expressiveness of the π-calculus and CCS, Psi-calculi in Isabelle, Unnamed Item, Unnamed Item, A semantics for web services authentication, Brane Calculi, A bisimulation for dynamic sealing, Modelling session types using contracts, A Global Occurrence Counting Analysis for Brane Calculi, A Practical Approach to Verification of Mobile Systems Using Net Unfoldings, A Formal Analysis of Complex Type Flaw Attacks on Security Protocols, An Observational Model for Transactional Calculus of Services Orchestration, On the expressiveness of choice quantification, A theory of bisimulation for a fragment of concurrent ML with local names, Continuity controlled hybrid automata, Similarity between preferential models, Modelling biochemical pathways through enhanced $\pi$-calculus, BioAmbients: an abstraction for biological compartments, Unnamed Item, A spatial logic for concurrency. I, Dynamic input/output automata: a formal and compositional model for dynamic systems, What is a free name in a process algebra?, Formal verification of temporal properties for reduced overhead in grid scientific workflows, The \$-calculus process algebra for problem solving: A paradigmatic shift in handling hard computational problems, Types and full abstraction for polyadic $\pi$-calculus, A perspective on service orchestration, Formal verification technique for grid service chain model and its application, A static analysis for brane calculi providing global occurrence counting information, Reduction semantics in Markovian process algebra, SMT-based generation of symbolic automata, 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, A system for compositional verification of asynchronous objects, Replacement freeness: a criterion for separating process calculi, Exception handling for copyless messaging, The \texttt{link}-calculus for open multiparty interactions, A logic of behaviour in context, Correct audit logging in concurrent systems, Self-assembling graphs, Limited approximate bisimulations and the corresponding rough approximations, Tutorial on separation results in process calculi via leader election problems, Denotational semantics of channel mobility in UTP-CSP, Reversible computation in nature inspired rule-based systems, Modeling ontology evolution via pi-calculus, 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, Unnamed Item, Unnamed Item, Dichotomy results for fixed point counting in Boolean dynamical systems, Decidability of infinite-state timed CCP processes and first-order LTL, Realisability of pomsets, Ensuring liveness properties of distributed systems: open problems, Is there any real substance to the claims for a ``new computationalism?, Pure bigraphs: structure and dynamics, Coalgebraic minimization of HD-automata for the $\pi$-calculus using polymorphic types, A coordination approach to mobile components, A CPS encoding of name-passing in higher-order mobile embedded resources, Leader election in rings of ambient processes, Locating reaction with 2-categories, A hierarchy of equivalences for asynchronous calculi, 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 type system for lock-free processes, Types for the ambient calculus, Ensuring termination by typability, A brief history of process algebra, Process algebra for hybrid systems, A process calculus BigrTiMo of mobile systems and its formal semantics, Bestow and atomic: concurrent programming using isolation, delegation and grouping, Matching logic explained, A calculus of branching processes, Computation of the greatest right and left invariant fuzzy quasi-orders and fuzzy equivalences, On Hierarchical Communication Topologies in the $$\pi $$ -calculus, Applications and extensions of context-sensitive rewriting, A mathematical modelling for workflows, Equational Reasoning About Quantum Protocols, A Gentle Introduction to Multiparty Asynchronous Session Types, A First-Order Syntax for the π-Calculus in Isabelle/HOL using Permutations, Defining Actions in Concurrent Declarative Programming, Modal Logics for Cryptographic Processes, Safety versus Security in the Quality Calculus, THE MYTH OF 'THE MYTH OF HYPERCOMPUTATION', Non decomposable connectives of linear logic, Explicit fusions, Interactive verification of architectural design patterns in FACTum, Communication and mobility control in boxed ambients, On an open problem of Amadio and Curien: The finite antichain condition, Molecular interaction., Type-based information flow analysis for the $\pi$-calculus, Session typing and asynchronous subtyping for the higher-order $\pi$-calculus, Manipulating Trees with Hidden Labels, Systems Modelling via Resources and Processes: Philosophy, Calculus, Semantics, and Logic, Biological Transactions for Quantitative Models, A Simple Calculus for Proteins and Cells, Encoding Catalytic P Systems in π@, A Chart Semantics for the Pi-Calculus, Matching Systems for Concurrent Calculi, Secured Information Flow for Asynchronous Sequential Processes, Interaction in Time and Space, Compositional verification of asynchronous concurrent systems using CADP, A structural transformation from p-$\pi$ to MSVL, $ \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

Uses Software

Pict