Leafy automata for higher-order concurrency

Leafy automata for higher-order concurrency

<p>Finitary Idealized Concurrent Algol ( 𝖥𝖨𝖢𝖠 ) is a prototypical programming language combining functional, imperative, and concurrent computation. There exists a fully abstract game model of 𝖥𝖨𝖢𝖠 , which in principle can be used to prove equivalence and safety of 𝖥𝖨𝖢𝖠 programs. Unfortu...

Полное описание

Библиографические подробности
Главные авторы:	Dixon, A, Lazic, R, Murawski, AS, Walukiewicz, I
Формат:	Conference item
Язык:	English
Опубликовано:	Springer 2021

Схожие документы

Verifying higher-order concurrency with data automata
по: Dixon, A, и др.
Опубликовано: (2021)

Third-order Idealized Algol with iteration is decidable
по: Murawski, A, и др.
Опубликовано: (2008)

Saturating automata for game semantics
по: Dixon, A, и др.
Опубликовано: (2023)

Weak Alternating Timed Automata
по: Pawel Parys, и др.
Опубликовано: (2012-09-01)

Unfolding of Finite Concurrent Automata
по: Alexandre Mansard
Опубликовано: (2018-10-01)

Unboundedness and downward closures of higher-order pushdown automata
по: Hague, M, и др.
Опубликовано: (2016)

Higher-order linearisability
по: Murawski, AS, и др.
Опубликовано: (2019)

Reachability in pushdown register automata
по: Murawski, A, и др.
Опубликовано: (2017)

Concurrency theory : calculi an automata for modelling untimed and timed concurrent systems /
по: 180279 Bowman, Howard, и др.
Опубликовано: (2006)

Collapsible Pushdown Automata and Recursion Schemes
по: Murawski, C, и др.
Опубликовано: (2008)

DEQ: Equivalence checker for deterministic register automata
по: Murawski, A, и др.
Опубликовано: (2019)

Language equivalence for probabilistic automata
по: Kiefer, S, и др.
Опубликовано: (2011)

Collapsible pushdown automata and recursion schemes
по: Hague, M, и др.
Опубликовано: (2008)

Collapsible pushdown automata and recursion schemes
по: Hague, M, и др.
Опубликовано: (2017)

Linearity in higher-order recursion schemes
по: Clairambault, P, и др.
Опубликовано: (2017)

On the Complexity of the Equivalence Problem for Probabilistic Automata
по: Kiefer, S, и др.
Опубликовано: (2012)

A Fragment of ML Decidable by Visibly Pushdown Automata
по: Hopkins, D, и др.
Опубликовано: (2011)

Fast, Approximate State Estimation of Concurrent Probabilistic Hybrid Automata
по: Timmons, Eric
Опубликовано: (2018)

Fast, approximate state estimation of concurrent probabilistic hybrid automata
по: Timmons, Eric (Eric M.)
Опубликовано: (2013)

Polynomial-time equivalence testing for deterministic fresh-register automata
по: Murawski, A, и др.
Опубликовано: (2018)

ON THE COMPLEXITY OF EQUIVALENCE AND MINIMISATION FOR Q-WEIGHTED AUTOMATA
по: Kiefer, S, и др.
Опубликовано: (2013)

The Big-O problem for labelled Markov chains and weighted automata
по: Chistikov, D, и др.
Опубликовано: (2020)

Syntactic control of concurrency
по: Ghica, D, и др.
Опубликовано: (2006)

Higher-Dimensional Timed and Hybrid Automata
по: Fahrenberg, Uli
Опубликовано: (2022-12-01)

Weak equivalence of higher-dimensional automata
по: Thomas Kahl
Опубликовано: (2021-05-01)

On the Complexity of Equivalence and Minimisation for Q-weighted Automata
по: Stefan Kiefer, и др.
Опубликовано: (2013-03-01)

Angelic semantics of fine-grained concurrency
по: Ghica, D, и др.
Опубликовано: (2008)

Hector: An Equivalence Checker for a Higher−Order Fragment of ML
по: Hopkins, D, и др.
Опубликовано: (2012)

Partially Ordered Automata and Piecewise Testability
по: Tomáš Masopust, и др.
Опубликовано: (2021-05-01)

Weighted Automata and Monadic Second Order Logic
по: Nadia Labai, и др.
Опубликовано: (2013-07-01)

When is containment decidable for probabilistic automata?
по: Daviaud, L, и др.
Опубликовано: (2018)

When are emptiness and containment decidable for probabilistic automata?
по: Daviaud, L, и др.
Опубликовано: (2021)

Model-Checking of Ordered Multi-Pushdown Automata
по: Mohamed Faouzi Atig
Опубликовано: (2012-09-01)

Computing by Temporal Order: Asynchronous Cellular Automata
по: Michael Vielhaber
Опубликовано: (2012-08-01)

ML, visibly pushdown class memory automata, and extended branching vector addition systems with states
по: Cotton-Barratt, C, и др.
Опубликовано: (2019)

Higher-dimensional automata modeling shared-variable systems
по: Thomas Kahl
Опубликовано: (2019-09-01)

Design and Experiment for Flexible Clamping and Conveying Device for Green Leafy Vegetable Orderly Harvester
по: Yue Jin, и др.
Опубликовано: (2024-06-01)

Higher-Order Cellular Automata Generated Symmetry-Protected Topological Phases and Detection Through Multi Point Strange Correlators
по: Jie-Yu Zhang, и др.
Опубликовано: (2024-08-01)

LEAFY FORESTS OF BILOHRUDIVSKY FOREST
по: Shlapak V. P.
Опубликовано: (2018-06-01)

Cyberphysical System Modeled with Complex Networks and Hybrid Automata to Diagnose Multiple and Concurrent Faults in Manufacturing Systems
по: Alejandro Velazquez, и др.
Опубликовано: (2023-09-01)