When Are Prime Formulae Characteristic?

DOI10.1007/978-3-662-48057-1_6zbMath1425.68245OpenAlexW1462454695MaRDI QIDQ2946326

I. Fábregas, Dario Della Monica, Luca Aceto, Anna Ingólfsdóttir

Publication date: 16 September 2015

Published in: Mathematical Foundations of Computer Science 2015 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-48057-1_6

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (3)

When Are Prime Formulae Characteristic? ⋮ When are prime formulae characteristic? ⋮ Logical characterization of fluid equivalences

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graphical versus logical specifications
• Bisimulation through probabilistic testing
• Characteristic formulae for processes with divergence
• Unifying the Linear Time-Branching Time Spectrum of Process Semantics
• When Are Prime Formulae Characteristic?
• A modal characterization of observational congruence on finite terms of CCS
• Formal verification of parallel programs
• Bisimulation can't be traced
• Reactive Systems

This page was built for publication: When Are Prime Formulae Characteristic?