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)