When are prime formulae characteristic?

DOI10.1016/J.TCS.2018.12.004zbMATH Open1425.68246OpenAlexW2904586419MaRDI QIDQ2422016FDOQ2422016

I. Fábregas, Luca Aceto, Anna Ingolfsdottir, 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)

Cites Work

• The linear time -- branching time spectrum. I: The semantics of concrete, sequential processes.
• Algebraic laws for nondeterminism and concurrency
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Reactive Systems
• Formal verification of parallel programs
• Termination, deadlock, and divergence
• Graphical versus logical specifications
• Precongruence formats for decorated trace semantics
• Title not available (Why is that?)
• A modal characterization of observational congruence on finite terms of CCS
• Characteristic formulae for processes with divergence
• The completeness problem for modal logic
• Unifying the linear time-branching time spectrum of process semantics
• Title not available (Why is that?)
• When Are Prime Formulae Characteristic?

Cited In (1)

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

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)