Filters








948 Hits in 2.0 sec

The automata theory package omega [chapter]

J. Vöge, S. Ulbrand, O. Matz, N. Buhrke
1998 Lecture Notes in Computer Science  
In this paper we present omega, a package of algorithms from the theory of !-automata.  ...  -languages, conversion of acceptance conditions, Safra's determinization algorithm, construction of strategies in in nite games.  ...  In omega we implemented an algorithm of complexity O(2 n ), where n is the number of states, which is described in detail in Tho95, BLV96] . Inclusion tests for !  ... 
doi:10.1007/bfb0031395 fatcat:3h66iyh44zhqhkamzkakzk3zcq

Omega Automata and its Classes

Natasha Singh, Ajay Kumar
2018 Current Science  
In addition, this paper also summarizes the applicability of omega automata in various interdisciplinary fields.  ...  ω-automata is a variant of finite automata which accepts infinite strings.  ...  Kumar and Verma 33 determined the state complexity of non-deterministic finite automata from regular expressions.  ... 
doi:10.18520/cs/v115/i11/2042-2051 fatcat:byu5hbxpnbaclbp2rkx3qa6uhm

A comparison of Presburger engines for EFSM reachability [chapter]

Thomas R. Shiple, James H. Kukula, Rajeev K. Ranjan
1998 Lecture Notes in Computer Science  
We compare the performance of two Presburger packages, the automata-based Shasta package and the polyhedrabased Omega package.  ...  While the raw speed of each of these two packages can be superior to the other by a factor of 50 or more, we found the asymptotic performance of Shasta to be equal or superior to that of Omega for the  ...  Acknowledgments We thank Kurt Keutzer for suggesting to us the use of Presburger arithmetic for analyzing EFSMs, and Adnan Aziz for modifying VIS to support EFSMs.  ... 
doi:10.1007/bfb0028752 fatcat:tmri4cylxrbuze3q7sb6k6c36a

Wind Turbine System: An Industrial Case Study in Formal Modeling and Verification [chapter]

Jagadish Suryadevara, Gaetana Sapienza, Cristina Seceleanu, Tiberiu Seceleanu, Stein-Erik Ellevseth, Paul Pettersson
2014 Communications in Computer and Information Science  
In the development of embedded systems, the formal analysis of system artifacts, such as structural and behavioral models, helps the system engineers to understand the overall functional and timing behavior  ...  of the system.  ...  Fig. 5 . 5 Timed automata modeling: (a) RT omega = RT in (b) RT in = RT out (c) Computation RT. Fig. 6 . 6 Timed automata model for (event-triggered) ROTOR.  ... 
doi:10.1007/978-3-319-05416-2_15 fatcat:tmyqj5u77bekhbtc6o7rvecxwa

FAST Extended Release [chapter]

Sébastien Bardin, Jérôme Leroux, Gérald Point
2006 Lecture Notes in Computer Science  
We provide four implementations of the interface using Lash, Mona, Omega and a new shared automata package with computation cache.  ...  Fast is a tool designed for the analysis of counter systems, i.e. automata extended with unbounded integer variables.  ...  We are grateful to Jean-Michel Couvreur for providing us advices on the implementation of shared automata, and to Ales Smrcka for adapting Omega source code to recent compilers.  ... 
doi:10.1007/11817963_9 fatcat:mcda26tlmbclhnoetfw4xjtcwe

Preface

J. Karhumäki, E. A. Hirsch
2015 Theory of Computing Systems  
Dietzfelbinger and Rink investigate the structure of certain random bipartite graphs. They prove the existence of a sequence of probability mass functions that  ...  study the problem to determine whether a multiset of colors occurs in a connected subgraph of a vertex-colored graph.  ...  The paper Omega-rational expressions with bounded synchronization delay by Volker Diekert and Manfred Kufleitner belongs to classical automata theory.  ... 
doi:10.1007/s00224-015-9618-4 fatcat:7dzzt3mqszc77cwd4jdbjz2c64

Page 2061 of Mathematical Reviews Vol. , Issue 2003C [page]

2003 Mathematical Reviews  
The paper contains a number of results on the power of nonde- terminism in finite automata obtained by applying the concept of communication complexity.  ...  Paris 7, Paris, 1992; per bibl.] about omega powers of finitary languages.  ... 

Preface of STACS 2012 Special Issue

Christoph Dürr, Thomas Wilke
2014 Theory of Computing Systems  
The topics of the papers cover data structures, approximation algorithms, compressed data, languages and logic.  ...  These extended abstracts were among the top papers of those that were chosen for presentation at STACS 2012 in a highly competitive peer-review process (after which only 54 papers out of 274 submission  ...  In The Complexity of Compressed Membership Problems for Finite Automata, Artur Jeż proves that the compressed membership problem for nondeterministic (resp. deterministic) automata with compressed labels  ... 
doi:10.1007/s00224-013-9530-8 fatcat:735tiimi7jax7nxaupttepgxlu

Homer: A Higher-Order Observational Equivalence Model checkER [chapter]

David Hopkins, C. -H. Luke Ong
2009 Lecture Notes in Computer Science  
It works by first translating terms of the fragment into a precise representation of their game semantics as visibly pushdown automata (VPA).  ...  To the best of our knowledge, HOMER is the first implementation of a model checker of 3rd-order programs.  ...  Visibly Pushdown Automata The visibly pushdown automata (VPA) [3] are a subclass of pushdown automata in which the stack actions (push, pop or no-op) are completely determined by the input symbol.  ... 
doi:10.1007/978-3-642-02658-4_51 fatcat:ubfmoqlx6zcindvwhlm7nbkr6y

Page 6534 of Mathematical Reviews Vol. , Issue 2003i [page]

2003 Mathematical Reviews  
The author establishes a number of results that draw on methods and theorems from the structural complexity and formal language literatures.  ...  This paper explores a kind of correspondence between automata- theoretic and complexity-theoretic hierarchies. The main complex- ity hierarchy considered is the polynomial time hierarchy, PH.  ... 

GOAL for Games, Omega-Automata, and Logics [chapter]

Ming-Hsien Tsai, Yih-Kuen Tsay, Yu-Shiang Hwang
2013 Lecture Notes in Computer Science  
The new features include game solving, manipulation of two-way alternating automata, translation of ACTL formulae and ω-regular expressions, test of language star-freeness, classification of ω-regular  ...  This paper introduces the second generation of GOAL, which is a graphical interactive tool for games, ω-automata, and logics.  ...  We thank Jinn-Shu Chang and Yi-Wen Chang for helping with the implementations of some algorithms.  ... 
doi:10.1007/978-3-642-39799-8_62 fatcat:4xi3csp63fgbhn736yrrhzc3we

Page 1375 of Mathematical Reviews Vol. , Issue 98C [page]

1998 Mathematical Reviews  
A number of results are given relating logical definability on R-structures with BSS-complexity.  ...  An R-structure consists of a finite structure together with a finite set of functions from the structure into R.  ... 

Page 4259 of Mathematical Reviews Vol. , Issue 86i [page]

1986 Mathematical Reviews  
Prob- lems of the first class have a systematic structure that makes them natural candidates for this type of machine.  ...  Derrida, Stochastic models of cluster growth (pp. 147-152); Stephen Wolfram, Some recent results and questions about cellular automata (pp. 153-167). Models of complex interacting systems: H.  ... 

Integrating verifiable Assume/Guarantee contracts in UML/SysML

Iulia Dragomir, Iulian Ober, Christian Percebois
2013 ACM/IEEE International Conference on Model Driven Engineering Languages and Systems  
In previous work we have defined a formal contract-based theory for Timed Input/Output Automata with the aim of using it to express the semantics of UML/SysML models.  ...  Since the satisfaction of a requirement is subject to the composition of several components, defining abstract and partial behaviors for components with respect to the point of view of the requirement  ...  within the context of that composite structure.  ... 
dblp:conf/models/DragomirOP13 fatcat:2xzuveu4s5ghvluz3diwdas26i

Page 4867 of Mathematical Reviews Vol. , Issue 2004f [page]

2004 Mathematical Reviews  
(English summary) Descriptional complexity of automata, grammars and related structures (Vienna, 2001). J. Autom. Lang. Comb. 7 (2002), no. 4, 455-468.  ...  Summary: “We examine the state complexity of proportional re- movals such as 4(L).  ... 
« Previous Showing results 1 — 15 out of 948 results