scientific article; zbMATH DE number 1142329
From MaRDI portal
Publication:4385545
zbMath0900.68217MaRDI QIDQ4385545
Publication date: 14 May 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Semantics in the theory of computing (68Q55)
Related Items (47)
Modular structural operational semantics ⋮ Three metric domains of processes for bisimulation ⋮ Algebraic-coalgebraic specification in CoCASL ⋮ A format for semantic equivalence comparison ⋮ An improvement of algorithms for solving interface equations ⋮ Type inference for record concatenation and subtyping ⋮ The \$-calculus process algebra for problem solving: A paradigmatic shift in handling hard computational problems ⋮ Merge-and-Shrink Abstraction ⋮ A complete axiomatization of weighted branching bisimulation ⋮ Unnamed Item ⋮ Modelling mutual exclusion in a process algebra with time-outs ⋮ Unique parallel decomposition in branching and weak bisimulation semantics ⋮ Comparing the expressiveness of the \(\pi \)-calculus and CCS ⋮ Proving correctness of labeled transition systems by semantic tableaux ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unique solutions of contractions, CCS, and their HOL formalisation ⋮ Relational structures model of concurrency ⋮ Travelling salesman problem in tissue P systems with costs ⋮ Computing the Maximum Bisimulation with Spiking Neural P Systems ⋮ Observational structures and their logic ⋮ ACTLW -- an action-based computation tree logic with unless operator ⋮ Branching Bisimulation Congruence for Probabilistic Systems ⋮ Set graphs. II. Complexity of set graph recognition and similar problems ⋮ Dynamic consistency in process algebra: from paradigm to ACP ⋮ On cool congruence formats for weak bisimulations ⋮ The free process algebra generated by \(\delta \), \(\epsilon\) and \(\tau \) ⋮ Nonconflict check by using sequential automaton abstractions based on weak observation equivalence ⋮ Bisimulation and coinduction enhancements: a historical perspective ⋮ Bisimulation for labelled Markov processes ⋮ A first order logic for specification of timed algorithms: Basic properties and a decidable class ⋮ Branching time controllers for discrete event systems ⋮ On a relation between algebraic programs and Turing machines ⋮ Unnamed Item ⋮ Model Refinement Using Bisimulation Quotients ⋮ An Incremental Bisimulation Algorithm ⋮ Bi-inductive structural semantics ⋮ Unnamed Item ⋮ Synchronization expressions with extended join operation ⋮ Relational transducers for electronic commerce ⋮ Hereditarily-finite sets, data bases and polynomial-time computability ⋮ Bi-inductive Structural Semantics ⋮ Constructive design of a hierarchy of semantics of a transition system by abstract interpretation ⋮ Equivalence notions and model minimization in Markov decision processes ⋮ Process algebra and constraint programming for modeling interactions in MAS ⋮ Untyped lambda-calculus with input-output
This page was built for publication:
