Algèbre de processus et synchronisation
From MaRDI portal
Publication:789894
DOI10.1016/0304-3975(84)90067-7zbMath0533.68026OpenAlexW1979462141MaRDI QIDQ789894
Publication date: 1984
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/inria-00076371/file/RR-0187.pdf
Related Items
Process algebra with guards: Combining hoare logic with process algebra, Higher-level synchronising devices in Meije-SCCS, GSOS and finite labelled transition systems, Computable processes and bisimulation equivalence, Algebraic calculi of processes and net expressions, A non-SOS operational semantics for a process algebra, Automatizing parametric reasoning on distributed concurrent systems, On the validity of encodings of the synchronous in the asynchronous \(\pi\)-calculus, A synchronous \(\pi\)-calculus, Determinism \(\to\) (event structure isomorphism \(=\) step sequence equivalence), A domain equation for bisimulation, A distributed operational semantics of CCS based on condition/event systems, Partial ordering models for concurrency can be defined operationally, Concurrency and atomicity, An algebraic framework for developing and maintaining real-time systems, Process algebra with propositional signals, Revisiting sequential composition in process calculi, Equivalence checking 40 years after: a review of bisimulation tools, Comparing the expressiveness of the \(\pi \)-calculus and CCS, A partial ordering semantics for CCS, Unnamed Item, The \({\mathcal NU}\) system as a development system for concurrent programs: \(\delta{\mathcal NU}\), Fairness, distances and degrees, Experimenting with process equivalence, Transition system specifications with negative premises, Universal axioms for bisimulations, Automatic verification of distributed systems: the process algebra approach., An algebra for process creation, Enriched categorical semantics for distributed calculi, CCS with Hennessy's merge has no finite-equational axiomatization, Ensuring liveness properties of distributed systems: open problems, A functional model for describing and reasoning about time behaviour of computing systems, A brief history of process algebra, Step failures semantics and a complete proof system, Proved trees, Modular specification of process algebras, Broadcast Psi-calculi with an Application to Wireless Protocols, A complete equational axiomatization for MPA with string iteration, On Meije and SCCS: Infinite sum operators vs. non-guarded definitions, On constructibility and unconstructibility of LTS operators from other LTS operators, A complete modal proof system for HAL: the Herbrand agent language
Cites Work
