Realizability of Dynamic MSC Languages

DOI10.1007/978-3-642-13182-0_5zbMATH Open1285.68080OpenAlexW2109303224MaRDI QIDQ3569730FDOQ3569730

Authors: Benedikt Bollig, Loïc Hélouët 

Publication date: 22 June 2010

Published in: Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/inria-00589714/file/dynamic.pdf

Recommendations

• Formal Techniques for Networked and Distributed Systems - FORTE 2005
• Realizability Criteria for Compositional MSC
• Realizability models for BLL-like languages
• Real-Time Definable Languages
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
• scientific article; zbMATH DE number 3999261
• A theory of regular MSC languages
• Publication:2779792

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Cited In (7)

• An automaton over data words that captures EMSO logic
• Modeling Actor Systems Using Dynamic I/O Automata
• Dynamic communicating automata and branching high-level MSCs
• Title not available (Why is that?)
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: Realizability of Dynamic MSC Languages

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