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

Cur síos iomlán

Sonraí bibleagrafaíochta
Príomhchruthaitheoirí:	Dixon, A, Lazic, R, Murawski, AS, Walukiewicz, I
Formáid:	Conference item
Teanga:	English
Foilsithe / Cruthaithe:	Springer 2021

Míreanna comhchosúla

Verifying higher-order concurrency with data automata
de réir: Dixon, A, et al.
Foilsithe / Cruthaithe: (2021)

Third-order Idealized Algol with iteration is decidable
de réir: Murawski, A, et al.
Foilsithe / Cruthaithe: (2008)

Saturating automata for game semantics
de réir: Dixon, A, et al.
Foilsithe / Cruthaithe: (2023)

Weak Alternating Timed Automata
de réir: Pawel Parys, et al.
Foilsithe / Cruthaithe: (2012-09-01)

Unfolding of Finite Concurrent Automata
de réir: Alexandre Mansard
Foilsithe / Cruthaithe: (2018-10-01)

Unboundedness and downward closures of higher-order pushdown automata
de réir: Hague, M, et al.
Foilsithe / Cruthaithe: (2016)

Higher-order linearisability
de réir: Murawski, AS, et al.
Foilsithe / Cruthaithe: (2019)

Reachability in pushdown register automata
de réir: Murawski, A, et al.
Foilsithe / Cruthaithe: (2017)

Concurrency theory : calculi an automata for modelling untimed and timed concurrent systems /
de réir: 180279 Bowman, Howard, et al.
Foilsithe / Cruthaithe: (2006)

Collapsible Pushdown Automata and Recursion Schemes
de réir: Murawski, C, et al.
Foilsithe / Cruthaithe: (2008)

DEQ: Equivalence checker for deterministic register automata
de réir: Murawski, A, et al.
Foilsithe / Cruthaithe: (2019)

Language equivalence for probabilistic automata
de réir: Kiefer, S, et al.
Foilsithe / Cruthaithe: (2011)

Collapsible pushdown automata and recursion schemes
de réir: Hague, M, et al.
Foilsithe / Cruthaithe: (2008)

Collapsible pushdown automata and recursion schemes
de réir: Hague, M, et al.
Foilsithe / Cruthaithe: (2017)

Linearity in higher-order recursion schemes
de réir: Clairambault, P, et al.
Foilsithe / Cruthaithe: (2017)

On the Complexity of the Equivalence Problem for Probabilistic Automata
de réir: Kiefer, S, et al.
Foilsithe / Cruthaithe: (2012)

A Fragment of ML Decidable by Visibly Pushdown Automata
de réir: Hopkins, D, et al.
Foilsithe / Cruthaithe: (2011)

Fast, Approximate State Estimation of Concurrent Probabilistic Hybrid Automata
de réir: Timmons, Eric
Foilsithe / Cruthaithe: (2018)

Fast, approximate state estimation of concurrent probabilistic hybrid automata
de réir: Timmons, Eric (Eric M.)
Foilsithe / Cruthaithe: (2013)

Polynomial-time equivalence testing for deterministic fresh-register automata
de réir: Murawski, A, et al.
Foilsithe / Cruthaithe: (2018)

ON THE COMPLEXITY OF EQUIVALENCE AND MINIMISATION FOR Q-WEIGHTED AUTOMATA
de réir: Kiefer, S, et al.
Foilsithe / Cruthaithe: (2013)

The Big-O problem for labelled Markov chains and weighted automata
de réir: Chistikov, D, et al.
Foilsithe / Cruthaithe: (2020)

Syntactic control of concurrency
de réir: Ghica, D, et al.
Foilsithe / Cruthaithe: (2006)

Higher-Dimensional Timed and Hybrid Automata
de réir: Fahrenberg, Uli
Foilsithe / Cruthaithe: (2022-12-01)

Weak equivalence of higher-dimensional automata
de réir: Thomas Kahl
Foilsithe / Cruthaithe: (2021-05-01)

On the Complexity of Equivalence and Minimisation for Q-weighted Automata
de réir: Stefan Kiefer, et al.
Foilsithe / Cruthaithe: (2013-03-01)

Angelic semantics of fine-grained concurrency
de réir: Ghica, D, et al.
Foilsithe / Cruthaithe: (2008)

Hector: An Equivalence Checker for a Higher−Order Fragment of ML
de réir: Hopkins, D, et al.
Foilsithe / Cruthaithe: (2012)

Partially Ordered Automata and Piecewise Testability
de réir: Tomáš Masopust, et al.
Foilsithe / Cruthaithe: (2021-05-01)

Weighted Automata and Monadic Second Order Logic
de réir: Nadia Labai, et al.
Foilsithe / Cruthaithe: (2013-07-01)

When is containment decidable for probabilistic automata?
de réir: Daviaud, L, et al.
Foilsithe / Cruthaithe: (2018)

When are emptiness and containment decidable for probabilistic automata?
de réir: Daviaud, L, et al.
Foilsithe / Cruthaithe: (2021)

Model-Checking of Ordered Multi-Pushdown Automata
de réir: Mohamed Faouzi Atig
Foilsithe / Cruthaithe: (2012-09-01)

Computing by Temporal Order: Asynchronous Cellular Automata
de réir: Michael Vielhaber
Foilsithe / Cruthaithe: (2012-08-01)

ML, visibly pushdown class memory automata, and extended branching vector addition systems with states
de réir: Cotton-Barratt, C, et al.
Foilsithe / Cruthaithe: (2019)

Higher-dimensional automata modeling shared-variable systems
de réir: Thomas Kahl
Foilsithe / Cruthaithe: (2019-09-01)

Design and Experiment for Flexible Clamping and Conveying Device for Green Leafy Vegetable Orderly Harvester
de réir: Yue Jin, et al.
Foilsithe / Cruthaithe: (2024-06-01)

Higher-Order Cellular Automata Generated Symmetry-Protected Topological Phases and Detection Through Multi Point Strange Correlators
de réir: Jie-Yu Zhang, et al.
Foilsithe / Cruthaithe: (2024-08-01)

LEAFY FORESTS OF BILOHRUDIVSKY FOREST
de réir: Shlapak V. P.
Foilsithe / Cruthaithe: (2018-06-01)

Cyberphysical System Modeled with Complex Networks and Hybrid Automata to Diagnose Multiple and Concurrent Faults in Manufacturing Systems
de réir: Alejandro Velazquez, et al.
Foilsithe / Cruthaithe: (2023-09-01)