Local model checking for context-free processes

DOI10.1007/3-540-56939-1_105zbMath1422.68163OpenAlexW1571376505MaRDI QIDQ4630295

Hardi Hungar, Bernhard Steffen

Publication date: 29 March 2019

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-56939-1_105

zbMATH Keywords

model checkingtransition systemautomatic verificationlabeled transition systemfree process

Mathematics Subject Classification ID

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

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Results on the propositional \(\mu\)-calculus
• Proof systems for satisfiability in Hennessy-Milner logic with recursion
• Tableau-based model checking in the propositional mu-calculus
• A linear-time model-checking algorithm for the alternation-free modal mu- calculus
• Automatic verification of finite-state concurrent systems using temporal logic specifications

This page was built for publication: Local model checking for context-free processes