Communicating sequential processes

From MaRDI portal
Revision as of 11:01, 6 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4162644

DOI10.1145/359576.359585zbMath0383.68028DBLPjournals/cacm/Hoare78OpenAlexW4211008702WikidataQ56210209 ScholiaQ56210209MaRDI QIDQ4162644

C. A. R. Hoare

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 (only showing first 100 items - show all)

An axiomatic semantics for nested concurrencyPartial correctness of exits from concurrent structuresA theory for nondeterminism, parallelism, communication, and concurrencyExploiting parallelism in coalgebraic logic programmingVerification of \(\mathrm{EB}^3\) specifications using CADPA complete rule for equifair terminationDenotational semantics of communicating sequential programsTransformations for communication fairness in CSPA distributed algorithm to prevent mutual drift between n logical clocksOn the existence of symmetric algorithms to find leaders in networks of communicating sequential processesPetri nets, algebras, morphisms, and compositionalitySémantique asynchrone et comportements infinis en CPSA hardware independent parallel programming modelTwo normal form theorems for CSP programsCommunication in concurrent dynamic logicAn algebra of processesRewriting with a nondeterministic choice operatorA distributed algorithm for distributed terminationThe complexity of reachability in distributed communicating processesDistributed deadlock detectionA shared memory algorithm and proof for the generalized alternative construct in CSPCause-effect structuresAn introduction to the regular theory of fairnessCompiling communicating processes into delay-insensitive VLSI circuitsTrace, failure and testing equivalences for communicating processesFairness and the axioms of control predicatesGlobal renaming operators in concrete process algebraTheory of tracesTransition systems, metric spaces and ready sets in the semantics of uniform concurrencyDesigning equivalent semantic models for process creationA timed model for communicating sequential processesSemantics of production systemsAppraising fairness in languages for distributed programmingA verifiable low-level concurrent programming model based on colored Petri netsOn the uniqueness of fixed points of endofunctors in a category of complete metric spacesSynthesis of communicating process skeletons from temporal-spatial logic specificationsA software architecture for distributed computer control systemsBehavioural equivalences of a probabilistic pi-calculusAnalysis of contract net in multi-agent systemsGenerating the syntactic and semantics graphs for a Markovian process algebraDeciding equivalence-based properties using constraint solvingA cylinder computation model for many-core parallel computingRevisiting sequential composition in process calculiRelational properties of sequential composition of coalgebrasA pure labeled transition semantics for the applied pi calculusProjection approaches to process mining using region-based techniquesTheory of interactionVerification of distributed systems with the axiomatic system of MSVLUsing formal methods with SysML in aerospace design and engineeringIssues in the design of a parallel object-oriented languageUn modèle asynchrone pour les systèmes distribués. (An asynchronous model of distributed systems)Algebraic specification of concurrent systemsProbabilistic verification of communication protocolsProof theory for exception handling in a tasking environmentThe infinite evolution mechanism of \(\epsilon\)-bisimilarityA design method for embedded software systemsOn the power of synchronization between two adjacent processesExtensional Petri netLate and early semantics coincide for testingA brief history of Timed CSPOn the decidability and complexity of the structural congruence for beta-bindersLogical foundations for programming semanticsCommunicating processes with value-passing and assignmentsAttempting guards in parallel: A data flow approach to execute generalized guarded commandsCPO semantics of timed interactive actor networksMitigating covert channels based on analysis of the potential for communicationBuilding distributed controllers for systems with prioritiesSOS rule formats for zero and unit elementsConversation protocols: a formalism for specification and verification of reactive electronic servicesA fluid analysis framework for a Markovian process algebraA precongruence format for should testing preorderA formal abstract framework for modelling and testing complex software systemsStep failures semantics and a complete proof systemRelating state-based and process-based concurrency through linear logic (full-version)Efficient model checking for LTL with partial order snapshotsCoordination of parallel partially ordered processesA Rice-style theorem for parallel automataDerivation of concurrent programs by stepwise scheduling of Event-B modelsData flow analysis of distributed communicating processesP-A logic - a compositional proof system for distributed programsPROCOL. A concurrent object-oriented language with protocols delegation and constraintsReceptive process theorySemantics of algorithmic languagesAssumption-commitment support for CSP model checkingA weakest precondition semantics for communicating processesPort automata and the algebra of concurrent porcessesParametric channels via label expressions in CCSA proof technique for parallel programsA linear-history semantics for languages for distributed programmingPractical LL(1)-based parsing of van Wijngaarden grammarsAn introduction to FIFO nets - monogeneous nets: a subclass of FIFO netsSpecification-oriented semantics for communicating processesGlobal and local views of state fairnessA distributed error recovery technique and its implementation and application on UNIXSpecification and analysis of a data transfer protocol using systems of communicating machinesA complete axiomatic semantics of spawningA formal approach to designing delay-insensitive circuitsA model of concurrency with fair merge and full recursionFault-tolerant and flexible interconnection of multiple processorsThe probe: An addition to communication primitives




This page was built for publication: Communicating sequential processes