Zobrazeno 1 - 10
of 58
pro vyhledávání: '"Theory of computation → Concurrency"'
Publikováno v:
50th International Colloquium on Automata, Languages, and Programming
Leibniz International Proceedings in Informatics
Leibniz International Proceedings in Informatics
In the language-theoretic approach to refinement verification, we check that the language of traces of an implementation all belong to the language of a specification. We consider the refinement verification problem for asynchronous programs against
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ccad95b58bd52a96a4d3074e2706d4d7
https://hdl.handle.net/21.11116/0000-000D-6B42-121.11116/0000-000D-6B44-F
https://hdl.handle.net/21.11116/0000-000D-6B42-121.11116/0000-000D-6B44-F
Autor:
Stutz, Felix
Multiparty session types (MSTs) provide efficient means to specify and verify asynchronous message-passing systems. For a global type, which specifies all interactions between roles in a system, the implementability problem asks whether there are loc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1365b71203a0d46f629ae6f201ad055a
Multi-Version Concurrency Control (MVCC) is a common mechanism for achieving linearizable range queries in database systems and concurrent data-structures. The core idea is to keep previous versions of nodes to serve range queries, while still provid
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fe60875946bcc9503cc2192fa451fcee
Context-bounded analysis of concurrent programs is a technique to compute a sequence of under-approximations of all behaviors of the program. For a fixed bound k, a context bounded analysis considers only those runs in which a single process is inter
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::11a227c4aaad7b5b133803852e5b9819
Programming distributed systems is difficult. Multiparty session typing (MPST) is a method to automatically prove safety and liveness of protocol implementations relative to protocol specifications. In this paper, we introduce two new techniques to s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::82d378aaf6f23fef20e3bd62b2fd1ac0
Synthetic Behavioural Typing: Sound, Regular Multiparty Sessions via Implicit Local Types (Artifact)
Programming distributed systems is difficult. Multiparty session typing (MPST) is a method to automatically prove safety and liveness of protocol implementations relative to protocol specifications. In the related article ("Synthetic Behavioural Typi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c3421623a1d37793c9d44b23a6d32bea
The classical Hennessy-Milner theorem is an important tool in the analysis of concurrent processes; it guarantees that any two non-bisimilar states in finitely branching labelled transition systems can be distinguished by a modal formula. Numerous va
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::813b2843a4dadaa223358c0fa5fed915
http://hdl.handle.net/10773/37968
http://hdl.handle.net/10773/37968
This special issue contains seven papers within the broad subject of Distributed Hybrid Systems, that is, systems combining hybrid discrete-continuous state spaces with elements of concurrency and logical or spatial distribution. It follows up on sev
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c5743d8d40dc52d399347cee0ceb93c2
Autor:
Fahrenberg, Uli
We introduce a new formalism of higher-dimensional timed automata, based on Pratt and van Glabbeek’s higher-dimensional automata and Alur and Dill’s timed automata. We prove that their reachability is PSPACE-complete and can be decided using zone
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9e3d5648f76a43625ac7cfc10d29f765
Publikováno v:
33rd International Conference on Concurrency Theory, {CONCUR} 2022, LIPIcs
33rd International Conference on Concurrency Theory (CONCUR 2022)
33rd International Conference on Concurrency Theory (CONCUR 2022), Sep 2022, Warszawa, Poland. pp.28:1-28:19, ⟨10.4230/LIPIcs.CONCUR.2022.28⟩
33rd International Conference on Concurrency Theory (CONCUR 2022)
33rd International Conference on Concurrency Theory (CONCUR 2022), Sep 2022, Warszawa, Poland. pp.28:1-28:19, ⟨10.4230/LIPIcs.CONCUR.2022.28⟩
One of the main motivations for this work is to obtain a distributed Krohn-Rhodes theorem for Mazurkiewicz traces. Concretely, we focus on the recently introduced operation of local cascade product of asynchronous automata and ask if every regular tr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7298bf7fa93ddfc174dcb4cc04716a1f