1,466 Hits in 3.3 sec

Attributive description formalisms ... and the rest of the world [chapter]

Bernhard Nebel, Gert Smolka
1991 Lecture Notes in Computer Science  
Recently, a number of formal results in the area of attributive description formalisms have been obtained by exploiting other research fields, such as formal language theory, automata theory, and modal  ...  Although the intended applications for terminological logics and feature logics are not identical, and the computational services of systems based on the respective formalisms are quite different for this  ...  Attributive Description Formalisms . . . and the Rest of the World  ... 
doi:10.1007/3-540-54594-8_74 fatcat:btaxsc3ftva5bbkah4ip34ba2i

Page 3889 of Mathematical Reviews Vol. , Issue 98F [page]

1998 Mathematical Reviews  
{For the entire collection see MR 97m:68006. } 98f:68253 68T30 Baader, Franz (D-AACH-TI; Aachen) Using automata theory for characterizing the semantics of terminological cycles.  ...  One reason is that it is not clear what kind of semantics to use for such cy- cles. In addition, the inference algorithms used in such systems may go astray in the presence of terminological cycles.  ... 

Use of Büchi automata and randomness for the description of biological processes

Konstantinos Giannakis, Theodore Andronikos
2015 International Journal of Scientific World  
Abstract The main topic of this study is the modelling and verification of biological systems using ω-automata.  ...  Overall, this work contributes by combining for the very first time PBAs with real biological mechanisms, with indicative examples, both with PBAs and NBAs (non-deterministic Büchi automata).  ...  Nevertheless, for an overview in automata theory and theory of computation we refer the reader to [1, 2, 3] .  ... 
doi:10.14419/ijsw.v3i1.4356 fatcat:vhqsjbvl5jawlogy42oky7cxlu

A hybrid systems framework for cellular processes

Kwang-Hyun Cho, Karl Henrik Johansson, Olaf Wolkenhauer
2005 Biosystems (Amsterdam. Print)  
While the semantics can be quite different, biologists and systems scientists use in many cases a similar language (notion of feedback, regulation, etc.).  ...  With the availability of technologies that allow us to obtain stimulus-response time series data for modeling and system identification, there is going to be an increasing need for conceptual frameworks  ...  Acknowledgments The preparation and revision of the xanthophyll cycle reaction system example benefited from discussion with Prof.  ... 
doi:10.1016/j.biosystems.2004.12.002 pmid:15888342 fatcat:vojq6i3dhff3jl5gb6uurpeod4

Using Logic Coverage to Improve Testing Function Block Diagrams [chapter]

Eduard Paul Enoiu, Daniel Sundmark, Paul Pettersson
2013 Lecture Notes in Computer Science  
Based on our experiments, this approach, supported by a tool chain, is an applicable and useful way of generating test cases for covering Function Block Diagrams.  ...  We show how logic coverage criteria can be formalized and used by a model-checker to provide test cases for ensuring coverage on safety-critical software described in the Function Block Diagram programming  ...  This research was supported by VIN-NOVA, the Swedish Governmental Agency for Innovation Systems within the ATAC project.  ... 
doi:10.1007/978-3-642-41707-8_1 fatcat:2h2muckhz5gs5fukc7jwsahqxy

A compositional trace-based semantics for probabilistic automata [chapter]

Roberto Segala
1995 Lecture Notes in Computer Science  
We extend the trace semantics for labeled transition systems to a randomized model of concurrent computation. The main objective is to obtain a compositional semantics.  ...  Finally, we introduce a notion of a probabilistic forward simulation and we prove that it is sound for the trace distribution precongruence.  ...  I would like to thank Nancy Lynch for useful discussion that lead to the de nition of probabilistic forward simulations.  ... 
doi:10.1007/3-540-60218-6_17 fatcat:spyoqwxg2nejhpot62gm6an2dm

Modular semantics for a UML statechart diagrams kernel and its extension to multicharts and branching time model-checking

Stefania Gnesi, Diego Latella, Mieke Massink
2002 The Journal of Logic and Algebraic Programming  
The reference verification environment used for this model-checking approach is JACK, where automata are represented in a standard format which facilitates the use of a collection of tools for automatic  ...  In this paper, we present a formal operational semantics for a behavioural subset of UML statechart diagrams (UMLSDs) including a formal proof of their correctness with respect to major UML semantics requirements  ...  The authors thank Istvan Majzik for the fruitful discussions on the UML and its semantics.  ... 
doi:10.1016/s1567-8326(01)00012-1 fatcat:jhrw7ln5gfhqhderzlwwplxi6q

Subject index volumes 1–200

1999 Theoretical Computer Science  
, 1840 usable data content of terms, 1221 use of memory in Valiant's equivalence decision procedure, 151 applicability of -, 151 Valiant's lemma, 2709 Valiant's protocol for learning, 1618 testing the  ...  characterization of -., 2150 stable axiomatic characterization of -semantics, 2058 configurations, 32 core, 798 domains, 2150,2151,3132 domain theory, 3435 event structures, 3061 dcpo, category  ... 
doi:10.1016/s0304-3975(98)00319-3 fatcat:s22ud3iiqjht7lfbtc3zctk7zm

A Calculus for Team Automata

Maurice H. ter Beek, Fabio Gadducci, Dirk Janssens
2008 Electronical Notes in Theoretical Computer Science  
Moreover, besides providing a language for expressing team automata, we widen the family of coordination patterns for which an equational characterization of the language associated to a composite automaton  ...  Team automata are a formalism for the component-based specification of reactive, distributed systems.  ...  Acknowledgement We are grateful to Jetty Kleijn and to the anonymous referees for their useful comments on a preliminary version of this paper.  ... 
doi:10.1016/j.entcs.2007.08.022 fatcat:nmcx473gmzhlpnpt6kzlew5uyi

The behavior of shared objects: concepts, pitfalls, and a new model

Jørgen Staunstrup, Jurg Nievergelt
1989 Information Processing Letters  
Acknowledgement We thank Mark Greenstreet for many educating discussions on concurrency. The first author was supported in part by the National Science Foundation under Grant No.  ...  CCR-8619663 while visiting the Department of Computer Science, University of Washington, Seattle. This work was also supported by ONR under contract N00014-86-K-0680.  ...  In the next few sections we use terminology aimed at this low level of hardware.  ... 
doi:10.1016/0020-0190(89)90133-6 fatcat:rfzyvka3xjakja2fddwfxoyaoq

Fairness and regularity for SCCS processes

Irène Guessarian, Wafâa Niar-Dinedane
1989 RAIRO - Theoretical Informatics and Applications  
Schupp, and the anymous référées for their insightful comments.  ...  The present paper is a contribution to the theory of fairness for Synchronous CCS, or SCCS, with delay operators.  ...  We can conclude that the cycles in S' characterize the infinité paths in S'.  ... 
doi:10.1051/ita/1989230100591 fatcat:2vmazhdtiba6tmfrnpipn23nr4

A PVS-Simulink Integrated Environment for Model-Based Analysis of Cyber-Physical Systems

Cinzia Bernardeschi, Andrea Domenici, Paolo Masci
2018 IEEE Transactions on Software Engineering  
Modeling patterns are defined for generating the logic-based specifications from the more familiar automata-based formalism.  ...  Formal verification with the PVS theorem prover is demonstrated for the pacemaker model for specific safety aspects of the pacemaker design.  ...  for technical aspects of the PVSio animation environment.  ... 
doi:10.1109/tse.2017.2694423 fatcat:b666om346bhnrd4n2uhpwa6xtm

Formal and Informal Methods for Multi-Core Design Space Exploration

Jean-Francois Kempf, Olivier Lebeltel, Oded Maler
2014 Electronic Proceedings in Theoretical Computer Science  
We argue that this extension of the scope of formal verification is important for the viability of the domain.  ...  We propose a tool-supported methodology for design-space exploration for embedded systems.  ...  They play the same role that stochastic arrival processes play in queueing theory. For generators of type 2 and 3 we also implemented a probabilistic semantics drawing uniformly from [t,t + J].  ... 
doi:10.4204/eptcs.154.6 fatcat:4urjwajsjnfnxnuxqhswam77im

Reasoning in Fuzzy Description Logics using Automata

Stefan Borgwardt, Rafael Peñaloza
2016 Fuzzy sets and systems (Print)  
Clearly, due to the different semantics in these logics, the construction of the automata for fuzzy DLs is more involved than for the classical case.  ...  Very recently, the ideas behind these automata-based approaches were adapted for reasoning also in fuzzy extensions of DLs, with semantics based either on finitely many truth degrees or the Gödel t-norm  ...  Acknowledgements This work was partially supported by the German Research Foundation (DFG) under grant BA 1122/17-1 (FuzzyDL) and within the Cluster of Excellence 'Center for Advancing Electronics Dresden  ... 
doi:10.1016/j.fss.2015.07.013 fatcat:zepnuj6iazcvrndlaradjyafzy

Concurrency Theory: A Historical Perspective on Coinduction and Process Calculi [chapter]

Jos C.M. Baeten, Davide Sangiorgi
2014 Handbook of the History of Logic  
Acknowledgements The authors are grateful to Luca Aceto and Rob van Glabbeek for comments on an earlier draft of the paper.  ...  Sangiorgi's work has been partially supported by the ANR project 12IS02001 "PACE".  ...  The origins of bisimulation in computer science In computer science, the search for the origins of bisimulation takes us back to the algebraic theory of automata, well-established in the 1960s.  ... 
doi:10.1016/b978-0-444-51624-4.50009-5 fatcat:o4fvjxxppvf2pkpjkcpj3erfym
« Previous Showing results 1 — 15 out of 1,466 results