Realizability of concurrent recursive programs
type: Item
instance of: scholarly article
title: Realizability of concurrent recursive programs
zbMATH Open document ID: 1425.68062
author: Benedikt Bollig
author: Manuela-Lidia Grindei
author: Peter Habermehl
published in: Formal Methods in System Design
publication date: 2018-11-15T00:00:00Z
Mathematics Subject Classification ID: 68N30
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68Q60
Mathematics Subject Classification ID: 68Q85
zbMATH DE Number: 6979619
zbMATH Keywords: concurrent recursive programs
zbMATH Keywords: realizability
zbMATH Keywords: asynchronous automata
zbMATH Keywords: nested-word automata
zbMATH Keywords: Mazurkiewicz traces
zbMATH Keywords: Zielonka's theorem
zbMATH Keywords: monadic second-order logic
MaRDI profile type: Publication
full work available at URL: s10703-017-0282-y
OpenAlex ID: W2738591572
cites work: Emptiness of Multi-pushdown Automata Is 2ETIME-Complete
cites work: Q2963915
cites work: Controllers for the Verification of Communicating Multi-pushdown Systems
cites work: Verifying Communicating Multi-pushdown Systems via Split-Width
cites work: Adding nesting structure to words
cites work: MULTI-PUSH-DOWN LANGUAGES AND GRAMMARS
cites work: Temporal logics for concurrent recursive programs: satisfiability and model checking
cites work: Model-Checking Bounded Multi-Pushdown Systems
cites work: Realizability of Concurrent Recursive Programs
cites work: The Complexity of Model Checking Multi-stack Systems
cites work: Synthesis of Safe Message-Passing Systems
cites work: On the Expressive Power of 2-Stack Visibly Pushdown Automata
cites work: MSO Decidability of Multi-Pushdown Systems via Split-Width
cites work: Optimal Zielonka-Type Construction of Deterministic Asynchronous Automata
cites work: A Kleene theorem and model checking algorithms for existentially bounded communicating automata
cites work: Q3504343
cites work: Constructing Exponential-Size Deterministic Zielonka Automata
cites work: Reachability Analysis of Communicating Pushdown Systems
cites work: A theory of regular MSC languages
cites work: Regular sets of infinite message sequence charts
cites work: Weighted asynchronous cellular automata
cites work: Bounded MSC communication
cites work: Context-Bounded Analysis of Concurrent Queue Systems
cites work: An Infinite Automaton Characterization of Double Exponential Time
cites work: Reachability of Multistack Pushdown Systems with Scope-Bounded Matching Relations
cites work: Scope-Bounded Pushdown Languages
cites work: A Unifying Approach for Multistack Pushdown Automata
cites work: Scope-bounded multistack pushdown systems: fixed-point, sequentialization, and tree-width
cites work: Interprocedural Analysis of Concurrent Programs Under a Context Bound
cites work: Model Checking Concurrent Recursive Programs Using Temporal Logics
cites work: Q4941891
cites work: The tree width of auxiliary storage
cites work: On Visibly Pushdown Trace Languages
cites work: An algorithmic approach for checking closure properties of temporal logic specifications and \(\omega\)-regular languages
cites work: Tools and Algorithms for the Construction and Analysis of Systems
cites work: CONCUR 2003 - Concurrency Theory
cites work: Q4714446
cites work: Notes on finite asynchronous automata
DOI: 10.1007/S10703-017-0282-Y
description: scientific article; zbMATH DE number 6979619