scientific article; zbMATH DE number 1142329

Cited in

(47)

Bi-inductive structural semantics
Observational structures and their logic
On a relation between algebraic programs and Turing machines
Synchronization expressions with extended join operation
Hereditarily-finite sets, data bases and polynomial-time computability
Relational transducers for electronic commerce
Constructive design of a hierarchy of semantics of a transition system by abstract interpretation
Modular structural operational semantics
A format for semantic equivalence comparison
Type inference for record concatenation and subtyping
Travelling salesman problem in tissue P systems with costs
A complete axiomatization of weighted branching bisimulation
Unique solutions of contractions, CCS, and their HOL formalisation
Set graphs. II. Complexity of set graph recognition and similar problems
Bisimulation and coinduction enhancements: a historical perspective
Algebraic-coalgebraic specification in CoCASL
The \$-calculus process algebra for problem solving: A paradigmatic shift in handling hard computational problems
ACTLW -- an action-based computation tree logic with unless operator
Bisimulation for labelled Markov processes
Bi-inductive structural semantics (extended abstract)
An improvement of algorithms for solving interface equations
Computing the Maximum Bisimulation with Spiking Neural P Systems
Model refinement using bisimulation quotients
Merge-and-Shrink Abstraction
scientific article; zbMATH DE number 7449995 (Why is no real title available?)
Proving correctness of labeled transition systems by semantic tableaux
Failure trace semantics for a process algebra with time-outs
Bisimulation and Hennessy-Milner logic for generalized synchronization trees
scientific article; zbMATH DE number 7453959 (Why is no real title available?)
Deciding all behavioral equivalences at once: a game for linear-time-branching-time spectroscopy
scientific article; zbMATH DE number 7243676 (Why is no real title available?)
Branching bisimulation congruence for probabilistic systems
Dynamic consistency in process algebra: from paradigm to ACP
An Incremental Bisimulation Algorithm
On cool congruence formats for weak bisimulations
The free process algebra generated by $\delta $, $\epsilon$ and $\tau $
Untyped lambda-calculus with input-output
Three metric domains of processes for bisimulation
A first order logic for specification of timed algorithms: Basic properties and a decidable class
Branching time controllers for discrete event systems
Modelling mutual exclusion in a process algebra with time-outs
Comparing the expressiveness of the $\pi $-calculus and CCS
Equivalence notions and model minimization in Markov decision processes
Process algebra and constraint programming for modeling interactions in MAS
Unique parallel decomposition in branching and weak bisimulation semantics
Relational structures model of concurrency
Nonconflict check by using sequential automaton abstractions based on weak observation equivalence

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4385545)