BibSLEIGH — Knut

Travelled to:

1 × India
1 × Italy
1 × Korea
1 × Sweden
2 × Canada
2 × USA

Collaborated with:

S.Miremadi B.Lennartson M.Fabian Z.Fei Sabino Francesco Roselli O.Ljungkrantz K.Bengtsson A.Voronov C.Yuan S.A.Reveliotis L.Ouedraogo R.Kumar R.Malik T.Alenljung M.Sköldstam A.Kobetski J.Richardsson Johan Eddeland G.Cengic P.M.Ferreira Fredrik Hagebring S.Riazi J.Li Jonatan Berglund Felix Auris Atieh Hanna Johan Vallhagen C.Thorstensson P.Falkman

Talks about:

use (7) system (6) automata (4) control (4) model (4) finit (4) industri (3) symbol (3) extend (3) logic (3)

Person: Knut Åkesson

DBLP: =Aring=kesson:Knut

Contributed to:

2015

2012

2011

2010

2009

2008

2007

2005

2017

2018

2019

Wrote 17 papers:

CASE-2015-FeiAR #bound #clustering #resource management #symbolic computation #using: Symbolic computation of boundary unsafe states in complex resource allocation systems using partitioning techniques (ZF, KÅ, SAR), pp. 799–806.
CASE-2012-FeiMAL #approach #automaton #finite #scalability: A symbolic approach to large-scale discrete event systems modeled as finite automata with variables (ZF, SM, KÅ, BL), pp. 502–507.
CASE-2011-FeiMA #automaton #finite #modelling #resource management #using: Modeling sequential resource allocation systems using Extended Finite Automata (ZF, SM, KÅ), pp. 444–449.
CASE-2011-MiremadiLA #automaton #finite: BDD-based supervisory control on extended finite automata (SM, BL, KÅ), pp. 25–31.
CASE-2010-BengtssonTLAYMF #automation #design #identification #sequence #visualisation: Relations identification and visualization for sequence planning and automation design (KB, CT, BL, KÅ, CY, SM, PF), pp. 841–848.
CASE-2010-OuedraogoKMA #approach #automaton #finite: Symbolic approach to nonblocking and safe control of Extended Finite Automata (LO, RK, RM, KÅ), pp. 471–476.
CASE-2009-VoronovA #model checking #process #using #verification: Verification of process operations using model checking (AV, KÅ), pp. 415–420.
CASE-2008-LjungkrantzAF #component #industrial #logic #programming #specification #verification: Formal specification and verification of components for industrial logic control programming (OL, KÅ, MF), pp. 935–940.
CASE-2007-AlenljungSLA #detection #fault #implementation #process: PLC-based Implementation of Process Observation and Fault Detection for Discrete Event Systems (TA, MS, BL, KÅ), pp. 207–212.
CASE-2007-KobetskiRAF #behaviour: Minimization of Expected Cycle Time in Manufacturing Cells with Uncontrollable Behavior (AK, JR, KÅ, MF), pp. 14–19.
CASE-2007-LjungkrantzA #case study #component #industrial #library #logic #programming #using: A Study of Industrial Logic Control Programming using Library Components (OL, KÅ), pp. 117–122.
CASE-2005-CengicALYF #composition #implementation #using: Implementation of full synchronous composition using IEC 61499 function blocks (GC, KÅ, BL, CY, PMF), pp. 267–272.
CASE-2017-EddelandMFA #cyber-physical #logic: Objective functions for falsification of signal temporal logic properties in cyber-physical systems (JE, SM, MF, KÅ), pp. 1326–1331.
CASE-2018-LiBAHVA #evaluation #industrial: Evaluation of Photogrammetry for Use in Industrial Production Systems (JL, JB, FA, AH, JV, KÅ), pp. 414–420.
CASE-2018-RoselliBA #comparison #evaluation #modelling #performance #problem #scheduling #smt: SMT Solvers for Job-Shop Scheduling Problems: Models Comparison and Performance Evaluation (SFR, KB, KÅ), pp. 547–552.
CASE-2019-RoselliBA #analysis #flexibility #problem #scheduling #smt: SMT Solvers for Flexible Job-Shop Scheduling Problems: A Computational Analysis (SFR, KB, KÅ), pp. 673–678.
CASE-2019-RoselliHRFA #equivalence #on the #using: On the Use of Equivalence Classes for Optimal and Sub-Optimal Bin Covering (SFR, FH, SR, MF, KÅ), pp. 1004–1009.