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)
On interprocess communication. I: Basic formalism ⋮ A model and temporal proof system for networks of processes ⋮ A theory for nondeterminism, parallelism, communication, and concurrency ⋮ Merging regular processes by means of fixed-point theory ⋮ Algebraic calculi of processes and net expressions ⋮ About fair asynchrony ⋮ An algebraic theory of fair asynchronous communicating processes ⋮ A context dependent equivalence between processes ⋮ Specification and top-down design of distributed systems ⋮ Bisimulations and abstraction homomorphisms ⋮ On the consistency of Koomen's fair abstraction rule ⋮ Petri nets, algebras, morphisms, and compositionality ⋮ Infinite streams and finite observations in the semantics of uniform concurrency ⋮ Communication in concurrent dynamic logic ⋮ An algebra of processes ⋮ Rewriting with a nondeterministic choice operator ⋮ On the analysis of cooperation and antagonism in networks of communicating processes ⋮ The complexity of reachability in distributed communicating processes ⋮ Cause-effect structures ⋮ An introduction to the regular theory of fairness ⋮ On the existence of delay-insensitive fair arbiters: Trace theory and its limitations ⋮ On observability of discrete-event systems ⋮ Trace, failure and testing equivalences for communicating processes ⋮ Global renaming operators in concrete process algebra ⋮ Applications of compactness in the Smyth powerdomain of streams ⋮ Semantics of production systems ⋮ A distributed operational semantics of CCS based on condition/event systems ⋮ Partial ordering models for concurrency can be defined operationally ⋮ A state-based approach to communicating processes ⋮ Metric semantics for concurrency ⋮ An incompleteness result in process algebra ⋮ The equational theory of pomsets ⋮ Stable families of behavioural equivalences ⋮ Sequential and concurrent behaviour in Petri net theory ⋮ Concurrent transition systems ⋮ Introduction to the theory of nested transactions ⋮ Hiding in stream semantics of uniform concurrency ⋮ Characterizing finite Kripke structures in propositional temporal logic ⋮ Type theory and concurrency ⋮ Concurrency and atomicity ⋮ Shuffle on trajectories: Syntactic constraints ⋮ A refinement calculus for specifications in Hennessy-Milner logic with recursion ⋮ Automated analysis of mutual exclusion algorithms using CCS ⋮ Process simulation and refinement ⋮ Proof systems for satisfiability in Hennessy-Milner logic with recursion ⋮ Some behavioural aspects of net theory ⋮ Un modèle asynchrone pour les systèmes distribués. (An asynchronous model of distributed systems) ⋮ A partial ordering semantics for CCS ⋮ Algebraic specification of concurrent systems ⋮ A rewriting strategy to verify observational congruence ⋮ Interpreting one concurrent calculus in another ⋮ Step semantics for ``true concurrency with recursion ⋮ CCS expressions, finite state processes, and three problems of equivalence ⋮ Contractions in comparing concurrency semantics ⋮ A design method for embedded software systems ⋮ Reasoning about networks with many identical finite state processes ⋮ On finite alphabets and infinite bases ⋮ Generalizing the Paige-Tarjan algorithm by abstract interpretation ⋮ Formalization of test experiments ⋮ Domain theory in logical form ⋮ Bisimulation through probabilistic testing ⋮ Factorisation of finite state machines under strong and observational equivalences ⋮ Correctness of concurrent processes ⋮ Completing the temporal picture ⋮ The equivalence in the DCP model ⋮ Co-induction in relational semantics ⋮ Partial specifications and compositional verification ⋮ An algebra of concurrent non-deterministic processes ⋮ A proof system for communicating processes with value-passing ⋮ Compositionality and bisimulation: A negative result ⋮ An agent calculus with simple actions where the enabling and disabling are derived operators ⋮ \(\tau\)-bisimulations and full abstraction for refinement of actions ⋮ Process expressions and Hoare's logic: Showing and irreconcilability of context-free recursion with Scott's induction rule ⋮ Concurrent regular expressions and their relationship to Petri nets ⋮ CPO semantics of timed interactive actor networks ⋮ Embedding mappings and splittings with applications ⋮ Algebra and logic for access control ⋮ A precongruence format for should testing preorder ⋮ Component simulation-based substitutivity managing QoS and composition issues ⋮ Fuzzy relation equations and reduction of fuzzy automata ⋮ On the semantics of communicating hardware processes and their translation into LOTOS for the verification of asynchronous circuits with CADP ⋮ Fully abstract models and refinements as tools to compare agents in timed coordination languages ⋮ A Rice-style theorem for parallel automata ⋮ Refinement and verification in component-based model-driven design ⋮ On the relationships between notions of simulation-based security ⋮ Robust safety of timed automata ⋮ Systems with priorities: conformance, testing, and composition ⋮ The compression structure of a process ⋮ Calculi for synchrony and asynchrony ⋮ Axiomatising finite delay operators ⋮ Models of programs and processes ⋮ A complete inference system for a class of regular behaviours ⋮ Non-deterministic data types: Models and implementations ⋮ On the suitability of trace semantics for modular proofs of communicating processes ⋮ A proof-theoretic characterization of observational equivalence ⋮ A language for linking modules into systems ⋮ Specification-oriented semantics for communicating processes ⋮ Determinacy \(\to\) (observation equivalence \(=\) trace equivalence) ⋮ Hierarchical verification of asynchronous circuits using temporal logic ⋮ Performance evaluation of systems of cyclic sequential processes with mutual exclusion using Petri nets
This page was built for publication: A calculus of communicating systems
