Communicating sequential processes
From MaRDI portal
Publication:4162644
DOI10.1145/359576.359585zbMath0383.68028OpenAlexW4211008702WikidataQ56210209 ScholiaQ56210209MaRDI QIDQ4162644
Publication date: 1978
Published in: Communications of the ACM (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.186.8184
Related Items
An axiomatic semantics for nested concurrency, Partial correctness of exits from concurrent structures, A theory for nondeterminism, parallelism, communication, and concurrency, Exploiting parallelism in coalgebraic logic programming, Verification of \(\mathrm{EB}^3\) specifications using CADP, A complete rule for equifair termination, Denotational semantics of communicating sequential programs, Transformations for communication fairness in CSP, A distributed algorithm to prevent mutual drift between n logical clocks, On the existence of symmetric algorithms to find leaders in networks of communicating sequential processes, Petri nets, algebras, morphisms, and compositionality, Sémantique asynchrone et comportements infinis en CPS, A hardware independent parallel programming model, Two normal form theorems for CSP programs, Communication in concurrent dynamic logic, An algebra of processes, Rewriting with a nondeterministic choice operator, A distributed algorithm for distributed termination, The complexity of reachability in distributed communicating processes, Distributed deadlock detection, A shared memory algorithm and proof for the generalized alternative construct in CSP, Cause-effect structures, An introduction to the regular theory of fairness, Compiling communicating processes into delay-insensitive VLSI circuits, Trace, failure and testing equivalences for communicating processes, Fairness and the axioms of control predicates, Global renaming operators in concrete process algebra, Theory of traces, Transition systems, metric spaces and ready sets in the semantics of uniform concurrency, Designing equivalent semantic models for process creation, A timed model for communicating sequential processes, Semantics of production systems, Appraising fairness in languages for distributed programming, A verifiable low-level concurrent programming model based on colored Petri nets, On the uniqueness of fixed points of endofunctors in a category of complete metric spaces, Synthesis of communicating process skeletons from temporal-spatial logic specifications, A software architecture for distributed computer control systems, Behavioural equivalences of a probabilistic pi-calculus, Analysis of contract net in multi-agent systems, Generating the syntactic and semantics graphs for a Markovian process algebra, Deciding equivalence-based properties using constraint solving, A cylinder computation model for many-core parallel computing, Revisiting sequential composition in process calculi, Relational properties of sequential composition of coalgebras, A pure labeled transition semantics for the applied pi calculus, Projection approaches to process mining using region-based techniques, Theory of interaction, Verification of distributed systems with the axiomatic system of MSVL, Using formal methods with SysML in aerospace design and engineering, Issues in the design of a parallel object-oriented language, Un modèle asynchrone pour les systèmes distribués. (An asynchronous model of distributed systems), Algebraic specification of concurrent systems, Probabilistic verification of communication protocols, Proof theory for exception handling in a tasking environment, The infinite evolution mechanism of \(\epsilon\)-bisimilarity, A design method for embedded software systems, On the power of synchronization between two adjacent processes, Extensional Petri net, Late and early semantics coincide for testing, A brief history of Timed CSP, On the decidability and complexity of the structural congruence for beta-binders, Logical foundations for programming semantics, Communicating processes with value-passing and assignments, Attempting guards in parallel: A data flow approach to execute generalized guarded commands, CPO semantics of timed interactive actor networks, Mitigating covert channels based on analysis of the potential for communication, Building distributed controllers for systems with priorities, SOS rule formats for zero and unit elements, Conversation protocols: a formalism for specification and verification of reactive electronic services, A fluid analysis framework for a Markovian process algebra, A precongruence format for should testing preorder, A formal abstract framework for modelling and testing complex software systems, Step failures semantics and a complete proof system, Relating state-based and process-based concurrency through linear logic (full-version), Efficient model checking for LTL with partial order snapshots, Coordination of parallel partially ordered processes, A Rice-style theorem for parallel automata, Derivation of concurrent programs by stepwise scheduling of Event-B models, Data flow analysis of distributed communicating processes, P-A logic - a compositional proof system for distributed programs, PROCOL. A concurrent object-oriented language with protocols delegation and constraints, Receptive process theory, Semantics of algorithmic languages, Assumption-commitment support for CSP model checking, A weakest precondition semantics for communicating processes, Port automata and the algebra of concurrent porcesses, Parametric channels via label expressions in CCS, A proof technique for parallel programs, A linear-history semantics for languages for distributed programming, Practical LL(1)-based parsing of van Wijngaarden grammars, An introduction to FIFO nets - monogeneous nets: a subclass of FIFO nets, Specification-oriented semantics for communicating processes, Global and local views of state fairness, A distributed error recovery technique and its implementation and application on UNIX, Specification and analysis of a data transfer protocol using systems of communicating machines, A complete axiomatic semantics of spawning, A formal approach to designing delay-insensitive circuits, A model of concurrency with fair merge and full recursion, Fault-tolerant and flexible interconnection of multiple processors, The probe: An addition to communication primitives, Some hierarchies for the communication complexity measures of cooperating grammar systems, A trace-based compositional proof theory for fault tolerant distributed systems, Program composition via unification, On sequential composition, action prefixes and process prefix, Reasoning about dynamically evolving process structures, When is partial trace equivalence adequate?, Labelled domains and automata with concurrency, Testing equivalences for processes, A calculus of nets, On the operational semantics of nondeterminism and divergence, Temporal reasoning through automatic translation of tock-CSP into timed automata, Performance enhancement methods for parallel programs with multilevel memory, Dynamic graph models, The ins and outs of Petri net composition, Compositional semantics for real-time distributed computing, Concurrent transition systems, A new algorithm for the integer knapsack problem and its parallelization, The contraction property is sufficient to guarantee the uniqueness of fixed points of endofunctors in a category of complete metric spaces, Time-optimal control of large-scale systems of systems using compositional optimization, A new mechanism for exception handling in concurrent control systems, Accelerating Petri-net simulations using NVIDIA graphics processing units, A process algebra of communicating shared resources with dense time and priorities, Processes are in the eye of the beholder, Equivalence is in the eye of the beholder, Rewriting semantics of production rule sets, Semantics of nondeterminism, concurrency, and communication, Fairness in shared invocation servicing, A semantic theory for value-passing processes based on the late approach, Election in partially anonymous networks with arbitrary knowledge in message passing systems, A fully abstract model for the exchange of information in multi-agent systems., On the use of history variables, The complexity of problems in systems of communicating sequential processes, Deadlock absence proofs for networks of communicating processes, Parameterized synthesis for fragments of first-order logic over data words, A proof technique for communicating sequential processes, Methods and means of parallel processing of information, Compositional and local livelock analysis for CSP, Modal event-clock specifications for timed component-based design, Topology in process calculus. I: Limit behaviour of agents, Optimal networks for distributing nonsequential programs, Towards a foundation for semantics in complete metric spaces, The equivalence in the DCP model, A proof system for communicating processes with value-passing, Decompositions of graphs based on a new graph product, Tuning distributed control algorithms for optimal functioning, Distributed event algebras, A compositional protocol verification using relativized bisimulation, The impact of the number of cooperating grammars on the generative power, A layered semantics for a parallel object-oriented language, Experimenting with process equivalence, Defining conditional independence using collapses, A class of systems with nearly zero distributed simulation overhead, Efficient distributed simulation of acyclic systems, Compiling and verifying SC-SystemJ programs for safety-critical reactive systems, Verification of distributed programs using representative interleaving sequences, Conflict vs causality in event structures, Rule formats for distributivity, Enriched categorical semantics for distributed calculi, Failure-equivalent transformation of transition systems to avoid internal actions, A framework for specifying and verifying the behaviour of open systems, IPL: an integration property language for multi-model cyber-physical systems, A brief history of process algebra, Bestow and atomic: concurrent programming using isolation, delegation and grouping, Schedulers and finishers: on generating and filtering the behaviours of an event structure, Toward an algebraic theory of systems, Vulnerability analysis of CSP based on stochastic game theory, A case for a forward predicate transformer, Parameterized verification of monotone information systems, The sliding-window protocol revisited, Some impossibility results in interprocess synchronization, Fairness and hyperfairness in multi-party interactions, Bialgebraic foundations for the operational semantics of string diagrams, Corrigenda:Cooperating proofs for distributed programs with multiparty interactions, Representation of computations in concurrent automata by dependence orders, Primitives for resource management in a demand-driven reduction model, The correctness of nondeterministic programs revisited, A structural operational semantics for an Edison like language. II, Repeated snapshots in distributed systems with synchronous communications and their implementation in CSP, Two decentralized algorithms for strong interaction fairness for systems with unbounded speed variability, Fast and parallel decomposition of constraint satisfaction problems, A semantic model for interacting cyber-physical systems, Combinatorial conditions for directed collapsing, Denotational semantics of communicating processes based on a language for applicative multiprogramming, A distributed solution of the distributed termination problem, Correctness proofs of CSP programs, An iterative and starvation-free solution for a general class of distributed control problems based on interaction primitives, Translation validation of coloured Petri net models of programs on integers, Alternation and bounded concurrency are reverse equivalent., Strong fairness and full abstraction for communicating processes, On fairness notions in distributed systems. I: A characterization of implementability, MACLP: multi agent constraint logic programming, \textsf{Goéland}: a concurrent tableau-based theorem prover (system description), Nivat's processes and their synchronization, The comparison of a cpo-based semantics with a cms-based semantics for \(CSP\), Asynchronous and corrected-asynchronous finite difference solutions of PDEs on MIMD multiprocessors, Additive models of probabilistic processes, Equational rules for rewriting logic, Proving partial order properties, A theory of timed automata, Axiomatic-like performance analysis (ALPA), Formal Methods to Improve Public Administration Business Processes, Strong types for coordinating active objects, An enhanced thread synchronization mechanism for Java, Verification and comparison of transition systems, MODELLING AND ANALYSIS OF PKI-BASED SYSTEMS USING PROCESS CALCULI, Syntax and consistent equation semantics of hybrid Chi, A formal model for BPEL4WS description of Web service composition, Process Algebra and Model Checking, Operational semantics of Framed Tempura, On Rule Formats for Zero and Unit Elements, Static Trace-Based Deadlock Analysis for Synchronous Mini-Go, Schedulers and Finishers: On Generating the Behaviours of an Event Structure, Deadlock analysis in networks of communicating processes, Interleaving set temporal logic, Step bisimulation is pomset equivalence on a parallel language without explicit internal choice, Deciding the Bisimilarity Relation between Datalog Goals, Highly dependable concurrent programming using design for verification, Reversing algebraic process calculi, A compositional proof system for distributed programs, Parallel decision procedures for finite state automata, Writing concurrent assemblers–a case study in path pascal, The suitability for master/slave concurrency of concurrent euclid, ada and modula, On optimal management of resources in distributed networks, Refinement-Based Verification of Communicating Unstructured Code, A Mechanized Theory of Regular Trees in Dependent Type Theory, Determining asynchronous test equivalence for probabilistic processes, Characterising spectra of equivalences for event structures, logically, Unnamed Item, Keep it fair: equivalence and composition, SPECIFICATION AND VERIFICATION OF CONURRENT SYSTEMS IN CESAR, Breaking symmetries, A Linear-Time–Branching-Time Spectrum of Behavioral Specification Theories, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, On the control of incompletely described sequential machines, Unnamed Item, A Ticking Clock: Performance Analysis of a Circadian Rhythm with Stochastic Process Algebra, Unnamed Item, Unnamed Item, A LISP implementation of the model for ‘communicating sequential processes’, Bisimulations for verifying strategic abilities with an application to the ThreeBallot voting protocol, Topological Construction of Parameterized Bisimulation Limit, From domains to automata with concurrency, Transactional events, Practical reasoning with procedural knowledge, Correct audit logging in concurrent systems, Tutorial on separation results in process calculi via leader election problems, On dynamically generated ontology translators in agent communication, TOWARDS A SEMANTIC STATE TRANSITION SYSTEM FOR AUTOMATED GENERATION OF DATA FLOW IN WEB SERVICE COMPOSITION, Modular Markovian Logic, Distributed Control of Discrete-Event Systems: A First Step, CCS with priority guards, Modeling and visualizing object-oriented programs with Codecharts, Model checking approach to automated planning, Symmetric electoral systems for ambient calculi, Concurrent programming in the Ada® language: The polling bias, Unnamed Item, A Game Semantics of Idealized CSP, Relating State-Based and Process-Based Concurrency through Linear Logic, An experiment in language design for distributed systems, Knowledge Based Scheduling of Distributed Systems, Setting-up early computer programs: D. H. Lehmer's ENIAC computation, Monitors with associated processors, A Finite Axiomatization of Nondeterministic Regular Expressions, Semantic specification and verification of data flow diagrams, Fifty years of Hoare's logic, ON FORMAL AND COGNITIVE SEMANTICS FOR SEMANTIC COMPUTING, A linear-time-branching-time spectrum for behavioral specification theories, A formal approach to the engineering of domain-specific distributed systems, A Look Around the Corner: The Pi-Calculus, Counter Abstraction in the CSP/FDR setting, On the design and specification of message oriented programs, Event-based functional decomposition, On the corrective control of sequential machines, Probabilistic model of software approximate correctness, On the Power of Attribute-Based Communication, PiStache: Implementing π-Calculus in Scala, A game-semantic model of computation, Message passing between sequential processes: The reply primitive and the administrator concept, The Value-Passing Calculus, Proving Safety of Traffic Manoeuvres on Country Roads, \(\pi\)-calculus with noisy channels, DTL: A language for the design and implementation of concurrent programs as structured networks, The implementation of DTL, Interactive verification of architectural design patterns in FACTum, Programming of parallel processors in control spaces, Protocol Composition Logic (PCL), Active Evaluation Contexts for Reaction Semantics, Towards a language for concurrent processes, Implementation of asynchronous parallel computations in control space, Reflections on the Future of Concurrency Theory in General and Process Calculi in Particular, A formal semantics for debugging synchronous message passing-based concurrent programs, Parallel solution of recurrences on a tree machine, Meeting of the Association for Symbolic Logic Florence, Italy 1982, Compositional verification of asynchronous concurrent systems using CADP, Communicating parallel processes, Concurrent Process Histories and Resource Transducers, A hierarchy of domains for real-time distributed computing, Guarded horn clauses, N-PAT: A Nested Model-Checker, Program composition via unification, A decade of TAPSOFT, Checking opacity and durable opacity with FDR, An algorithm for analyzing communicating processes, Compositional Specification in Rewriting Logic, Unnamed Item, Towards Directed Collapsibility (Research), Psi-calculi in Isabelle, Calculational derivation of a counter with bounded response time and bounded power dissipation, Implementation of hierarchical F-channels for high-performance distributed computing, Synchronous, asynchronous, and causally ordered communication, The congenial talking philosophers problem in computer networks, Action systems in incremental and aspect-oriented modeling, Hexagonal Grid Fields Optimally Encode Transitions in Spatiotemporal Sequences, Highly Automated Formal Proofs over Memory Usage of Assembly Code, Using Hoare Logic in a Process Algebra Setting, Compositional CSP Traces Refinement Checking, Assumption-Commitment Support for CSP Model Checking, A debugger for concurrent programs, Compositionality: Ontology and Mereology of Domains, Synchronous Message Passing: On the Relation between Bisimulation and Refusal Equivalence, Compositional priority specification in real-time distributed systems., Operational semantics of a weak memory model with channel synchronization, Operational semantics of a weak memory model with channel synchronization, Retracing CSP
