scientific article

Publication date: 17 September 1992

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

nondeterminism continuous algebras communicating processes recursive processes finite processes testing processes

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Specification and verification (program logics, model checking, etc.) (68Q60) Research exposition (monographs, survey articles) pertaining to computer science (68-02)

Related Items

An exercise in the automatic verification of asynchronous designs, GSOS and finite labelled transition systems, A UTP approach for rTiMo, Model independent approach to probabilistic models, On the operational semantics of nondeterminism and divergence, Full abstraction and recursion, Deciding true concurrency equivalences on safe, finite nets, Partial ordering models for concurrency can be defined operationally, Duplication of constants in process algebra, A formal mathematical framework for modeling probabilistic hybrid systems, A complete axiomatization of finite-state ACSR processes, Quiescence, fairness, testing, and the notion of implementation, Type theory and concurrency, Generating the syntactic and semantics graphs for a Markovian process algebra, Complexity of equivalence problems for concurrent systems of finite agents, Shuffle on trajectories: Syntactic constraints, Processes with infinite liveness requirements, A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time, A fixpoint approach to finite delay and fairness, A general conservative extension theorem in process algebras with inequalities, Continuity spaces: Reconciling domains and metric spaces, Semantics for finite delay, Axiomatizing Lüttgen \& Vogler's ready simulation for finite processes in \(\mathrm{CLL}_{R}\), On real reward testing, A semantic theory for value-passing processes based on the late approach, Encoding transition systems in sequent calculus, Theory of interaction, Algebraic theory of probabilistic and nondeterministic processes., Algebraic theory of probabilistic processes., A partial ordering semantics for CCS, Linking operational semantics and algebraic semantics for a probabilistic timed shared-variable language, Hybrid I/O automata., Correctness of concurrent processes, A proof system for communicating processes with value-passing, Neural network implementation of fuzzy logic, An algebraic theory for web service contracts, Models for concurrency: Towards a classification, A complete axiomatization of timed bisimulation for a class of timed regular behaviours, Properties of a first-order functional language with sharing, Late and early semantics coincide for testing, Constraint nets: a semantic model for hybrid dynamic systems, Studying equivalences of transition systems with algebraic tools, A process algebraic view of input/output automata, Temporal theories as modularisation units for concurrent system specification, Experimenting with process equivalence, Modal logics for mobile processes, Universal axioms for bisimulations, A logical view of composition, Complete model-based equivalence class testing for nondeterministic systems, Structured operational semantics and bisimulation as a congruence, Forms of life: Unprogrammability constitutes the outside of a system and its autonomy, The mixed powerdomain, Communicating processes with value-passing and assignments, Automatic verification of distributed systems: the process algebra approach., On the expressiveness of interaction, Multitraces, hypertraces and partial order semantics, Rule formats for distributivity, Contexts, refinement and determinism, CCS with Hennessy's merge has no finite-equational axiomatization, The equational theory of prebisimilarity over basic CCS with divergence, A fully abstract may testing semantics for concurrent objects, The security pi-calculus and non-interference, A hierarchy of equivalences for asynchronous calculi, Contract-based discovery of Web services modulo simple orchestrators, A brief history of process algebra, Step failures semantics and a complete proof system, An axiomatic semantics for \(\mathsf{ioco} \underline{\mathsf{s}}\) conformance relation, Test generation from state based use case models, Modular specification of process algebras, Processes with local and global liveness requirements, Progress assumption in concurrent systems, (Bi)simulations up-to characterise process semantics, LOTOS extended with probabilistic behaviours, Improving performance in flexible manufacturing systems, Proof systems for message-passing process algebras, Computing with truly asynchronous threshold logic networks, On an effective hierarchy of communicating processes: Separation principle and testing, Full abstractness for a functional/concurrent language with higher-order value-passing, Non-well-founded sets modeled as ideal fixed points, An invitation to friendly testing, Receptive process theory, A conservative look at operational semantics with variable binding, Operational and denotational semantics for the box algebra, A complete equational axiomatization for MPA with string iteration, On performance congruences for process algebras, Process calculus based upon evaluation to committed form, Modelling and verification of delay-insensitive circuits using CCS and the concurrency workbench, Testing for refinement in \textsf{Circus}, A behavioural theory of first-order CML, A general theory of action languages, Basic observables for processes, Finite axiom systems for testing preorder and De Simone process languages, Inductive synthesis of recursive processes from logical properties, Free fuzzy modules and their bases, Testing congruence for mobile processes, CSP, partial automata, and coalgebras., A fully abstract denotational semantics for the \(\pi\)-calculus, A process algebra for probabilistic and nondeterministic processes, Process algebra and constraint programming for modeling interactions in MAS, An efficiency preorder for processes, On projecting processes into session types, Proving the validity of equations in GSOS languages using rule-matching bisimilarity, Termination, deadlock and divergence, Testing equivalence as a bisimulation equivalence, Towards a behavioural theory of access and mobility control in distributed systems, Final universes of processes, Inference Systems with Corules for Combined Safety and Liveness Properties of Binary Session Types, Verification and comparison of transition systems, Constructing systems as object communities, Testing for a conformance relation based on acceptance, Specification, testing and implementation relations for symbolic-probabilistic systems, Quantales, observational logic and process semantics, Contracts for Mobile Processes, A General Testability Theory, Concurrent testing of processes, Architectural CCS, Relating graph and term rewriting via Böhm models, On the structural simplicity of machines and languages, A linear-time branching-time perspective on interface automata, An algebraic framework for developing and maintaining real-time systems, CPO models for a class of GSOS languages, Fully abstract semantics for higher order communicating systems, Book review of: P. S. Churchland and T. J. Sejnowski, The computational brain, A genetically modified Hoare logic, Comparing transition systems with independence and asynchronous transition systems, Testing probabilistic automata, On relating concurrency and nondeterminism, On continuous time agents, Characterisations of testing preorders for a finite probabilistic \(\pi\)-calculus, Probabilistic may/must testing: retaining probabilities by restricted schedulers, Branching vs. Linear Time: Semantical Perspective, A New Roadmap for Linking Theories of Programming, Calculational derivation of a counter with bounded response time and bounded power dissipation, Generating diagnostic information for behavioral preorders, Real-reward testing for probabilistic processes, Axiomatizing weak simulation semantics over BCCSP, Timewise refinement for communicating processes, Higher-order processes and their models, Cathoristic Logic, The expressive power of delay operators in SCCS, A process calculus approach to detection and mitigation of PLC malware, Open maps, behavioural equivalences, and congruences, Separation of synchronous and asynchronous communication via testing, The island model as a Markov dynamic system, Solving recursive net equations, Divergence and fair testing, Process calculus based upon evaluation to committed form, Full abstraction for polymorphic \(\pi \)-calculus, Unifying Semantics for Concurrent Programming, May Testing, Non-interference, and Compositionality, A fully abstract denotational model for observational precongruence, Quantales, finite observations and strong bisimulation, On Finite Bases for Weak Semantics: Failures Versus Impossible Futures, On testing UML statecharts, Processes as formal power series: a coinductive approach to denotational semantics, A process calculus BigrTiMo of mobile systems and its formal semantics, Logical models of discrete even systems: a comparative exposition, Modelling Divergence in Relational Concurrent Refinement, Divergence in testing and readiness semantics, Derivation of a Suitable Finite Test Suite for Customized Probabilistic Systems, Behavioural abstraction in TCCS, Checking equivalences between concurrent systems of finite agents (Extended abstract), Testing preorders for probabilistic processes, On the Unification of Process Semantics: Equational Semantics, Introducing complexity to formal testing, Relating graph and term rewriting via Böhm models, A Theory of Monitors, A theory of monitors, The expressive power of delay operators in SCCS, Counting nondeterministic computations, An efficiency preorder for processes, CONFLICTS AND FAIR TESTING, Basic observables for processes, Typed behavioural equivalences for processes in the presence of subtyping, A Logical Process Calculus, Generic Models of the Laws of Programming, Bisimulation Relations for Dynamical and Control Systems, Bisimulation relations for dynamical, control, and hybrid systems, Ordered SOS process languages for branching and eager bisimulations, Remarks on Testing Probabilistic Processes, Simulations Up-to and Canonical Preorders, Monitoring for Silent Actions