A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Filters
A Relational Trace Logic for Vector Addition Systems with Application to Context-Freeness
[chapter]
2013
Lecture Notes in Computer Science
Preserved Fulltext
We introduce a logic for specifying trace properties of vector addition systems (VAS). This logic can express linear relations among pumping segments occurring in a trace. ...
Compared to similar logics that are solvable in exponential space, a distinguishing feature of our logic is its ability to express non-context-freeness of the trace language of a VAS. ...
Our objective is to express non-context-freeness by a formula in our relational trace logic. However, the conditions of Definition 8.1 cannot be translated, as is, in the logic. ...
doi:10.1007/978-3-642-40184-8_11
fatcat:g4y2h5iuxvgd7ohsta5tcwva4y
On the Context-Freeness Problem for Vector Addition Systems
2013
2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Petri nets, or equivalently vector addition systems (VAS), are widely recognized as a central model for concurrent systems. ...
As a corollary, we obtain that the trace language of a VAS is context-free if, and only if, it has a context-free intersection with every bounded regular language. ...
ACKNOWLEDGMENT The authors thank Alain Finkel for fruitful discussions. This work was supported by the ANR project REACHARD (ANR-11-BS02-001). ...
doi:10.1109/lics.2013.9
dblp:conf/lics/LerouxPS13
fatcat:4ian5l23inhena4wrwmy7xs6iq
Event-B at Work: Some Lessons Learnt from an Application to a Robot Anti-collision Function
[chapter]
2017
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
In this paper, we describe the experience of development engineers non familiar with Event-B to getting to grips with this method. ...
The technical and academic aspects of the Event-B method, and the abstract description of its application in industrial contexts are the subjects of numerous publications. ...
These values can then be used in the original Event-B model making JeB a very handy tool for the production of test vectors for complex data (relations pairs etc…). ...
doi:10.1007/978-3-319-57288-8_24
fatcat:we7reyap75axjavdxj5bn2i4w4
Compatibility Analysis of Time Open Workflow Nets
2014
Applications and Theory of Petri Nets
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
To interact correctly with each other, these processes have to be compatible. ...
In this context, we suggest in this paper to study the compatibility of ToWF-nets in different aspects and to provide a formal approach to characterize and verify this property. ...
Given a concurrent system ⌃ and a temporal logic formula ', the model checking problem is to decide whether ⌃ satisfies '. Hence, we have to formulate in temporal logic the properties to be verified. ...
dblp:conf/apn/SbaiBB14
fatcat:7smsftdqffbx3oqnmnzz3oukga
Some aspects of categories in computer science
[chapter]
2000
Handbook of Algebra
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
In order to prove observational equivalence of two PCF terms, R. Milner showed it su ces to pick applicative contexts, i.e. ...
Proposition 6.15 A partially additive category C is traced monoidal with = coproduct and if f : X U ?! ...
De nition 6.13 Let C be a PAMon-category with countable coproducts L i2I X i . For any j 2 I we de ne quasi projections PR j : L i2I X i ?! ...
doi:10.1016/s1570-7954(00)80027-3
fatcat:oeaqbcqgzjhuzl2ddangzergr4
Analysis and Verification of Service Interaction Protocols - A Brief Survey
2010
Electronic Proceedings in Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Other Versions
Composing Web services is a complicated task which requires techniques and tools to verify that the new system will behave correctly. ...
Second, we give a brief survey of verification techniques that can be used to analyse services and their interaction. Last, we focus on the realizability and conformance of choreographies. ...
The author would like to thank Meriem Ouederni for her comments on a former version of this paper. ...
doi:10.4204/eptcs.35.7
fatcat:k57itzmpoff3dn7n744wmxxo7m
Efficiently Deciding μ-Calculus with Converse over Finite Trees
2015
ACM Transactions on Computational Logic
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
We present a sound and complete satisfiability-testing algorithm and its effective implementation for an alternation-free modal µ-calculus with converse, where formulas are cycle-free and are interpreted ...
Our implementation is available online, and can be used to solve logical formulas of significant size and practical value. We illustrate this in the setting of XML trees. ...
ACKNOWLEDGMENTS We thank the anonymous referees of TOCL for their valuable remarks and suggestions that significantly contributed to improving the presentation of the results described in this publication ...
doi:10.1145/2724712
fatcat:wohxmeje4bbataep2dcwqwbzbq
FORMALIZATION, PRIMITIVE CONCEPTS, AND PURITY
2012
The Review of Symbolic Logic
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We use this framework to discuss Kennedy's notion of 'formalism freeness' in the context of various schools in model theory. ...
Moreover, formalizing the situation does not provide a tool for characterizing purity. ...
(There is no good proof system for second order logic and the proof systems for infinitary logic use inference rules with infinitely many premises.) ...
doi:10.1017/s1755020312000263
fatcat:g7ngqrryx5ey5hqogziddftpmu
Analysis of digital circuits through symbolic reduction
1991
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
A well-known difficulty associated with formal verification of digital circuits is to define a formal model which both accurately reflects the behavior of the circuit, and is analytically tractable. ...
applications of homomorphic transformations. ...
O V ) With this addition, the starvation freeness task again failed, however, producing the trace of Fig. 12 . ...
doi:10.1109/43.97615
fatcat:fxq5gf3prfh2lnz2sgtkcun37e
Preferences in artificial intelligence
2015
Annals of Mathematics and Artificial Intelligence
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This system is equivalent to the one proposed by Ernest Adams in the context of conditional logic [2] and to the 'conservative core' of Judea Pearl and Hector Geffner' probabilistic system for default ...
Frameworks for preferential reasoning have not been limited to the propositional context [162, 169] . ...
doi:10.1007/s10472-015-9475-5
fatcat:3wspv5ycirgapjv6u2bxpcd6p4
On quantitative Analysis of Time Open Workflow Nets and Parametric Extension
2015
International Workshop on Verification and Evaluation of Computer and Communication Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
In addition to a well constructed model of a workflow system, a prior and rigorous verification phase is important to ensure a correct execution of the system. ...
First, we present the Time open Workflow nets (ToWF-nets) which stand for a sub-class of Petri nets dedicated to model any business process which interact with other partners via interface places in order ...
Given a concurrent system Σ and a temporal logic formula ϕ, the model checking problem is to decide whether Σ satisfies ϕ. Hence, we have to formulate in temporal logic the properties to be verified. ...
dblp:conf/vecos/SbaiB15
fatcat:xtemorvsgnfh7nu3a3d37nqtmu
Half a century after Carl Adam Petri's Ph.D. thesis: A perspective on the field
2013
Annual Reviews in Control
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
for Standardization) or IEC (International Electrotechnical Commission) standards for the use of Petri nets in engineering, this work cannot hope to be a complete survey or a tutorial in the more classical ...
It is certainly worth remarking on half a century of a work defining a landmark in Discrete Event Dynamic Systems (DEDS) theory. ...
Acknowledgements The author wishes to thank several colleagues and friends, pioneers in the field, for their valuable suggestions. ...
doi:10.1016/j.arcontrol.2013.09.001
fatcat:othq33ivp5hdtpxqiwznkek6pe
Probabilistic Constraint Logic Programming
[article]
1997
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
We address these problems for a more expressive probabilistic constraint logic programming model. We present a log-linear probability model for probabilistic constraint logic programming. ...
Our algorithm applies to log-linear models in general and is accompanied with suitable approximation methods when applied to large data spaces. ...
A constraint logic program P is then defined with respect to an implicit basic constraint language L and its relational extension R(L) as follows (see Höhfeld and Smolka (1988) ). ...
arXiv:cmp-lg/9711001v1
fatcat:32wsolusfrbfxiihu65zlswp64
Subject index volumes 1–200
1999
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
VCCS submodels, 3308 VC (Vapnis-Chernovenkis)-dimension, vector addition system, Karp-Miller -, 470 vector addition system reachability sets, 30, 1218projections of -, 1218 vector addition systems,30, ...
, 1641 varieties, 1430, 1575, 1797 VASS (vector addition system with states), 891 finite -, 891 VASS's of dimension two, 859 Vazirani and Valiant, 2025 VCCS (vector controlled concurrent system), 3308 ...
doi:10.1016/s0304-3975(98)00319-3
fatcat:s22ud3iiqjht7lfbtc3zctk7zm
Abstract Scalars, Loops, and Free Traced and Strongly Compact Closed Categories
[chapter]
2005
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We then proceed to an extended discussion of free constructions for a sequence of progressively more complex kinds of structured category, culminating in the strongly compact closed case. ...
We also discuss variations where a prescribed monoid of scalars can be 'glued in' to the free construction. ...
Multiplicatives and Additives We briefly mention a wider context for these ideas. ...
doi:10.1007/11548133_1
fatcat:sv3gyx2l4zb3xjzsdqku7lklfq
« Previous
Showing results 1 — 15 out of 439 results