Bounded determinization of timed automata with silent transitions
Sign Up to like & getrecommendations! Published in 2017 at "Real-Time Systems"
DOI: 10.1007/s11241-017-9271-x
Abstract: Deterministic timed automata are strictly less expressive than their non-deterministic counterparts, which are again less expressive than those with silent transitions. As a consequence, timed automata are in general non-determinizable. This is unfortunate since deterministic… read more here.
Keywords: timed automata; determinization timed; automata silent; bounded determinization ... See more keywords
Identifying Petri Nets with Silent Transitions by Event Traces Classification
Sign Up to like & getrecommendations! Published in 2020 at "IFAC-PapersOnLine"
DOI: 10.1016/j.ifacol.2021.04.052
Abstract: Abstract A method for discovering workflow nets (WFN) with silent transitions from a log of event traces λ is presented. It operates in two stages; in the first one, λ is partitioned into three classes… read more here.
Keywords: abnormal traces; petri nets; event traces; silent transitions ... See more keywords