Results 31 to 40 of about 831,238 (272)
Petri Net Reachability Graphs: Decidability Status of First Order Properties [PDF]
Logical Methods in Computer Science, 2012 We investigate the decidability and complexity status of model-checking problems on unlabelled reachability graphs of Petri nets by considering first-order and modal languages without labels on transitions or atomic propositions on markings.
Philippe Darondeau +3 more
doaj +1 more source
Dense-Timed Petri Nets: Checking Zenoness, Token liveness and Boundedness [PDF]
Logical Methods in Computer Science, 2007 We consider Dense-Timed Petri Nets (TPN), an extension of Petri nets in which each token is equipped with a real-valued clock and where the semantics is lazy (i.e., enabled transitions need not fire; time can pass and disable transitions).
Parosh Abdulla +2 more
doaj +1 more source
Well Behaved Transition Systems [PDF]
Logical Methods in Computer Science, 2017 The well-quasi-ordering (i.e., a well-founded quasi-ordering such that all antichains are finite) that defines well-structured transition systems (WSTS) is shown not to be the weakest hypothesis that implies decidability of the coverability problem.
Michael Blondin +2 more
doaj +1 more source
Domain Representable Spaces Defined by Strictly Positive Induction [PDF]
Logical Methods in Computer Science, 2010 Recursive domain equations have natural solutions. In particular there are domains defined by strictly positive induction. The class of countably based domains gives a computability theory for possibly non-countably based topological spaces. A $ qcb_{0} $
Petter Kristian Køber
doaj +1 more source
The Wadge Hierarchy of Deterministic Tree Languages [PDF]
Logical Methods in Computer Science, 2008 We provide a complete description of the Wadge hierarchy for deterministically recognisable sets of infinite trees. In particular we give an elementary procedure to decide if one deterministic tree language is continuously reducible to another.
Filip Murlak
doaj +1 more source
Weighted Regular Tree Grammars with Storage [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 We introduce weighted regular tree grammars with storage as combination of (a) regular tree grammars with storage and (b) weighted tree automata over multioperator monoids.
Zoltán Fülöp +2 more
doaj +1 more source
Sampled Semantics of Timed Automata [PDF]
Logical Methods in Computer Science, 2010 Sampled semantics of timed automata is a finite approximation of their dense time behavior. While the former is closer to the actual software or hardware systems with a fixed granularity of time, the abstract character of the latter makes it appealing ...
Pavel Krcal +2 more
doaj +1 more source
Well‐being on supportive techniques in amyotrophic lateral sclerosis: from neurologists' perspective
Annals of Clinical and Translational Neurology, Volume 9, Issue 12, Page 1874-1883, December 2022., 2022 Abstract Objective To investigate intercultural neurologists' perception of well‐being in patients with amyotrophic lateral sclerosis (ALS) using gastrostomy (PEG), non‐invasive, and/or invasive ventilation (NIV/IV) and to analyse the determinants and impact on the management of the above medical interventions (MIs).
Krzysztof Barć +7 more
wiley +1 more source
Transforming Outermost into Context-Sensitive Rewriting [PDF]
Logical Methods in Computer Science, 2010 We define two transformations from term rewriting systems (TRSs) to context-sensitive TRSs in such a way that termination of the target system implies outermost termination of the original system.
Joerg Endrullis, Dimitri Hendriks
doaj +1 more source
Annals of Clinical and Translational Neurology, Volume 9, Issue 12, Page 1962-1973, December 2022., 2022 Abstract Objectives Early‐ and late‐onset Alzheimer's disease (EOAD and LOAD) share the same neuropathological traits but show distinct cognitive features. We aimed to explore baseline and longitudinal outcomes of global and domain‐specific cognitive function in a well characterized cohort of patients with a biomarker‐based diagnosis.
Adrià Tort‐Merino +16 more
wiley +1 more source