| 1. |
|
|
| 2. |
- Aceto, Luca, et al.
(författare)
-
Lifting non-finite axiomatizability results to extensions of process algebras
- 2008
-
Ingår i: Fifth Ifip International Conference On Theoretical Computer Science – Tcs 2008. - New York : Springer-Verlag New York. - 9780387096797 - 9780387096803 ; , s. 301-316
-
Konferensbidrag (refereegranskat)abstract
- This paper presents a general technique for obtaining new results pertaining to the non-finite axiomatizability of behavioral semantics over process algebras from old ones. The proposed technique is based on a variation on the classic idea of reduction mappings. In this setting, such reductions are translations between languages that preserve sound (in)equations and (in)equational proofs over the source language, and reflect families of (in)equations responsible for the non-finite axiomatizability of the target language. The proposed technique is applied to obtain a number of new non-finite axiomatizability theorems in process algebra via reduction to Moller’s celebrated non-finite axiomatizability result for CCS. The limitations of the reduction technique are also studied.
|
|
| 3. |
- Arts, Thomas, 1969, et al.
(författare)
-
Selected papers from FMICS workshop
- 2003
-
Ingår i: Electronic Notes Theoretical Computer Science. ; 80
-
Tidskriftsartikel (refereegranskat)
|
|
| 4. |
- Goorden, Martijn, et al.
(författare)
-
Compositional coordinator synthesis of extended finite automata
- 2021
-
Ingår i: Discrete Event Dynamic Systems: Theory and Applications. - : Springer Science and Business Media LLC. - 0924-6703 .- 1573-7594. ; 31:3, s. 317-348
-
Tidskriftsartikel (refereegranskat)abstract
- To avoid the state-space explosion problem, a set of supervisors may be synthesized using divide and conquer strategies, like modular or multilevel synthesis. Unfortunately, these supervisors may be conflicting, meaning that even though they are individually non-blocking, they are together blocking. Abstraction-based compositional nonblocking verification of extended finite automata provides means to verify whether a set of models is nonblocking. In case of a blocking system, a coordinator can be synthesized to resolve the blocking. This paper presents a framework for compositional coordinator synthesis for discrete-event systems modeled as extended finite automata. The framework allows for synthesis of a coordinator on the abstracted system in case compositional verification identifies the system to be blocking. As the abstracted system may use notions not present in the original model, like renamed events, the synthesized coordinator is refined such that it will be nonblocking, controllable, and maximally permissive for the original system. For each abstraction, it is shown how this refinement can be performed. It turns out that for the presented set of abstractions the coordinator refinement is straightforward.
|
|
| 5. |
- Goorden, Martijn, et al.
(författare)
-
Model properties for efficient synthesis of nonblocking modular supervisors
- 2021
-
Ingår i: Control Engineering Practice. - : Elsevier BV. - 0967-0661. ; 112
-
Tidskriftsartikel (refereegranskat)abstract
- Supervisory control theory provides means to synthesize supervisors for systems with discrete-event behavior from models of the uncontrolled plant and of the control requirements. The applicability of supervisory control theory often fails due to a lack of scalability of the algorithms. This paper proposes a format for the requirements and a method to ensure that the crucial properties of controllability and nonblockingness directly hold, thus avoiding the most computationally expensive parts of synthesis. The method consists of creating a control problem dependency graph and verifying whether it is acyclic. Vertices of the graph are modular plant components, and edges are derived from the requirements. In case of a cyclic graph, potential blocking issues can be localized, so that the original control problem can be reduced to only synthesizing supervisors for smaller partial control problems. The strength of the method is illustrated on two case studies: a production line and a roadway tunnel.
|
|
