5,410 Hits in 3.0 sec

Page 6285 of Mathematical Reviews Vol. , Issue 2003h [page]

2003 Mathematical Reviews  
Summary: “We investigate the model checking problems for guarded first-order and fixed point logics by reducing them to parity games.  ...  “Further, we study the structure of parity games, isolate ‘easy’ cases that admit efficient algorithmic solutions, and determine their relationship to specific fragments of guarded fixed point logics.”  ... 

Multiple counters automata, safety analysis and presburger arithmetic [chapter]

Hubert Comon, Yan Jurski
1998 Lecture Notes in Computer Science  
This result can be used for the safety analysis of multiple counters automata.  ...  A transition can be fired only if the values of the counters satisfy some guards (the guards of the transition).  ...  Fribourg for many discussions on multiple counters automata.  ... 
doi:10.1007/bfb0028751 fatcat:ifbrdpuuafbllds476xp2osnwq

Cumulative subject index volumes 64–67

1985 Information and Control  
, relative completeness, 66, 29 Lattices countable distributive, embedding in polynomial time degree intervals, 65, 63 Logic dynamic, see Dynamic logic with fixed-point or iterative-fixed-point  ...  Very-large-scale integrated circuitry layout: area-maximum edge length tradeoff, 66, 45 VLSI, see Very-large-scale integrated circuitry Zero-one law extension to logic with fixed-point or iterative-fixed-point  ... 
doi:10.1016/s0019-9958(85)80038-3 fatcat:cnfpoerj4bgahkwbjf5nrkty5e

A Step Up in Expressiveness of Decidable Fixpoint Logics

Michael Benedikt, Pierre Bourhis, Michael Vanden Boom
2016 Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science - LICS '16  
Using automata, we show that the resulting logics have a decidable satisfiability problem, and provide a fine study of the complexity of satisfiability.  ...  While guardedness has been applied fruitfully in the setting of first-order logic, the ability to add fixpoints while retaining decidability has been very limited.  ...  variables and fixed points as guards is disallowed in µGF.  ... 
doi:10.1145/2933575.2933592 dblp:conf/lics/BenediktBB16 fatcat:iofilouplngydidnz42r5dkpt4

An Event Calculus Formalization of Timed Automata

Nicola Falcionelli, Paolo Sernani, Dagmawi Neway Mekuria, Aldo Franco Dragoni
2018 International Joint Conference on Artificial Intelligence  
This work proposes a common point among these techniques, or more precisely, a methodology to translate the graph representations of (Discrete) Timed Automata into Event Calculus logic predicates.  ...  Specifically, the Event Calculus is a logic framework that allows the concept of time to explicitly appear inside formulas, while at the same time avoiding to step outside First Order Logic.  ...  Their inclusion within the TAindependent theory would be another important step towards having a complete TA representation methodology for model checking purposes.  ... 
dblp:conf/ijcai/FalcionelliSMD18 fatcat:hhhxiffxhvccdingfoyrf5hy3a

Weak Mso with the Unbounding Quantifier [article]

Mikolaj Bojanczyk
2009 arXiv   pre-print
Effective translations between the logic and automata are given.  ...  The class has two equivalent descriptions: in terms of automata (a type of deterministic counter automaton), and in terms of logic (weak monadic second-order logic with a bounding quantifier).  ...  Other notions, such as finite semigroups, or monadic-second order logic also point to the same class. For infinite words, however, there is more doubt.  ... 
arXiv:0902.1042v1 fatcat:3k6fhyqpavb33jki3rdiqv7c4q

Automata and fixed point logic: A coalgebraic perspective

Yde Venema
2006 Information and Computation  
We also introduce a language of coalgebraic fixed point logic for F-coalgebras, and we provide a game semantics for this language.  ...  We introduce various notions of F-automata, devices that operate on pointed F-coalgebras.  ...  Acknowledgments I thank Alexandru Baltag, Helle Hansen, Clemens Kupke, and the anonymous referees, for many useful comments and suggestions for improvement of the paper.  ... 
doi:10.1016/j.ic.2005.06.003 fatcat:ypih7inya5akjc4zoufysdlgxe

Automata and Fixed Point Logics for Coalgebras

Yde Venema
2004 Electronical Notes in Theoretical Computer Science  
We also introduce a language of coalgebraic fixed point logic for F-coalgebras, and we provide a game semantics for this language.  ...  It is the aim of this paper to generalize existing connections between automata and logic to a more general, coalgebraic level. Let F : Set → Set be a standard functor that preserves weak pullbacks.  ...  fixed point logics.  ... 
doi:10.1016/j.entcs.2004.02.038 fatcat:ibxnqlwtuva27ixiwky6vpbi7y

A logic-based modeling and verification of CPS

Neda Saeedloei, Gopal Gupta
2011 ACM SIGBED Review  
This logic programming realization can be used for verifying interesting properties as well as generating implementations of CPS.  ...  In this paper we report on the development of a formalism based on logic programming extended with co-induction, constraints over reals, and coroutining that allows CPS to be elegantly modeled.  ...  Co-inductive LP (Co-LP) gives an operational semantics to greatest fix point based computations.  ... 
doi:10.1145/2000367.2000374 fatcat:uwpfdczyd5eg5jkkmsad5xjmru

Biped Robot Modeling and Control Using Controlled Hybrid Automata

Ying Shang
2017 International Journal of Systems Science and Applied Mathematics  
The controlled hybrid automata model can be used for robotics system modeling and control.  ...  If the fixed point is non-empty, then there exists a measurable control under which the hybrid automaton generates a global non-terminating solution.  ...  that the fixed points have a non-empty intersection.  ... 
doi:10.11648/j.ijssam.20170204.11 fatcat:gi5wnxcfgbc5fcjsr7sipxld34

Modal Mu-Calculus [chapter]

Colin Stirling
2001 Texts in Computer Science  
Since → is often used to represent the transition relation in models (alias the accessibility relation from modal logic), we use ⇒ rather than → for boolean implication.  ...  In this section, we outline the historical context for Lµ.  ...  The syntactic formation rule for fixed points is: if φ(Y, x) is a guarded formula, Y occurs positively and not in the guards and all free variables of φ(Y, x) are contained in x then µY ( x).φ(Y, x) is  ... 
doi:10.1007/978-1-4757-3550-5_5 fatcat:mfjlygtmd5e6lbmjdhr73oaisa

Specification and Synthesis of Hybrid Automata for Physics-Based Animation [chapter]

Thomas Ellman
2004 Lecture Notes in Computer Science  
Each scheme is associated with a set of axioms in a logic of hybrid automata. The axioms serve to document the semantics of the specification scheme.  ...  This paper describes a system for specifying and automatically synthesizing physics-based animation programs based on hybrid automata.  ...  The general scheme of a program for simulation of hybrid automata is shown below.  ... 
doi:10.1007/978-3-540-25938-1_4 fatcat:fa32dbmjdnfq5o75wxnaq5iiny

Coalgebraic Expressions

Robert S. R. Myers
2009 Fixed Points in Computer Science  
These expressions include the regular expressions, the free Kleene algebra with tests and fragments of CCS and Linear Temporal Logic.  ...  There is an associated complete equational logic, analogous to Kleene algebra, which may now be seen as an equational presentation of a fragment of the coalgebraic µ-calculus.  ...  Examples include deterministic automata, deterministic automata on guarded strings, stream coalgebras and labelled transition systems.  ... 
dblp:conf/fics/Myers09 fatcat:odizieeuw5hfxnpwlrqsbkq2oq

A Dose of Timed Logic, in Guarded Measure [chapter]

Kamal Lodaya, Paritosh K. Pandya
2006 Lecture Notes in Computer Science  
Next, we introduce a guarded first-order logic with measurements MGF .  ...  As a generalisation of Kamp's theorem, we show that over arbitrary time domains, the measurement logic GIML is expressively complete for it. We also show that MGF has the 3-variable property.  ...  For concreteness, let us fix Punct(Σ) to be the countable set of comparisons m ∼ c, for all m ∈ Σ, ∼ in {<, =, >} and c in Z, the set of integers.  ... 
doi:10.1007/11867340_19 fatcat:qtvfrvokgrep7jr7duxqyonrzi

Weak MSO with the Unbounding Quantifier

Mikołaj Bojańczyk
2010 Theory of Computing Systems  
Effective translations between the logic and automata are given.  ...  The class has two equivalent descriptions: in terms of automata (a type of deterministic counter automaton), and in terms of logic (weak monadic second-order logic with a bounding quantifier).  ...  Acknowledgement I would like to thank the anonymous referees for their helpful comments.  ... 
doi:10.1007/s00224-010-9279-2 fatcat:6ipgrl2po5hqjcksn3ymzhv4ia
« Previous Showing results 1 — 15 out of 5,410 results