Tableau methods for PA-processes

DOI10.1007/BFB0027420MaRDI QIDQ4610333zbMATH OpenOpenAlexFDO

Authors Richard M. Mayr

Publication date 15 January 2019

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bfb0027420

zbMATH Keywords

PA-processesprocess algebrastableau systemstemporal logic

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Model checking PA-processes
• scientific article; zbMATH DE number 1304991
• Tableau-based model checking in the propositional mu-calculus
• The regular viewpoint on PA-processes
• Decidable first-order transition logics for PA-processes

Cites work

• An Algorithm for the General Petri Net Reachability Problem
• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 1059894 (Why is no real title available?)
• scientific article; zbMATH DE number 1860681 (Why is no real title available?)
• scientific article; zbMATH DE number 2102740 (Why is no real title available?)
• Model checking PA-processes

Cited in

(6)

• Decidable first-order transition logics for PA-processes
• scientific article; zbMATH DE number 1670836 (Why is no real title available?)
• Reachability for finite-state process algebras using Horn clauses
• scientific article; zbMATH DE number 1304991 (Why is no real title available?)
• The regular viewpoint on PA-processes
• Model checking PA-processes

This page was built for publication: Tableau methods for PA-processes

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