2,136 Hits in 4.7 sec

An Automata-Theoretic Approach to Constraint LTL [chapter]

Stéphane Demri, Deepak D'souza
2002 Lecture Notes in Computer Science  
doi:10.1007/3-540-36206-1_12 fatcat:6apdadwdczcjhhnjia24nie62q

An automata-theoretic approach to constraint LTL

Stéphane Demri, Deepak D'Souza
2007 Information and Computation  
We use a new automata-theoretic technique to show pspace decidability of the logic for the constraint systems (Z, <, =) and (N, <, =).  ...  Along the way, we give an automata-theoretic proof of a result of Balbiani and Condotta when the constraint system satisfies the completion property.  ...  The automata-theoretic approach also leads to transparent generalizations of the techniques for some extensions of the logic.  ... 
doi:10.1016/j.ic.2006.09.006 fatcat:f7djw6ovcfaflpfloy4ac4322i

Automata Techniques for Temporal Answer Set Programming

Susana Hahn
2021 Electronic Proceedings in Theoretical Computer Science  
In my Ph.D. research, I intend to exploit the relationship between automata theory and dynamic logic to add automata-based techniques to the ASP solver CLINGO helping us to deal with theses type of problems  ...  Temporal and dynamic extensions of Answer Set Programming (ASP) have played an important role in addressing dynamic problems, as they allow the use of temporal operators to reason with dynamic scenarios  ...  A common strategy for addressing well-known problems within these temporal formalisms is an automata-theoretic approach with the underlining idea of constructing an automaton that accepts exactly the models  ... 
doi:10.4204/eptcs.345.42 fatcat:3f37xiiesbda7hhrs74amnebla

Enacting Declarative Languages Using LTL: Avoiding Errors and Improving Performance [chapter]

Maja Pešić, Dragan Bošnački, Wil M. P. van der Aalst
2010 Lecture Notes in Computer Science  
A finite representation of all possible executions is retrieved as an automaton generated from LTL-based constraints.  ...  Standard algorithms for creating Büchi automata from LTL formulas cause errors when be applied to DecSerFlow due to important semantical differences.  ...  However, this approach uses the Büchi automata following the standard automata-theoretic approach to verification and focuses on solving issues related to hierarchical systems using the Compositional Reachability  ... 
doi:10.1007/978-3-642-16164-3_11 fatcat:qy7wjow4xzb77oycxbdxniujna

Rabinizer: Small Deterministic Automata for LTL(F,G) [chapter]

Andreas Gaiser, Jan Křetínský, Javier Esparza
2012 Lecture Notes in Computer Science  
We describe a number of optimizations of the basic procedure, crucial for the good performance of Rabinizer, and present an experimental comparison.  ...  We present Rabinizer, a tool for translating formulae of the fragment of linear temporal logic with the operators F (eventually) and G (globally) into deterministic Rabin automata.  ...  Introduction The automata-theoretic approach to model checking is one of the most important successes of theoretical computer science in the last decades.  ... 
doi:10.1007/978-3-642-33386-6_7 fatcat:fhtikflujjexxctz7etaye3xiq

Semantical Vacuity Detection in Declarative Process Mining [chapter]

Fabrizio Maria Maggi, Marco Montali, Claudio Di Ciccio, Jan Mendling
2016 Lecture Notes in Computer Science  
We then extend the standard automata-based approach so as to incorporate relevance-related information.  ...  We finally report on an implementation and experimentation of the approach that confirms the advantages and feasibility of our solution.  ...  As pointed out in [7] , the most widely adopted approach to reason about and execute declarative process models is to leverage the automata-theoretic approach for temporal logics, exploiting the well-known  ... 
doi:10.1007/978-3-319-45348-4_10 fatcat:xq3cz2ck5bgsjbzsttugoscbai

Bounded Model Checking with SNF, Alternating Automata, and Büchi Automata

Daniel Sheridan
2005 Electronical Notes in Theoretical Computer Science  
We also explore the differences in the way SNF, alternating, and Büchi automata are used from both a theoretical and an experimental perspective.  ...  automata as an intermediate representation.  ...  Bounded model checking (BMC) has traditionally taken a different approach: the original paper [1] gives an encoding from LTL directly to propositional logic.  ... 
doi:10.1016/j.entcs.2004.12.024 fatcat:5y4fyu5xardezpvu4h2fitvs7q

Separating Functional and Dependability Requirements of Embedded Systems

Zhe Chen, Gilles Motet
2010 2010 10th IEEE International Conference on Computer and Information Technology  
The paper illustrates the methodology with examples and comparison with the model checking approach, to show better support of the evolution throughout the life-cycle at a lower cost.  ...  This paper proposes a complementary methodology, namely the model monitoring approach, to fill in the gap between the evolution of dependability requirements and traditional development process.  ...  The automata-theoretic approach translates the formula φ into an automaton for checking. The SPIN [10] is a typical implementation.  ... 
doi:10.1109/cit.2010.408 dblp:conf/IEEEcit/ChenM10a fatcat:gjgrgl2r5zeofffzwpqqabdwia

Synthesis from Satisficing and Temporal Goals [article]

Suguman Bansal, Lydia Kavraki, Moshe Y. Vardi, Andrew Wells
2022 arXiv   pre-print
An existing approach combines techniques from LTL synthesis with optimization for the DS rewards but has failed to yield a sound algorithm.  ...  An alternative approach combining LTL synthesis with satisficing DS rewards (rewards that achieve a threshold) is sound and complete for integer discount factors, but, in practice, a fractional discount  ...  This work is supported in part by NSF grant 2030859 to the CRA for the CIFellows Project, NSF grants IIS-1527668, CCF-1704883, IIS-1830549, CNS-2016656, DoD MURI grant N00014-20-1-2787, and an award from  ... 
arXiv:2205.10464v1 fatcat:xw5aq7cg75gndh37oxe2ylvl6m

LTLf and LDLf Monitoring: A Technical Report [article]

Giuseppe De Giacomo and Riccardo De Masellis and Marco Grasso and Fabrizio Maggi and Marco Montali
2014 arXiv   pre-print
We show that LDLf is able to capture, in the logic itself, not only the constraints to be monitored, but also the de-facto standard RV-LTL monitors.  ...  In addition, we devise a direct translation of LDLf formulas into nondeterministic automata, avoiding to detour to Buechi automata or alternating automata, and we use it to implement a monitoring plug-in  ...  This research has been partially supported by the EU IP project Optique: Scalable End-user Access to Big Data, grant agreement n.  ... 
arXiv:1405.0054v1 fatcat:zzqgglg23vawtkurcw6xwtdnr4

Better Algorithms for Analyzing and Enacting Declarative Workflow Languages Using LTL [chapter]

Michael Westergaard
2011 Lecture Notes in Computer Science  
One approach is to translate the declarative language to linear temporal logic (LTL), which can be translated to finite automata.  ...  While computers are very good at handling finite automata, the translation itself is often a road block as it may take time exponential in the size of the input.  ...  The classical approach to translating LTL to automata [6] results in a Büchiautomaton accepting all infinite execution traces satisfying the formula.  ... 
doi:10.1007/978-3-642-23059-2_10 fatcat:ypcnukfjpvdwxjq2m2bjuzi6tu

Monitoring Constraints and Metaconstraints with Temporal Logics on Finite Traces [article]

Giuseppe De Giacomo, Riccardo De Masellis, Fabrizio Maria Maggi, Marco Montali
2020 arXiv   pre-print
We show that LDLf is able to declaratively express, in the logic itself, not only the constraints to be monitored, but also the de-facto standard RV-LTL monitors.  ...  In particular, it helps process executors to check on-the-fly whether a running process instance satisfies business constraints of interest, providing an immediate feedback when deviations occur.  ...  Like in the case of ltl f , also ldl f comes with an automata-theoretic characterization that employs standard finite-state automata.  ... 
arXiv:2004.01859v2 fatcat:ueqkigqvevcrfbsxthplmt5dyu

Automata with Generalized Rabin Pairs for Probabilistic Model Checking and LTL Synthesis [article]

Krishnendu Chatterjee and Andreas Gaiser and Jan Křetínský
2013 arXiv   pre-print
Our recent Safraless translation for the LTL(F,G) fragment produces smaller automata as compared to the traditional approach.  ...  The Safraless translation of LTL(F,G) formulas to DGRW results in smaller automata as compared to DRW.  ...  An LTL game is a game together with an LTL formula with vertices as atomic propositions.  ... 
arXiv:1304.5281v1 fatcat:cjsj6thfmzdfvmwsjvv7hlhjwu

Automata with Generalized Rabin Pairs for Probabilistic Model Checking and LTL Synthesis [chapter]

Krishnendu Chatterjee, Andreas Gaiser, Jan Křetínský
2013 Lecture Notes in Computer Science  
Our recent Safraless translation [KE12, GKE12] for the LTL(F,G) fragment produces smaller automata as compared to the traditional approach.  ...  The standard approach is to translate LTL to NBW [VW86], and then convert the NBW to a deterministic automata with Rabin acceptance condition (DRW) using Safra's determinization procedure [Saf88] (or using  ...  An LTL game is a game together with an LTL formula with vertices as atomic propositions.  ... 
doi:10.1007/978-3-642-39799-8_37 fatcat:hl4nmjasujgqtdgmpart3cub2y

A Multi-encoding Approach for LTL Symbolic Satisfiability Checking [chapter]

Kristin Y. Rozier, Moshe Y. Vardi
2011 Lecture Notes in Computer Science  
We describe and extensively test a new multi-encoding approach utilizing these novel encoding techniques to create 30 encoding variations.  ...  To prevent introducing design or verification errors, it is crucial to test specifications for satisfiability. Our focus here is on specifications expressed in linear temporal logic (LTL).  ...  Several papers on the automata-theoretic approach to LTL describe approaches that could be turned into alternative encodings of symbolic automata, cf. [4, 18, 20, 37] .  ... 
doi:10.1007/978-3-642-21437-0_31 fatcat:43leuwof2vbjnnqs3xjaqtkpxi
« Previous Showing results 1 — 15 out of 2,136 results