Realizability of Concurrent Recursive Programs

Authors:
Benedikt Bollig;Manuela-Lidia Grindei;Peter Habermehl
Affiliations:
LSV, ENS Cachan, CNRS, INRIA, France;LSV, ENS Cachan, CNRS, INRIA, France;LSV, ENS Cachan, CNRS, INRIA, France and LIAFA, CNRS and University Paris Diderot (Paris 7), France
Venue:
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Year:
2009

Citing 19
Cited 2

An algorithmic approach for checking closure properties of temporal logic specifications and &ohgr;-regular languages

Theoretical Computer Science
Context-sensitive synchronization-sensitive analysis is undecidable

ACM Transactions on Programming Languages and Systems (TOPLAS)
The Book of Traces

The Book of Traces
LTL is expressively complete for Mazurkiewicz traces

Journal of Computer and System Sciences
Message Sequence Graphs and Decision Problems on Mazurkiewicz Traces

MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
The "Last" Decision Problem for Rational Trace Languages

LATIN '92 Proceedings of the 1st Latin American Symposium on Theoretical Informatics
Decompositions of Asynchronous Systems

CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Synthesizing Distributed Transition Systems from Global Specification

Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Visibly pushdown languages

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Weighted asynchronous cellular automata

Theoretical Computer Science
A Robust Class of Context-Sensitive Languages

LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
A theory of regular MSC languages

Information and Computation
A Kleene theorem and model checking algorithms for existentially bounded communicating automata

Information and Computation
Context-bounded analysis of concurrent queue systems

TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Unfolding synthesis of asynchronous automata

CSR'06 Proceedings of the First international computer science conference on Theory and Applications
Constructing exponential-size deterministic zielonka automata

ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Model checking multithreaded programs with asynchronous atomic methods

CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Context-Bounded model checking of concurrent software

TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Adding nesting structure to words

DLT'06 Proceedings of the 10th international conference on Developments in Language Theory

Temporal logics for concurrent recursive programs: satisfiability and model checking

MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Asynchronous games over tree architectures

ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

We define and study an automata model of concurrent recursive programs. An automaton consists of a finite number of pushdown systems running in parallel and communicating via shared actions. Actually, we combine multi-stack visibly pushdown automata and Zielonka's asynchronous automata towards a model with an undecidable emptiness problem. However, a reasonable restriction allows us to lift Zielonka's Theorem to this recursive setting and permits a logical characterization in terms of a suitable monadic second-order logic. Building on results from Mazurkiewicz trace theory and work by La Torre, Madhusudan, and Parlato, we thus develop a framework for the specification, synthesis, and verification of concurrent recursive processes.