When are prime formulae characteristic?

DOI10.1016/j.tcs.2018.12.004zbMath1425.68246OpenAlexW2904586419MaRDI QIDQ2422016

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

Publication date: 18 June 2019

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2018.12.004

zbMATH Keywords

logicscharacteristic formulaeprocess semantics(bi)simulation

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 (1)

Removing redundant refusals: minimal complete test suites for failure trace semantics

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graphical versus logical specifications
• Characteristic formulae for processes with divergence
• The completeness problem for modal logic
• 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
• Algebraic laws for nondeterminism and concurrency
• Formal verification of parallel programs
• Termination, deadlock, and divergence
• Precongruence formats for decorated trace semantics
• Reactive Systems

This page was built for publication: When are prime formulae characteristic?