Logical vs. behavioural specifications
type: Item
instance of: scholarly article
title: Logical vs. behavioural specifications
zbMATH Open document ID: 1435.68189
author: Nikola Beneš
author: Uli Fahrenberg
author: Jan Křetínský
author: Axel Legay
author: Louis-Marie Traonouez
published in: Information and Computation
publication date: 2020-03-12T00:00:00Z
full work available at URL: bmts.pdf
Mathematics Subject Classification ID: 68Q60
Mathematics Subject Classification ID: 03B70
Mathematics Subject Classification ID: 68Q85
zbMATH DE Number: 7179700
zbMATH Keywords: component-based design
zbMATH Keywords: refinement
zbMATH Keywords: logic
zbMATH Keywords: modal transition system
zbMATH Keywords: specification
describes a project that uses: MIO Workbench
describes a project that uses: CESAR
describes a project that uses: Motras
MaRDI profile type: Publication
OpenAlex ID: W2729250683
cites work: Partial model checking of modal equations: a survey
cites work: Compositional checking of satisfaction
cites work: Extending modal transition systems with structured labels
cites work: Modal Transition Systems: Composition and LTL Model Checking
cites work: Hennessy-Milner Logic with Greatest Fixed Points as a Complete Behavioural Specification Theory
cites work: Parametric Modal Transition Systems
cites work: On determinism in modal transition systems
cites work: Process algebra for modal transition systemses
cites work: From programs to systems. The systems perspective in computing. ETAPS workshop, FPS 2014, in honor of Joseph Sifakis, Grenoble, France, April 6, 2014. Proceedings
cites work: Representation, reasoning, and relational structures: a hybrid logic manifesto
cites work: Graphical versus logical specifications
cites work: Q4818796
cites work: Automated technology for verification and analysis. 9th international symposium, ATVA 2011, Taipei, Taiwan, October 11--14, 2011. Proceedings
cites work: A spatial logic for concurrency. I
cites work: Modular Markovian Logic
cites work: Q3336675
cites work: Supervisory Control for Opacity
cites work: Parametric and Quantitative Extensions of Modal Transition Systems
cites work: A linear-time-branching-time spectrum for behavioral specification theories
cites work: Structural Refinement for the Modal nu-Calculus
cites work: Comparing disjunctive modal transition systems with an one-selecting variant
cites work: Compositionality of Hennessy-Milner logic by structural operational semantics
cites work: Compositionality of Probabilistic Hennessy-Milner Logic through Structural Operational Semantics
cites work: Linear logic
cites work: THE STRUCTURE OF COMMUTATIVE RESIDUATED LATTICES
cites work: Acceptance trees
cites work: Algebraic laws for nondeterminism and concurrency
cites work: Automata for the modal μ-calculus and related results
cites work: Results on the propositional \(\mu\)-calculus
cites work: 30 Years of Modal Transition Systems: Survey of Extensions and Analysis
cites work: MoTraS: A Tool for Modal Transition Systems and Their Extensions
cites work: Automatic verification methods for finite state systems. International workshop, Grenoble, France, June 12-14, 1989. Proceedings
cites work: Proof systems for satisfiability in Hennessy-Milner logic with recursion
cites work: Q4038716
cites work: Q4783297
cites work: Q3940830
cites work: A modal interface theory for component-based design
cites work: Residuated Lattices
Wikidata QID: Q126785428
DOI: 10.1016/J.IC.2019.104487
description: scientific article