4,433 Hits in 7.1 sec

Symbolic Reachability for Process Algebras with Recursive Data Types [chapter]

Stefan Blom, Jaco van de Pol
2008 Lecture Notes in Computer Science  
In this paper, we present a symbolic reachability algorithm for process algebras with recursive data types.  ...  As new features, our algorithm supports recursive data types and allows unbounded non-determinism, which is needed to support open systems with data.  ...  Introduction High level formalisms, such as Petri Nets and Process Algebras are powerful languages for specifying systems. When combined with recursive data types, they become even more powerful.  ... 
doi:10.1007/978-3-540-85762-4_6 fatcat:af6mnv5p2ndnjgad5o4lg6jvyu

Page 1666 of Mathematical Reviews Vol. , Issue 91C [page]

1991 Mathematical Reviews  
Discrete projections (corresponding to the discrete metric) can be taken for data types. This allows one to use projection specifications also for combined data and process types.”  ...  A fixed point theorem for pro- jection spaces is used for the definition of the semantics of recursive process specifications.  ... 

A New Algorithm for Partitioned Symbolic Reachability Analysis

Kai Lampka
2008 Electronical Notes in Theoretical Computer Science  
In this work a new operator for zero-suppressed BDDs and their multi-terminal extensions for carrying out (partitioned) symbolic reachability analysis is presented.  ...  Since the symbolic composition schemes deliver the potential SG of a high-level model, one must execute a reachability analysis on the level of the symbolic structures.  ...  In the following it is assumed that the reader has basic familiarity with high-level (Markov) model description techniques, such as Generalized Stochastic Petri Net (GSPNs), or Stochastic Process Algebra  ... 
doi:10.1016/j.entcs.2008.12.036 fatcat:hyw7wtvzw5dq3kq4upkbm4jtua

Page 1384 of Mathematical Reviews Vol. 47, Issue 5 [page]

1974 Mathematical Reviews  
4 recursive function with loglog G(k) <k.  ...  The acceptance and parsing processes of M(G) are illustrated by several de- tailed examples. The second model provides an algebraic formalism for operations involved in the analysis process.  ... 

Verifying higher-order functional programs with pattern-matching algebraic data types

C.-H. Luke Ong, Steven James Ramsay
2011 SIGPLAN notices  
We introduce pattern-matching recursion schemes (PMRS) as an accurate model of computation for functional programs that manipulate algebraic data-types.  ...  Type-based model checking algorithms for higher-order recursion schemes have recently emerged as a promising approach to the verification of functional programs.  ...  We would like to thank the anonymous reviewers for many useful comments.  ... 
doi:10.1145/1925844.1926453 fatcat:lb4typdmuvhonm47iiciyxczwy

Report on the Model Checking Contest at Petri Nets 2011 [chapter]

Fabrice Kordon, Alban Linard, Didier Buchs, Maximilien Colange, Sami Evangelista, Kai Lampka, Niels Lohmann, Emmanuel Paviot-Adet, Yann Thierry-Mieg, Harro Wimmel
2012 Lecture Notes in Computer Science  
It discusses the enhancements required for future editions of the Model Checking Contest event at the Petri Nets conference.  ...  The collected data gave some hints about the way techniques can scale up depending on both examinations and the characteristics of the models.  ...  Acknowledgements The Model Checking Contest @ Petri nets organizers would like to thank the following people for the help they provided in setting up this event: Clément Démoulins (infrastructure), Nicolas  ... 
doi:10.1007/978-3-642-35179-2_8 fatcat:joniyupqprglhotup2mloxyv24

Structured algebraic specifications: A Kernel language

Martin Wirsing
1986 Theoretical Computer Science  
The presentation semantics is used for showing the existence of a complete (semiformal) proof system for specifications, whereas the model class semantics is fully abstract with respect to specification  ...  It is shown that any recursively enumerable signature and any class of algebras which is 'pseudo-axiomatizable' in a recursively enumerable way are definable in ASL; also, every computable transformation  ...  I would like to express my warmest thanks to my parents and to Alexa for their patience and moral support. Finally, I am indebted to all those who contributed to the typing of the manuscript.  ... 
doi:10.1016/0304-3975(86)90051-4 fatcat:kowsnd4ngfhelfoxxr7nn5l6za

Mind the gap! Abstract versus concrete models of specifications [chapter]

Donald Sannella, Andrzej Tarlecki
1996 Lecture Notes in Computer Science  
For example, the semantics of Standard ML uses rather concrete models, where data values are represented as closed constructor terms and functions are represented as "closures".  ...  In the theory of algebraic specifications, many-sorted algebras are used to model programs: the representation of data is arbitrary and operations are modelled as ordinary functions.  ...  Thanks especially to Stefan for service as an oracle concerning the semantics of SML and EML and recursive function theory.  ... 
doi:10.1007/3-540-61550-4_143 fatcat:al6t4ovhqjhnbon7i6rhnaloje

MatchC: A Matching Logic Reachability Verifier Using the K Framework

Andrei Stefanescu
2014 Electronical Notes in Theoretical Computer Science  
Matching logic reachability is a unifying framework for operational and axiomatic semantics of programing languages.  ...  The main contributions of this paper are the implementation of the verifier, with emphasis on using K for program verification, and the evaluation of the tool on a large number of programs, including complex  ...  This process is implemented with K rules.  ... 
doi:10.1016/j.entcs.2014.05.010 fatcat:5u3av3qepbgjfepqnuxyt4wlra

Symbolic Performance and Dependability Evaluation with the Tool CASPA [chapter]

Matthias Kuntz, Markus Siegle, Edith Werner
2004 Lecture Notes in Computer Science  
We present several case studies which demonstrate the superiority of CASPA over sparse-matrixbased process algebra tools. Furthermore, CASPA is compared to other symbolic modelling tools.  ...  All phases of modelling, from model construction to numerical analysis and measure computation, are based entirely on this symbolic data structure.  ...  Acknowledgement The authors would like to cordially thank Dave Parker for making the numerical solution code of PRISM available to the scientific community.  ... 
doi:10.1007/978-3-540-30233-9_22 fatcat:jmhduphxhvcr7mmgs4nqcv7wyu

Analytical Study of Algorithms for Solving Inverse Kinematic Problems in Robot Motion Control

Dr. Osama Ahmad Salim Safarini
2018 International Journal of Advanced Computer Science and Applications  
We have also analyzed the convergence of iterative algorithms with the regularization on the trajectory with the points outside of the gripper reachability.  ...  The example of an iterative calculation of joint trajectories for a 3link robot using the recursive algorithm for the Jacobi matrix calculation has been presented.  ...  Analysis of the convergence of iterative algorithms Let us analyze the processes of the iterative IKP solution using algorithms (6) -(10) with the Jacobi matrix calculation using the above recursive algorithm  ... 
doi:10.14569/ijacsa.2018.090410 fatcat:pzkni7wwobfa7jjr5eo6no36mq

Multi-core and/or Symbolic Model Checking

Tom Van Dijk, Alfons Laarman, Jaco Van De Pol
2012 Electronic Communications of the EASST  
This forms an excellent basis for scalable parallel symbolic model checking.  ...  Our symbolic model checker is based on Multiway Decision Diagrams and the saturation strategy.  ...  Symbolic Reachability for Process Algebras with Recursive Data Types. In Fitzgerald et al. (eds.), Proc. Theoretical Aspects of Com- puting (ICTAC 2008).  ... 
doi:10.14279/tuj.eceasst.53.773 dblp:journals/eceasst/DijkLP12 fatcat:rl5gppktvbdrrnissitxywxpte

Reachability Analysis for Spatial Concurrent Constraint Systems with Extrusion [article]

Miguel Romero, Camilo Rocha
2018 arXiv   pre-print
By being executable, the rewriting logic specification offers support for the inherent symbolic and challenging task of reachability analysis in the constrained-based model.  ...  Spatial concurrent constraint programming (SCCP) is an algebraic model of spatial modalities in constrained-based process calculi; it can be used to reason about spatial information distributed among the  ...  data types such as terms over the built-ins or at the meta-level in R have been removed.  ... 
arXiv:1805.07434v1 fatcat:trtncfvnkvdpni2f6vzqnruiyi

On-the-fly progress detection in iterative stream queries

Badrish Chandramouli, Jonathan Goldstein, David Maier
2009 Proceedings of the VLDB Endowment  
A key advantage of FFP is that it works with existing algebra operators, thereby inheriting their capabilities, such as windowing and dealing with out-oforder input.  ...  An issue with cyclic queries over dynamic inputs is knowing when the query result has progressed to a certain point in the input, since the number of iterations is data dependent.  ...  The FFP Operator To use the FFP operator to compute fixed points relative to a query Q(r, s), we need an algebraic query tree Figure 3 shows the recursive loop in our reachability query as a dashed  ... 
doi:10.14778/1687627.1687655 fatcat:ga75bnbtwncm5d3vuf2zw6qpo4

Symbolic Representations and Analysis of Large Probabilistic Systems [chapter]

Andrew Miner, David Parker
2004 Lecture Notes in Computer Science  
This is possible in practice because systems are typically modeled using structured, high-level specification formalisms such as Petri nets and process algebras.  ...  This paper describes symbolic techniques for the construction, representation and analysis of large, probabilistic systems.  ...  Kronecker algebra A well-accepted compact representation for certain types of models (usually CTMCs) is based on Kronecker algebra.  ... 
doi:10.1007/978-3-540-24611-4_9 fatcat:ftxrusdesbfv5e5grgqv4wprc4
« Previous Showing results 1 — 15 out of 4,433 results