Time abstracted bisimulation: Implicit specifications and decidability

DOI10.1007/3-540-58027-1_8OpenAlexW1552249698MaRDI QIDQ5890046

Wang Yi, Kim Guldstrand Larsen

Publication date: 28 April 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-58027-1_8

zbMATH Keywords

parallel compositionoperational semanticfull versionsymbolic model checksymbolic state

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (1)

A modal characterization of alternating approximate bisimilarity

Cites Work

• CCS expressions, finite state processes, and three problems of equivalence
• Three Partition Refinement Algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Time abstracted bisimulation: Implicit specifications and decidability