Generalizing finiteness conditions of labelled transition systems
From MaRDI portal
(Redirected from Publication:4632441)
Cites work
- A hierarchy of domains for real-time distributed computing
- Contractions in comparing concurrency semantics
- Four domains for concurrency
- Generalizing finiteness conditions of labelled transition systems
- scientific article; zbMATH DE number 1638656 (Why is no real title available?)
- scientific article; zbMATH DE number 3167394 (Why is no real title available?)
- scientific article; zbMATH DE number 3890714 (Why is no real title available?)
- scientific article; zbMATH DE number 3658971 (Why is no real title available?)
- scientific article; zbMATH DE number 3716749 (Why is no real title available?)
- scientific article; zbMATH DE number 3344529 (Why is no real title available?)
- Linear time and branching time semantics for recursion with merge
- Metric interpretations of infinite trees and semantics of non deterministic recursive programs
- Processes as terms: non-well-founded models for bisimulation
- Real time process algebra
- Semantic Correctness for a Parallel Object-Oriented Language
- Solving reflexive domain equations in a category of complete metric spaces
- Three metric domains of processes for bisimulation
- Topological models for higher order control flow
Cited in
(2)
This page was built for publication: Generalizing finiteness conditions of labelled transition systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4632441)