On Distributed Monitoring and Synthesis

DOI10.1007/978-3-319-20028-6_6MaRDI QIDQ3195680zbMATH OpenOpenAlexFDO

Authors Anca Muscholl

Publication date 20 October 2015

Published in Evolving Computability (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-20028-6_6

Mathematics Subject Classification ID

Distributed systems (68M14) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites work

• A Kleene theorem and model checking algorithms for existentially bounded communicating automata
• A quadratic construction for Zielonka automata with acyclic communication structure
• A theory of regular MSC languages
• Asynchronous Games over Tree Architectures
• Asynchronous mappings and asynchronous cellular automata
• Constructing Exponential-Size Deterministic Zielonka Automata
• Distributed synthesis for acyclic architectures
• Fair synthesis for asynchronous distributed systems
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
• scientific article; zbMATH DE number 6687767 (Why is no real title available?)
• scientific article; zbMATH DE number 3492660 (Why is no real title available?)
• scientific article; zbMATH DE number 3189696 (Why is no real title available?)
• Keeping track of the latest gossip in a distributed system
• Model-checking of correctness conditions for concurrent objects
• Monitoring Atomicity in Concurrent Programs
• Notes on finite asynchronous automata
• Optimal dynamic partial order reduction
• Optimal Zielonka-type construction of deterministic asynchronous automata
• Partial (set) 2-structures. II: State spaces of concurrent systems
• Realizability of Concurrent Recursive Programs
• Scope-bounded multistack pushdown systems: fixed-point, sequentialization, and tree-width
• Time, clocks, and the ordering of events in a distributed system
• Tools and Algorithms for the Construction and Analysis of Systems
• Using partial orders for the efficient verification of deadlock freedom and safety properties

Describes a project that uses

Uses Software

• Scala
• Erlang

This page was built for publication: On Distributed Monitoring and Synthesis

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