Generalizing finiteness conditions of labelled transition systems

DOI10.1007/3-540-58201-0_83zbMath1422.68173OpenAlexW1499856730MaRDI QIDQ4632441

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 semanticsunique fixed pointlabeled transition systemsemantic 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)

Related Items (2)

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

Cites Work

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

This page was built for publication: Generalizing finiteness conditions of labelled transition systems