Hyper partial order logic
From MaRDI portal
Publication:5090956
DOI10.4230/LIPICS.FSTTCS.2018.20MaRDI QIDQ5090956FDOQ5090956
Authors: Béatrice Bérard, Stefan Haar, Loïc Hélouët 
Publication date: 21 July 2022
Recommendations
- Deciding global partial-order properties
- Model-checking games for fixpoint logics with partial order models
- Model checking algorithms for hyperproperties (invited paper)
- Model-Checking Games for Fixpoint Logics with Partial Order Models
- A partial order approach to branching time logic model checking.
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Theory of computing (68Qxx)
Cites Work
- Graph minors. X: Obstructions to tree-decomposition
- Hyperedge replacement: grammars and languages
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Graph structure and monadic second-order logic. A language-theoretic approach
- Branching processes of Petri nets
- An improvement of McMillan's unfolding algorithm
- Unfolding-based diagnosis of systems with an evolving topology
- A technique of state space search based on unfolding
- Concurrent secrets
- Title not available (Why is that?)
- Propositional dynamic logic for message-passing systems
- MSO decidability of multi-pushdown systems via split-width
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
- Model Checking on Trees with Path Equivalences
- Title not available (Why is that?)
- Reasoning about layered message passing systems
- Logic-based diagnosis for distributed systems
- The complexity of diagnosability and opacity verification for Petri nets
- Unfolding-Based Diagnosis of Systems with an Evolving Topology
- Trees over infinite structures and path logics with synchronization
Cited In (3)
This page was built for publication: Hyper partial order logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5090956)
