Publication:3992568
From MaRDI portal
zbMath0683.68008MaRDI QIDQ3992568
Publication date: 23 January 1993
communication; synchronization; confluence; concurrency; determinacy; process; bisimulation bisimilarity
68Q45: Formal languages and automata
68Q60: Specification and verification (program logics, model checking, etc.)
68Q65: Abstract data types; algebraic specification
68-02: Research exposition (monographs, survey articles) pertaining to computer science
68N01: General topics in the theory of software
68N25: Theory of operating systems
Related Items
Bisimulations and predicate logic, Unnamed Item, On deciding some equivalences for concurrent processes, A note on Coinduction and Weak Bisimilarity for While Programs, A Finite Axiomatization of Nondeterministic Regular Expressions, A note on the complexity of deciding bisimilarity of normed unary processes, On sequential composition, action prefixes and process prefix, Refinement of events in the development of real-time distributed systems, Proofs as processes, Comparing locality and causality based equivalences, A logic for reasoning about time and reliability, Automatizing parametric reasoning on distributed concurrent systems, Denotational semantics in the cpo and metric approach, Using integer programming to verify general safety and liveness properties, Simple proof techniques for property preservation via simulation, Extension of synthesis algorithm of recursive processes to \(\mu\)-calculus, On reduction-based process semantics, On the operational semantics of nondeterminism and divergence, On path equivalence of nondeterministic finite automata, A polynomial algorithm for deciding bisimilarity of normed context-free processes, Time-abstracted bisimulation: Implicit specifications and decidability, Deciding true concurrency equivalences on safe, finite nets, An equational axiomatization for multi-exit iteration, Petri nets for the design and operation of manufacturing systems, A complete axiomatization of finite-state ACSR processes, Complexity of equivalence problems for concurrent systems of finite agents, Proving properties of dynamic process networks, Open maps, behavioural equivalences, and congruences, Fairness and control in multi-agent systems, A process algebra of communicating shared resources with dense time and priorities, Petri nets, traces, and local model checking, Confluence in concurrent constraint programming, Specification of abstract dynamic-data types: A temporal logic approach, Trees and semantics, Essential transitions to bisimulation equivalences, The algebra of communicating processes with empty process, A general conservative extension theorem in process algebras with inequalities, Process algebra with language matching, Two finite specifications of a queue, Constructing process categories, Composition and behaviors of probabilistic I/O automata, Semantics for finite delay, Comparing three semantics for Linda-like languages, Continuation-based transformations for coordination languages, Types for access control, Towards a unified view of bisimulation: A comparative study, A complexity analysis of bisimilarity for value-passing processes, Linda-based applicative and imperative process algebras, Weak confluence and \(\tau\)-inertness, Object-oriented hybrid systems of coalgebras plus monoid actions, Finite axiom systems for testing preorder and De Simone process languages, Effective decomposability of sequential behaviours, Two decentralized algorithms for strong interaction fairness for systems with unbounded speed variability, Delay-insensitivity and ternary simulation, Verification of reactive systems using temporal logic with clocks, Automata of asynchronous behaviors, Complete formal systems for equivalence problems, A small final coalgebra theorem, ConGolog, a concurrent programming language based on the situation calculus, A representation result for free cocompletions, Congruent weak bisimulation with dense real-time, Modular specification of process algebras, Algebra and theory of order-deterministic pomsets, Action transducers and timed automata, Priority as extremal probability, Compositional minimisation of finite state systems using interface specifications, On a class of timer hybrid systems reducible to finite state automata, A Petri nets semantics for data flow networks, A modal logic for message passing processes, Asynchronous communication model based on linear logic, Compositional refinements in multiple blackboard systems, A theory of bisimulation for the \(\pi\)-calculus, Concurrent testing of processes, Compositional failure-based semantic models for basic LOTOS, Set theory for verification. II: Induction and recursion, Interpreting message flow graphs, On simulation, subtyping and substitutability in sequential object systems, Architectural CCS, Discrete time process algebra, On CCS with parametric relabelling, Decidable hybrid systems, Timing and causality in process algebra, Variations on mobile processes, A specification structure for deadlock-freedom of synchronous processes, Models of nondeterministic regular expressions, Petri nets and regular processes, Selective mu-calculus and formula-based equivalence of transition systems, Rooted branching bisimulation as a congruence, Deciding bisimilarity and similarity for probabilistic processes., Formalism and method, Refinement-oriented probability for CSP, Computable processes and bisimulation equivalence, Equality of agent expressions is preserved under an extension of the universe of actions, Process synchronisation as fusion, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, The logic of recursive equations, Denotational linear time semantics and sequential composition, Forum: A multiple-conclusion specification logic, Modelling causality via action dependencies in branching time semantics, \(\pi\)-calculus, internal mobility, and agent-passing calculi, Metric completion versus ideal completion, Models for concurrency: Towards a classification, Locality and interleaving semantics in calculi for mobile processes, From CML to its process algebra, Probabilistic communicating processes, A complete axiomatization of timed bisimulation for a class of timed regular behaviours, Infinite normal forms for non-linear term rewriting systems, Undecidability of bisimilarity for Petri nets and some related problems, Location equivalence in a parametric setting, A multiset semantics for the pi-calculus with replication, Trapping mutual exclusion in the box calculus, Petri nets and bisimulation, Structural operational semantics for weak bisimulations, On the implementation of concurrent calculi in net calculi: two case studies, The weakest deadlock-preserving congruence, Computable concurrent processes, Deciding observational congruence of finite-state CCS expressions by rewriting, Translations between modal logics of reactive systems, A theory of processes with durational actions, Symbolic bisimulations, A process algebraic view of input/output automata, Transition system specifications with negative premises, Modal logics for mobile processes, The expressive power of implicit specifications, Universal axioms for bisimulations, Observing localities, Computational interpretations of linear logic, Graph rewriting for a partial ordering semantics of concurrent constraints programming, Algorithms for task allocation in ants. (A study of temporal polyethism: Theory), Communicating processes with value-passing and assignments, A CCS-based investigation of deadlock in a multi-process electronic mail system, A process algebraic view of Linda coordination primitives, A process-calculus-based abstraction for coordinating multi-agent groups, Shuffle on trajectories: Syntactic constraints, A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time, A fixpoint approach to finite delay and fairness, On the coarsest congruence within global-clock-bounded equivalence, A note on model checking the modal \(\nu\)-calculus, Local model checking in the modal mu-calculus, A proof system for communicating processes with value-passing, An agent calculus with simple actions where the enabling and disabling are derived operators, A note on the characterization of weak bisimulation congruence in CCS, Conditional rewriting logic as a unified model of concurrency, The chemical abstract machine, A compositional protocol verification using relativized bisimulation, Causal automata, Finitary logics for some CCS observational bisimulations, A calculus of mobile processes. I, A calculus of mobile processes. II, Structured operational semantics and bisimulation as a congruence, Complete sets of axioms for finite basic LOTOS behavioural equivalences, Deciding bisimilarity is P-complete, An algebraic verification of a mobile network, Unique decomposition of processes, From algebra to operational semantics, LOTOS extended with probabilistic behaviours, Full abstractness for a functional/concurrent language with higher-order value-passing, A formal approach to the integration of performance aspects in the modeling and analysis of concurrent systems, A conservative look at operational semantics with variable binding, Operational and denotational semantics for the box algebra, Multisets and structural congruence of the pi-calculus with replication, A complete equational axiomatization for MPA with string iteration, Concurrency and knowledge-level communication in agent languages, Partial confluence of processes and systems of objects, On performance congruences for process algebras, Process calculus based upon evaluation to committed form, A process algebra with distributed priorities, On transformations of concurrent-object programs, On bisimulations for the asynchronous \(\pi\)-calculus, Bisimulations for a calculus of broadcasting systems, Reasoning about nondeterministic and concurrent actions: A process algebra approach, A calculus for cryptographic protocols: The spi calculus, Exact performance equivalence: An equivalence relation for stochastic automata, A behavioural theory of first-order CML, Non-interleaving semantics for mobile processes, A shorter proof to uniqueness of solutions of equations, A general theory of action languages, Basic observables for processes, Quantitative semantics, topology, and possibility measures, On deciding trace equivalences for processes, Deciding bisimilarity of normed context-free processes is in \(\Sigma_ 2^ p\), Realizability interpretation of coinductive definitions and program synthesis with streams, Defining concurrent processes constructively, An abstract machine for concurrent modular systems: CHARM, The formalization and analysis of a communications protocol, A co-induction principle for recursively defined domains, From ATP to timed graphs and hybrid systems, Proving finiteness of CCS processes by non-standard semantics, An efficiency preorder for processes, Plain CHOCS. A second generation calculus for higher order processes, An exercise in the automatic verification of asynchronous designs, Process algebra with guards: Combining hoare logic with process algebra, A theory of processes with localities, A static view of localities, A semantic characterization for faults in replicated systems, GSOS and finite labelled transition systems, Unnamed Item
