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 (only showing first 100 items - show all)

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 ⋮ 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

This page was built for publication: