Cargando…
Leafy automata for higher-order concurrency
Finitary Idealized Concurrent Algol ([Formula: see text] ) is a prototypical programming language combining functional, imperative, and concurrent computation. There exists a fully abstract game model of [Formula: see text] , which in principle can be used to prove equivalence and safety of [Formula...
Autores principales: | Dixon, Alex, Lazić, Ranko, Murawski, Andrzej S., Walukiewicz, Igor |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
2021
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7984116/ http://dx.doi.org/10.1007/978-3-030-71995-1_10 |
Ejemplares similares
-
KReach: A Tool for Reachability in Petri Nets
por: Dixon, Alex, et al.
Publicado: (2020) -
Pebble-Intervals Automata and FO[Formula: see text] with Two Orders
por: Labai, Nadia, et al.
Publicado: (2020) -
Automata theory: an engineering approach
por: Aleksander, Igor
Publicado: (1976) -
Automata
por: Hopkin, David, et al.
Publicado: (1976) -
Choreography Automata
por: Barbanera, Franco, et al.
Publicado: (2020)