Generalizing finiteness conditions of labelled transition systems

DOI10.1007/3-540-58201-0_83zbMATH Open1422.68173OpenAlexW1499856730MaRDI QIDQ4632441FDOQ4632441

Authors: Franck van Breugel 

Publication date: 29 April 2019

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-58201-0_83

zbMATH Keywords

nonexpansive mappingoperational semanticslabeled transition systemunique fixed pointsemantic model

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• Real time process algebra
• Title not available (Why is that?)
• Solving reflexive domain equations in a category of complete metric spaces
• Title not available (Why is that?)
• Title not available (Why is that?)
• Four domains for concurrency
• Three metric domains of processes for bisimulation
• Linear time and branching time semantics for recursion with merge
• Contractions in comparing concurrency semantics
• Metric interpretations of infinite trees and semantics of non deterministic recursive programs
• Semantic Correctness for a Parallel Object-Oriented Language
• Title not available (Why is that?)
• Title not available (Why is that?)
• A hierarchy of domains for real-time distributed computing
• Processes as terms: non-well-founded models for bisimulation
• Generalizing finiteness conditions of labelled transition systems
• Topological models for higher order control flow
• Title not available (Why is that?)

Cited In (2)

• Generalizing finiteness conditions of labelled transition systems
• Bisimulation indexes and their applications

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)