A calculus of communicating systems
From MaRDI portal
Publication:1148667
zbMath0452.68027MaRDI QIDQ1148667
Publication date: 1980
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
concurrent systemsCSPobservational equivalenceCCScommunicating systemsconcurrent compositionsilent transitionsynchronized communications
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Theory of operating systems (68N25)
Related Items (only showing first 100 items - show all)
Weak bisimulations for fuzzy automata ⋮ Structural similarity: spectral methods for relaxed blockmodeling ⋮ A characterization of finitary bisimulation ⋮ Transition systems from event structures revisited ⋮ Developments in concurrent Kleene algebra ⋮ Concurrent abstract state machines ⋮ Formal modelling and verification of GALS systems using GRL and CADP ⋮ On the diversity of asynchronous communication ⋮ A basic algebra of stateless connectors ⋮ Duplication of constants in process algebra ⋮ Two-thirds simulation indexes and modal logic characterization ⋮ Fair testing ⋮ Behavioural equivalences of a probabilistic pi-calculus ⋮ Strong normalisation in the \(\pi\)-calculus ⋮ Generating the syntactic and semantics graphs for a Markovian process algebra ⋮ Testing probabilistic equivalence through reinforcement learning ⋮ Tackling continuous state-space explosion in a Markovian process algebra ⋮ A criterion for atomicity revisited ⋮ Deciding equivalence-based properties using constraint solving ⋮ A cylinder computation model for many-core parallel computing ⋮ Model of distributed computing system operation with time ⋮ Revisiting sequential composition in process calculi ⋮ Concurrent weighted logic ⋮ Symmetries, local names and dynamic (de)-allocation of names ⋮ An algebraic theory of interface automata ⋮ On the greatest solutions to weakly linear systems of fuzzy relation inequalities and equations ⋮ Generating symbolic traces in the insertion modeling system ⋮ Projection approaches to process mining using region-based techniques ⋮ Theory of interaction ⋮ Proving language inclusion and equivalence by coinduction ⋮ Bisimulations for fuzzy automata ⋮ Verification of distributed systems with the axiomatic system of MSVL ⋮ Nondeterministic automata: equivalence, bisimulations, and uniform relations ⋮ Value-passing CCS with noisy channels ⋮ A generic framework for \(n\)-protocol compatibility checking ⋮ Combining data type and recursive process specifications using projection algebras ⋮ Towards a theory of (self) applicative communicating processes: A short note ⋮ Coalgebras in functional programming and type theory ⋮ Active learning of nondeterministic finite state machines ⋮ Formal communication elimination and sequentialization equivalence proofs for distributed system models ⋮ A calculus of quality for robustness against unreliable communication ⋮ An algebraic theory for web service contracts ⋮ Confluence for process verification ⋮ Structural operational semantics for weak bisimulations ⋮ Compilation of the ELECTRE reactive language into finite transition systems ⋮ Late and early semantics coincide for testing ⋮ Deciding observational congruence of finite-state CCS expressions by rewriting ⋮ Translations between modal logics of reactive systems ⋮ Emergence of universal global behavior from reversible local transitions in asynchronous systems ⋮ Logical characterizations of simulation and bisimulation for fuzzy transition systems ⋮ Model-based testing of probabilistic systems ⋮ Structure of concurrency ⋮ Transition system specifications with negative premises ⋮ Modal logics for mobile processes ⋮ The expressive power of implicit specifications ⋮ Universal axioms for bisimulations ⋮ Computational interpretations of linear logic ⋮ Refinement of actions in event structures and causal trees ⋮ Communicating processes with value-passing and assignments ⋮ Computation of the greatest simulations and bisimulations between fuzzy automata ⋮ Mitigating covert channels based on analysis of the potential for communication ⋮ Network-conscious \(\pi\)-calculus -- a model of Pastry ⋮ Simulation refinement for concurrency verification ⋮ Building distributed controllers for systems with priorities ⋮ Category theory for operational semantics ⋮ Concurrent Kleene algebra and its foundations ⋮ On the computational complexity of bisimulation, redux ⋮ Measuring the confinement of probabilistic systems ⋮ Verification of reactive systems via instantiation of parameterised Boolean equation systems ⋮ Modal logics for communicating systems ⋮ Prespecification in data refinement ⋮ Refusal testing ⋮ An intensional characterization of the largest bisimulation ⋮ Observation equivalence as a testing equivalence ⋮ Fixed point equations with parameters in the projective model ⋮ Step failures semantics and a complete proof system ⋮ Reduction of fuzzy automata by means of fuzzy quasi-orders ⋮ Deadlock analysis of unbounded process networks ⋮ An operational semantics for object-oriented concepts based on the class hierarchy ⋮ Is hyper-extensionality preservable under deletions of graph elements? ⋮ Bisimulation and divergence ⋮ An operational semantics for paragon: A design notation for parallel architectures ⋮ Failures semantics based on interval semiwords is a congruence for refinement ⋮ Recursive process definitions with the state operator ⋮ Receptive process theory ⋮ On fluidization of discrete event models: Observation and control of continuous Petri nets ⋮ Branching bisimulation congruence for probabilistic systems ⋮ Raiders of the lost equivalence: probabilistic branching bisimilarity ⋮ A weakest precondition semantics for communicating processes ⋮ Algèbre de processus et synchronisation ⋮ Port automata and the algebra of concurrent porcesses ⋮ A fair calculus of communicating systems ⋮ Parametric channels via label expressions in CCS ⋮ A linear-history semantics for languages for distributed programming ⋮ A theory of bipolar synchronization scheme ⋮ A logical characterization of observation equivalence ⋮ Priorities in process algebras ⋮ On guarded recursion ⋮ A model of concurrency with fair merge and full recursion ⋮ Process algebra and constraint programming for modeling interactions in MAS
This page was built for publication: A calculus of communicating systems
