Publication:3777424

Publication date: 1985

trace; parallel processes; sequential processes; Lisp; inter-process communication; combination of different devices; comprehension of formal definitions; variety of events

Mathematics Subject Classification ID

68Q45: Formal languages and automata

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

Related Items

Denotational linear time semantics and sequential composition, Models for concurrency: Towards a classification, Probabilistic communicating processes, A complete axiomatization of timed bisimulation for a class of timed regular behaviours, A parallel algorithm for static program slicing, The weakest deadlock-preserving congruence, Computable concurrent processes, A brief history of Timed CSP, Probabilistic and prioritized models of timed CSP, A process algebraic view of input/output automata, Structure of concurrency, 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, Deriving graphical representations of process networks from algebraic expressions, Specification techniques for Markov reward models, Algorithms for task allocation in ants. (A study of temporal polyethism: Theory), Communicating processes with value-passing and assignments, Adas and the equational theory of if-then-else, A process-calculus-based abstraction for coordinating multi-agent groups, A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time, An incremental specification of the sliding-window protocol, Design and verification of fault tolerant systems with CSP, Correctness of concurrent processes, Algebraic and fixed point equations over inverse limits of algebras, Specification styles in distributed systems design and verification, Connectedness and synchronization, A proof system for communicating processes with value-passing, Minimizing the number of transitions with respect to observation equivalence, An agent calculus with simple actions where the enabling and disabling are derived operators, Concurrent regular expressions and their relationship to Petri nets, Semantics for data parallel computation, A model of reconfiguration in communicating sequential processes with a notion of transactions, On controllability and normality of discrete event dynamical systems, Conditional rewriting logic as a unified model of concurrency, The chemical abstract machine, An algebraic approach to supervisory control, Temporal theories as modularisation units for concurrent system specification, Specifying modules to satisfy interfaces: A state transition system approach, Experimenting with process equivalence, Causal automata, A compositional axiomatization of statecharts, A calculus of mobile processes. I, Complete sets of axioms for finite basic LOTOS behavioural equivalences, Sequential to parallel buffer refinement, Multitraces, hypertraces and partial order semantics, An algebra for process creation, TIC: a tImed calculus, LOTOS extended with probabilistic behaviours, The semantics of the combination of atomized statements and parallel choice, Verified compilation of communicating processes into clocked circuits, Liveness in timed and untimed systems, A formal approach to the integration of performance aspects in the modeling and analysis of concurrent systems, An invitation to friendly testing, A conservative look at operational semantics with variable binding, Operational and denotational semantics for the box algebra, The timed failures -- Stability model for CSP, A complete equational axiomatization for MPA with string iteration, A process algebra with distributed priorities, Reasoning about nondeterministic and concurrent actions: A process algebra approach, A calculus for cryptographic protocols: The spi calculus, A general theory of action languages, Basic observables for processes, Distributed games, On deciding trace equivalences for processes, A complete modal proof system for HAL: the Herbrand agent language, An abstract machine for concurrent modular systems: CHARM, A formal model of asynchronous communication and its use in mechanically verifying a biphase mark protocol, Nondeterminacy and recursion via stacks and games, Object inheritance beyond subtyping, The connection between an event structure semantics and an operational semantics for TCSP, Infinitary parallelism without unbounded nondeterminism in CSP, An efficiency preorder for processes, Composition laws for entropy and temperature in tree-like graphs, Axiomatic-like performance analysis (ALPA), An exercise in the automatic verification of asynchronous designs, Recursion induction for real-time processes, Process algebra with guards: Combining hoare logic with process algebra, A semantic characterization for faults in replicated systems, A specification-oriented semantics for the refinement of real-time systems, GSOS and finite labelled transition systems, Supervisory control using variable lookahead policies, A fully abstract trace model for dataflow and asynchronous networks, On sequential composition, action prefixes and process prefix, Natural discrete-event process forecasting: A decision support system, Refinement of events in the development of real-time distributed systems, Proofs as processes, Processes with probabilities, priority and time, Automatizing parametric reasoning on distributed concurrent systems, Using integer programming to verify general safety and liveness properties, A polynomial algorithm for deciding bisimilarity of normed context-free processes, Actors, actions, and initiative in normative system specification, Verifying a distributed list system: A case history, Two implementation relations and the correctness of communicating replicated processes, Time-abstracted bisimulation: Implicit specifications and decidability, A class of non-deterministic specifications for supervisory control, An equational axiomatization for multi-exit iteration, Quantales, observational logic and process semantics, Step bisimulation is pomset equivalence on a parallel language without explicit internal choice, Neural networks and adaptive expert systems in the CSA approach, Unnamed Item, Unnamed Item, AXIOMATIC FRAMEWORKS FOR DEVELOPING BSP-STYLE PROGRAMS∗, A self-modifiable approach to scheduling and mapping algorithms in multiprocessor systems, The difference between splitting in \(n\) and \(n+1\), A complete axiomatization of finite-state ACSR processes, Quiescence, fairness, testing, and the notion of implementation, Running programs backwards: The logical inversion of imperative computation, Complexity of equivalence problems for concurrent systems of finite agents, Fairness and control in multi-agent systems, A process algebra of communicating shared resources with dense time and priorities, The equational logic of fixed points, Notes on the methodology of CCS and CSP, Two finite specifications of a queue, Constructing process categories, Linda-based applicative and imperative process algebras, Finite axiom systems for testing preorder and De Simone process languages, Delay-insensitivity and ternary simulation, A hidden agenda, ConGolog, a concurrent programming language based on the situation calculus, Modular specification of process algebras, Locked discrete event systems: How to model and how to unlock, The sliding-window protocol revisited, Progress assumption in concurrent systems, Action systems, unbounded nondeterminism, and infinite traces, A coordination theory for intelligent machines, Action transducers and timed automata, On a class of timer hybrid systems reducible to finite state automata, Compositional refinements in multiple blackboard systems, Compositional failure-based semantic models for basic LOTOS, Interpreting message flow graphs, On simulation, subtyping and substitutability in sequential object systems, A theory of Orwellian specifications with NewThink, Semantics of under-determined expressions, Architectural CCS, Discrete time process algebra, Retargeting a hardware compiler using protocol converters, Stochastic modelling of diffusion equations on a parallel machine, Timing and causality in process algebra, A specification structure for deadlock-freedom of synchronous processes, Topology in process calculus. I: Limit behaviour of agents, Formalism and method, Refinement-oriented probability for CSP, Testing equivalence as a bisimulation equivalence, Process synchronisation as fusion, A constant time string shuffle algorithm on reconfigurable meshes, Supervisory control of concurrent discrete-event systems, Transputers for solving any system of linear equations, Sheaf semantics for concurrent interacting objects, Discrete events and general systems theory, Unnamed Item, Unnamed Item, Specifications in stochastic process algebra for a robot control problem