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...

Descrizione completa

Dettagli Bibliografici
Autori principali:	Dixon, A, Lazic, R, Murawski, AS, Walukiewicz, I
Natura:	Conference item
Lingua:	English
Pubblicazione:	Springer 2021

Documenti analoghi

Verifying higher-order concurrency with data automata
di: Dixon, A, et al.
Pubblicazione: (2021)

Third-order Idealized Algol with iteration is decidable
di: Murawski, A, et al.
Pubblicazione: (2008)

Saturating automata for game semantics
di: Dixon, A, et al.
Pubblicazione: (2023)

Weak Alternating Timed Automata
di: Pawel Parys, et al.
Pubblicazione: (2012-09-01)

Unfolding of Finite Concurrent Automata
di: Alexandre Mansard
Pubblicazione: (2018-10-01)

Unboundedness and downward closures of higher-order pushdown automata
di: Hague, M, et al.
Pubblicazione: (2016)

Higher-order linearisability
di: Murawski, AS, et al.
Pubblicazione: (2019)

Reachability in pushdown register automata
di: Murawski, A, et al.
Pubblicazione: (2017)

Concurrency theory : calculi an automata for modelling untimed and timed concurrent systems /
di: 180279 Bowman, Howard, et al.
Pubblicazione: (2006)

Collapsible Pushdown Automata and Recursion Schemes
di: Murawski, C, et al.
Pubblicazione: (2008)

DEQ: Equivalence checker for deterministic register automata
di: Murawski, A, et al.
Pubblicazione: (2019)

Language equivalence for probabilistic automata
di: Kiefer, S, et al.
Pubblicazione: (2011)

Collapsible pushdown automata and recursion schemes
di: Hague, M, et al.
Pubblicazione: (2008)

Collapsible pushdown automata and recursion schemes
di: Hague, M, et al.
Pubblicazione: (2017)

Linearity in higher-order recursion schemes
di: Clairambault, P, et al.
Pubblicazione: (2017)

On the Complexity of the Equivalence Problem for Probabilistic Automata
di: Kiefer, S, et al.
Pubblicazione: (2012)

A Fragment of ML Decidable by Visibly Pushdown Automata
di: Hopkins, D, et al.
Pubblicazione: (2011)

Fast, Approximate State Estimation of Concurrent Probabilistic Hybrid Automata
di: Timmons, Eric
Pubblicazione: (2018)

Fast, approximate state estimation of concurrent probabilistic hybrid automata
di: Timmons, Eric (Eric M.)
Pubblicazione: (2013)

Polynomial-time equivalence testing for deterministic fresh-register automata
di: Murawski, A, et al.
Pubblicazione: (2018)

ON THE COMPLEXITY OF EQUIVALENCE AND MINIMISATION FOR Q-WEIGHTED AUTOMATA
di: Kiefer, S, et al.
Pubblicazione: (2013)

The Big-O problem for labelled Markov chains and weighted automata
di: Chistikov, D, et al.
Pubblicazione: (2020)

Syntactic control of concurrency
di: Ghica, D, et al.
Pubblicazione: (2006)

Higher-Dimensional Timed and Hybrid Automata
di: Fahrenberg, Uli
Pubblicazione: (2022-12-01)

Weak equivalence of higher-dimensional automata
di: Thomas Kahl
Pubblicazione: (2021-05-01)

On the Complexity of Equivalence and Minimisation for Q-weighted Automata
di: Stefan Kiefer, et al.
Pubblicazione: (2013-03-01)

Angelic semantics of fine-grained concurrency
di: Ghica, D, et al.
Pubblicazione: (2008)

Hector: An Equivalence Checker for a Higher−Order Fragment of ML
di: Hopkins, D, et al.
Pubblicazione: (2012)

Partially Ordered Automata and Piecewise Testability
di: Tomáš Masopust, et al.
Pubblicazione: (2021-05-01)

Weighted Automata and Monadic Second Order Logic
di: Nadia Labai, et al.
Pubblicazione: (2013-07-01)

When is containment decidable for probabilistic automata?
di: Daviaud, L, et al.
Pubblicazione: (2018)

When are emptiness and containment decidable for probabilistic automata?
di: Daviaud, L, et al.
Pubblicazione: (2021)

Model-Checking of Ordered Multi-Pushdown Automata
di: Mohamed Faouzi Atig
Pubblicazione: (2012-09-01)

Computing by Temporal Order: Asynchronous Cellular Automata
di: Michael Vielhaber
Pubblicazione: (2012-08-01)

ML, visibly pushdown class memory automata, and extended branching vector addition systems with states
di: Cotton-Barratt, C, et al.
Pubblicazione: (2019)

Higher-dimensional automata modeling shared-variable systems
di: Thomas Kahl
Pubblicazione: (2019-09-01)

Design and Experiment for Flexible Clamping and Conveying Device for Green Leafy Vegetable Orderly Harvester
di: Yue Jin, et al.
Pubblicazione: (2024-06-01)

Higher-Order Cellular Automata Generated Symmetry-Protected Topological Phases and Detection Through Multi Point Strange Correlators
di: Jie-Yu Zhang, et al.
Pubblicazione: (2024-08-01)

LEAFY FORESTS OF BILOHRUDIVSKY FOREST
di: Shlapak V. P.
Pubblicazione: (2018-06-01)

Cyberphysical System Modeled with Complex Networks and Hybrid Automata to Diagnose Multiple and Concurrent Faults in Manufacturing Systems
di: Alejandro Velazquez, et al.
Pubblicazione: (2023-09-01)