First-order logic with reachability for infinite-state systems

DOI10.1145/2933575.2934552MaRDI QIDQ4635903zbMATH OpenOpenAlexWikidataFDO

Authors Emanuele D'Osualdo, Roland Meyer, Georg Zetzsche

Publication date 23 April 2018

Published in Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2933575.2934552

zbMATH Keywords

reachabilityautomatic structuresdecidabilityfirst-order logicgraph monoidsvalence automata

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Decidability of theories and sets of sentences (03B25) Logic in computer science (03B70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• First-order logic with reachability predicates on infinite systems
• A logical reconstruction of reachability
• Petri net reachability graphs: decidability status of FO properties
• Petri net reachability graphs: decidability status of first order properties
• Recent advances on reachability problems for valence systems (invited talk)

Cited in

(9)

• Bounded context switching for valence systems
• A logical reconstruction of reachability
• First-order logic with reachability predicates on infinite systems
• Regular separability of one counter automata
• First-order Logic with Connectivity Operators
• scientific article; zbMATH DE number 1088041 (Why is no real title available?)
• The complexity of bidirected reachability in valence systems
• Recent advances on reachability problems for valence systems (invited talk)
• Decidability of reachability for polymorphic systems with arrays: a complete classification

This page was built for publication: First-order logic with reachability for infinite-state systems

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