Filters








20 Hits in 1.5 sec

LTL's Intuitive Representations and Its Automaton Translation [chapter]

Yuhong Zhao
IFIP International Federation for Information Processing  
This paper first presents two intuittive representations for the LTL formulas: one is graphical automaton-like; the other is textual regular-expression-like and then shows how these representations can  ...  Compared with other verification methods, to some sense, model checking can be thought of as more attractive method to test hardware and software systems due to its automatic features.  ...  LTL'S AUTOMATON TRANSLATION Because the graphical and the regular representations for LTL formulas are essentially the same thing, here we only use the regular form to illustrate the translation procedure  ... 
doi:10.1007/1-4020-8149-9_4 dblp:conf/ifip10-3/Zhao04 fatcat:6s2n55t435ecron76x46l24l5y

Requirements Capture with RCAT

Margaret Smith, Klaus Havelund
2008 2008 16th IEEE International Requirements Engineering Conference  
NASA spends millions designing and building spacecraft for its missions. The dependence on software is growing as spacecraft become more complex.  ...  This paper describes a requirements capture notation and supporting tool that graphically captures formal requirements and converts them into automata that can be used in model checking and for runtime  ...  JPL employees Martin Feather, Rajeev Joshi, Alex Groce, Gerard Holzmann, and Nicolas Rouquette provided valuable input.  ... 
doi:10.1109/re.2008.50 dblp:conf/re/SmithH08 fatcat:ogzwfuglqndcvaxflhnpvvdqri

SALT—Structured Assertion Language for Temporal Logic [chapter]

Andreas Bauer, Martin Leucker, Jonathan Streit
2006 Lecture Notes in Computer Science  
It incorporates ideas of existing approaches, such as specification patterns, but also provides nested scopes, exceptions, support for regular expressions and real-time.  ...  The paper details on the design rationale, syntax and semantics of Salt in terms of a translation to temporal (real-time) logic, as well as on the realisation in form of a compiler.  ...  In this paper, we remedy LTL's and timed LTL's (short: TLTL [RS97,D'S03]) weaknesses for industrial specifications by introducing the specification and assertion language Salt, which is an acronym for  ... 
doi:10.1007/11901433_41 fatcat:w4i6lusg2bgrxar5cb52atvdye

Size-Change Termination and Satisfiability for Linear-Time Temporal Logics [chapter]

Martin Lange
2011 Lecture Notes in Computer Science  
Linear-time temporal logics like LTL, PSL and the linear-time µ-calculus have relatively simple translations into alternating parity automata, and this automaton model is closed under all Boolean operations  ...  In this paper we present a method for decision this emptiness problem without going through intermediate automaton models like nondeterministic ones.  ...  It is known that every LTL formula can be translated into a nondeterministic Büchi automaton [26] with an expontial blow-up.  ... 
doi:10.1007/978-3-642-24364-6_3 fatcat:qktjgpig2rc4tl6mvcvkhs2pvm

Learning and detecting emergent behavior in networks of cardiac myocytes

Radu Grosu, Scott A. Smolka, Flavio Corradini, Anita Wasilewska, Emilia Entcheva, Ezio Bartocci
2009 Communications of the ACM  
We address the problem of specifying and detecting emergent behavior in networks of cardiac myocytes, spiral electric waves in particular, a precursor to atrial and ventricular fibrillation.  ...  We have implemented our methodology as the Emerald tool suite, a component of our eha framework for specification, simulation, analysis and control of excitable hybrid automata.  ...  Research supported in part by NSF awards CCR-0133583, CNS-0509230 and CCF-0523863.  ... 
doi:10.1145/1467247.1467271 fatcat:sm37yij4mfdp3js52vppc3sj44

Incorporating Monitors in Reactive Synthesis without Paying the Price [article]

Shaun Azzopardi, Nir Piterman, Gerardo Schneider
2021 arXiv   pre-print
Practitioners have found it challenging to work exclusively with declarative specifications, and have found languages that combine modelling with declarative specifications more useful.  ...  To show the advantages of our approach we apply it to specifications requiring counting and constraints over arbitrarily long sequence of events, where we can also see the power of parametrisation, easily  ...  Thus, the translation involves a conversion of our specification to an automaton and embedding this automaton in "their" specification.  ... 
arXiv:2107.00929v1 fatcat:v5pd7szd6vbcrph4w7avwacjda

Runtime Verification for LTL and TLTL

Andreas Bauer, Martin Leucker, Christian Schallhart
2011 ACM Transactions on Software Engineering and Methodology  
It classifies runtime verification in identifying its distinguishing features to model checking and testing, respectively.  ...  It is shown that the set of monitorable properties does not only encompass the safety and co-safety properties but is strictly larger.  ...  However, it might be too hard and cumbersome for the user to carry out a translation manually-and not necessary when following our construction.  ... 
doi:10.1145/2000799.2000800 fatcat:niywjbckcja3dlhxbs55hduyny

Aligning Event Logs and Declarative Process Models for Conformance Checking [chapter]

Massimiliano de Leoni, Fabrizio Maria Maggi, Wil M. P. van der Aalst
2012 Lecture Notes in Computer Science  
The approach has been implemented in ProM and has been evaluated using both synthetic logs and real-life logs from Dutch municipalities.  ...  Process mining can be seen as the "missing link" between data mining and business process management.  ...  graphical representation and a formal semantics for declarative process models.  ... 
doi:10.1007/978-3-642-32885-5_6 fatcat:kmwnwiyqbze3ve26lslhm3preu

The Theory and Practice of SALT [chapter]

Andreas Bauer, Martin Leucker
2011 Lecture Notes in Computer Science  
It incorporates ideas of existing approaches, such as PSL or Specification Patterns, in that it provides operators to express scopes and exceptions, as well as support for a subset of regular expressions  ...  On the other hand, Salt is fully translatable to LTL, if no real-time operators are used, and to TLTL (also known as state-clock logic), if real-time operators appear in a specification.  ...  alternating Büchi automaton.  ... 
doi:10.1007/978-3-642-20398-5_3 fatcat:opadxbdiafepzl5sa5c7am4m2e

A modular architecture for transparent computation in recurrent neural networks

Giovanni S. Carmantini, Peter beim Graben, Mathieu Desroches, Serafim Rodrigues
2017 Neural Networks  
Computation is classically studied in terms of automata, formal languages and algorithms; yet, the relation between neural dynamics and symbolic representations and operations is still unclear in traditional  ...  The mapping defines an architecture characterized by its granular modularity, where data, symbolic operations and their control are not only distinguishable in activation space, but also spatially localizable  ...  In particular, if the VS representation of an automaton acts on some α.β dotted sequence, the input of its associated network component is connected to the units encoding the α and β subsequences in the  ... 
doi:10.1016/j.neunet.2016.09.001 pmid:27814468 fatcat:ektluddnczehrhawumrmf4lmf4

Modeling time in computing

Carlo A. Furia, Dino Mandrioli, Angelo Morzenti, Matteo Rossi
2010 ACM Computing Surveys  
In doing so, it provides a unifying framework, rather than just a comprehensive list of formalisms.  ...  The increasing relevance of areas such as real-time and embedded systems, pervasive computing, hybrid systems control, and biological and social systems modeling is bringing a growing attention to the  ...  ACKNOWLEDGMENTS We thank the anonymous reviewer for useful suggestions and Gianpaolo Cugola for his comments on an early draft of this paper.  ... 
doi:10.1145/1667062.1667063 fatcat:6bjiukps7bavhontaewdgm7tky

Temporal Logic and Fair Discrete Systems [chapter]

Nir Piterman, Amir Pnueli
2018 Handbook of Model Checking  
We turn to the branching time framework and introduce Computational Tree Logic (CTL). As before, we discuss its expressive power, consider extensions, and cover satisfiability and model check-  ...  We study the expressive power of full LTL and cover extensions that increase its expressive power. We introduce algorithms for checking the satisfiability of LTL and model checking LTL.  ...  Acknowledgement We would like to thank referees for insightful comments and spotting an error in an earlier version of the chapter and B. Cook and H. Khlaaf for discussions on CTL.  ... 
doi:10.1007/978-3-319-10575-8_2 fatcat:elkz45iwvjcqjdvg4rcgkzxnwu

Visual formal specification using (N)TLcharts: statechart automata with temporal logic and natural language conditioned transitions

D. Drusinsky
18th International Parallel and Distributed Processing Symposium, 2004. Proceedings.  
The infusion pump TLChart specification is then compared with two competing representations: temporal logic and deterministic Harel statecharts.  ...  This paper describes TLCharts, a visual specification language that combines the visual and intuitive appeal of non-deterministic Harel Statecharts with formal specifications written in Linear-time (Metric  ...  The second step is to translate the LTL model to an input tape for an automaton.  ... 
doi:10.1109/ipdps.2004.1303343 dblp:conf/ipps/Drusinsky04 fatcat:47sk7q5pezdntfdrt6xg6vzzky

A Formally Verified Compiler Back-end

Xavier Leroy
2009 Journal of automated reasoning  
using the Coq proof assistant both for programming the compiler and for proving its correctness.  ...  This article describes the development and formal verification (proof of semantic preservation) of a compiler back-end from Cminor (a simple imperative intermediate language) to PowerPC assembly code,  ...  with its Tree and RTL representations).  ... 
doi:10.1007/s10817-009-9155-4 fatcat:ofhgseu6hfda7fki4cyofq27bi

Twenty years of rewriting logic

José Meseguer
2012 The Journal of Logic and Algebraic Programming  
; (ii) its semantic framework and logical framework uses; (iii) its language implementations and its formal tools; and (iv) its many applications to automated deduction, software and hardware specification  ...  This paper provides a gentle, intuitive introduction to its main ideas, as well as a survey of the work that many researchers have carried out over the last twenty years in advancing: (i) its foundations  ...  the first papers were published, for their further encouragement to turn my WRLA lecture into a survey paper, and for their patience in allowing me the necessary time to finish it.  ... 
doi:10.1016/j.jlap.2012.06.003 fatcat:5tx4a5uxlvapfpf5fajozkbboi
« Previous Showing results 1 — 15 out of 20 results