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