When are prime formulae characteristic?

DOI10.1016/J.TCS.2018.12.004MaRDI QIDQ2422016zbMATH OpenOpenAlexFDO

Authors Luca Aceto, Dario Della Monica, I. Fábregas, Anna Ingolfsdottir

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)

Recommendations

• When are prime formulae characteristic?
• Characteristic formulae for processes with divergence
• The complexity of identifying characteristic formulae
• Characteristic formulae for timed autoamta
• Characteristic formulae for fixed-point semantics: a general framework

Cites work

• scientific article; zbMATH DE number 3716792 (Why is no real title available?)
• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 176729 (Why is no real title available?)
• scientific article; zbMATH DE number 7319028 (Why is no real title available?)
• scientific article; zbMATH DE number 5585443 (Why is no real title available?)
• A modal characterization of observational congruence on finite terms of CCS
• Algebraic laws for nondeterminism and concurrency
• Characteristic formulae for processes with divergence
• Formal verification of parallel programs
• Graphical versus logical specifications
• Precongruence formats for decorated trace semantics
• Reactive Systems
• Termination, deadlock, and divergence
• The completeness problem for modal logic
• The linear time -- branching time spectrum. I: The semantics of concrete, sequential processes.
• Unifying the linear time-branching time spectrum of process semantics
• When are prime formulae characteristic?

Cited in

(4)

• The complexity of identifying characteristic formulae
• When are prime formulae characteristic?
• Removing redundant refusals: minimal complete test suites for failure trace semantics
• The complexity of deciding characteristic formulae in van Glabbeek's branching-time spectrum

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2422016)