Leafy automata for higher-order concurrency

DOI10.1007/978-3-030-71995-1_10MaRDI QIDQ2233404zbMATH OpenOpenAlexFDO

Authors Alex Dixon, Ranko Lazić, Andrzej S. Murawski, Igor Walukiewicz

Publication date 18 October 2021

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/2101.08720

zbMATH Keywords

game semanticshigher-order concurrencyautomata over infinite alphabetsfinitary idealized concurrent algol

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

Cites work

• scientific article; zbMATH DE number 1670817 (Why is no real title available?)
• scientific article; zbMATH DE number 1722647 (Why is no real title available?)
• scientific article; zbMATH DE number 7445154 (Why is no real title available?)
• scientific article; zbMATH DE number 1223609 (Why is no real title available?)
• scientific article; zbMATH DE number 1342245 (Why is no real title available?)
• Abstract machines for game semantics, revisited
• Angelic semantics of fine-grained concurrency
• Automata for XML -- a survey
• Fragments of ML decidable by nested data class memory automata
• Game semantic analysis of equivalence in IMJ
• Game-theoretic analysis of call-by-value computation
• Games for complexity of second-order call-by-name programs
• Leafy automata for higher-order concurrency
• Model-checking higher-order programs with recursive types
• On notions of regularity for data languages
• On-the-Fly Techniques for Game-Based Software Model Checking
• Ordered navigation on multi-attributed data words
• Reducing Context-Bounded Concurrent Reachability to Sequential Reachability
• Saturation of Concurrent Collapsible Pushdown Systems
• Shuffle Expressions and Words with Nested Data
• Syntactic control of concurrency
• The geometry of concurrent interaction: handling multiple ports by way of multiple tokens
• The reachability problem for Petri nets is not elementary
• Third-order Idealized Algol with iteration is decidable
• Tools and Algorithms for the Construction and Analysis of Systems
• Tools and Algorithms for the Construction and Analysis of Systems
• Tools and Algorithms for the Construction and Analysis of Systems
• Two-variable logic on data words
• Verifying communicating multi-pushdown systems via split-width
• Weak and nested class memory automata

Cited in

(2)

• Leafy automata for higher-order concurrency
• Automata for true concurrency properties

This page was built for publication: Leafy automata for higher-order concurrency

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