scientific article; zbMATH DE number 604884

zbMATH Open0810.68093MaRDI QIDQ4299862FDOQ4299862

Authors: Rob van Glabbeek 

Publication date: 4 April 1995

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 1860680
• Branching time and abstraction in bisimulation semantics
• “Sometimes” and “not never” revisited
• Branching vs. Linear Time: Semantical Perspective
• The linear time -- branching time spectrum. I: The semantics of concrete, sequential processes.

zbMATH Keywords

branching timesemantics of concurrent systems

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Semantics in the theory of computing (68Q55)

Cited In (11)

• An algebraic semantics for hierarchical P/T nets
• Title not available (Why is that?)
• Deciding orthogonal bisimulation
• A generic framework for checking semantic equivalences between pushdown automata and finite-state automata
• Rooted branching bisimulation as a congruence
• Characteristic invariants in Hennessy-Milner logic
• A brief history of process algebra
• Life-cycle inheritance
• The compression structure of a process
• Nonprimitive recursive complexity and undecidability for Petri net equivalences
• Branching time and orthogonal bisimulation 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 Q4299862)