Model-based generation of manufacturing process plans through incremental topology formation

Autor: Adalat, Omar, Talal, Muhammad, Ali Cherif, Mohammed A., Scrimieri, Daniele

Yes
In advanced manufacturing systems, the production of complex and highly customisable products requires the preparation of many different product specifications and associated manufacturing process plans. The creation of these plans involves

Externí odkaz: http://hdl.handle.net/10454/19136

Lowerbounds for Bisimulation by Partition Refinement

Autor: Groote, Jan Friso, Martens, Jan, de Vink, Erik. P.

Publikováno v: Logical Methods in Computer Science, 19(2). Technischen Universitat Braunschweig

We provide time lower bounds for sequential and parallel algorithms deciding bisimulation on labeled transition systems that use partition refinement. For sequential algorithms this is $\Omega((m \mkern1mu {+} \mkern1mu n ) \mkern-1mu \log \mkern-1mu

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::64cf4d329be6824eabdcffacff8d6e16
https://research.tue.nl/nl/publications/9e8a167c-961b-4e8c-8036-1d3511a61b5d

An Axiomatic Approach to Reversible Computation

Autor: Ivan Lanese, Irek Ulidowski, Iain Phillips

Publikováno v: FoSSaCS 2020-23rd International Conference on Foundations of Software Science and Computation Structures
FoSSaCS 2020-23rd International Conference on Foundations of Software Science and Computation Structures, Apr 2020, Dublin, Ireland. pp.442-461, ⟨10.1007/978-3-030-45231-5_23⟩
Foundations of Software Science and Computation Structures
Lecture Notes in Computer Science ISBN: 9783030452308
FoSSaCS
23rd International Conference on Foundations of Software Science and Computation Structures (FoSSaCS 2020)

Conference postponed to 2021 due to covid-19; International audience; Undoing computations of a concurrent system is beneficial in many situations, e.g., in reversible debugging of multi-threaded programs and in recovery from errors due to optimistic

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7de709447b842f6f89e9a398aeaceb85
https://hal.inria.fr/hal-03004421

Efficient Synthesis of Weighted Marked Graphs with Circular Reachability Graph, and Beyond

Autor: Devillers, Raymond, Erofeev, Evgeny, Hujsa, Thomas

Publikováno v: Lecture notes in computer science, 12530 LNCS
LNCS Transactions on Petri Nets and Other Models of Concurrency
LNCS Transactions on Petri Nets and Other Models of Concurrency, 2021, Lecture Notes in Computer Science, 12530, pp.75-100. ⟨10.1007/978-3-662-63079-2_4⟩
LNCS Transactions on Petri Nets and Other Models of Concurrency, Springer, 2021, Lecture Notes in Computer Science, 12530, pp.75-100. ⟨10.1007/978-3-662-63079-2_4⟩

In previous studies, several methods have been developed to synthesise Petri nets from labelled transition systems (LTS), often with structural constraints on the net and on the LTS. In this paper, we focus on Weighted Marked Graphs (WMGs) and Choice

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e7c41b3f9fe3c369232ce7a638cd7b90
http://arxiv.org/abs/1910.14387

Compositional Verification of Concurrent Systems by Combining Bisimulations

Autor: Franco Mazzanti, Frédéric Lang, Radu Mateescu

Publikováno v: FM 2019-23rd International Conference on Formal Methods
FM 2019-23rd International Conference on Formal Methods, Oct 2019, Porto, Portugal. pp.196-213, ⟨10.1007/978-3-030-30942-8_13⟩
Formal Methods in System Design
Formal Methods in System Design, 2021, ⟨10.1007/s10703-021-00360-w⟩
Formal methods in system design (Dordr., Online) (2021). doi:10.1007/s10703-021-00360-w
info:cnr-pdr/source/autori:Frédéric Lang F., Mateescu R.; Mazzanti F./titolo:Compositional Verification of Concurrent Systems by Combining Bisimulations/doi:10.1007%2Fs10703-021-00360-w/rivista:Formal methods in system design (Dordr., Online)/anno:2021/pagina_da:/pagina_a:/intervallo_pagine:/volume
Formal Methods in System Design, Springer Verlag, 2021
Formal Methods in System Design, Springer Verlag, 2021, ⟨10.1007/s10703-021-00360-w⟩
FM 2019-International Symposium on Formal Methods. Third World Congress, pp. 196–213, Porto, Portugal, 7-11 October 2019
info:cnr-pdr/source/autori:Lang F.; Mateescu R.; Mazzanti F./congresso_nome:FM 2019-International Symposium on Formal Methods. Third World Congress/congresso_luogo:Porto, Portugal/congresso_data:7-11 October 2019/anno:2019/pagina_da:196/pagina_a:213/intervallo_pagine:196–213
Lecture Notes in Computer Science ISBN: 9783030309411
FM

International audience; One approach to verify a property expressed as a modal μ-calculus formula on a system with several concurrent processes is to build the underlying state space compositionally (i.e., by minimizing and recomposing the state spa

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::264f876d70ea19bbd4f08434642b9003
https://hal.inria.fr/hal-02295459/document