Filters








855 Hits in 6.9 sec

A generic framework for checking semantic equivalences between pushdown automata and finite-state automata

Antonín Kučera, Richard Mayr
2018 Journal of computer and system sciences (Print)  
We propose a generic method for deciding semantic equivalences between pushdown automata and finite-state automata.  ...  and trace-like equivalences.  ...  The state of the art: Checking semantic equivalences between two pushdown automata tends to be undecidable.  ... 
doi:10.1016/j.jcss.2017.09.004 fatcat:mytklwnm5fcargxzvdltbcntbm

A Generic Framework for Checking Semantic Equivalences Between Pushdown Automata and Finite-State Automata [chapter]

Antonin Kučera, Richard Mayr
IFIP International Federation for Information Processing  
We propose a generic method for deciding full equivalence between pushdown processes and finite-state processes applicable to every process equivalence satisfying certain abstract conditions.  ...  For a given process equivalence, we say that a process g is fully equivalent to a process f of a transition system T if g is equivalent to f and every reachable state of g is equivalent to some state of  ...  Acknowledgements We thank the reviewers for their many useful comments and suggestions. Antonín Kučera is supported by the Czech Science Foundation, grant No. P202/12/G061.  ... 
doi:10.1007/1-4020-8141-3_31 dblp:conf/ifipTCS/KuceraM04 fatcat:cdobkjvdynb7nnzcuf3vz6t46e

Page 4343 of Mathematical Reviews Vol. , Issue 96g [page]

1996 Mathematical Reviews  
to the usual operators for communication, nondetermin- ism, internal actions, and restrictions, and study a suitable notion of semantic equivalence for it.  ...  Here, we construct a categorical equivalence between a large category of (‘cancellative’) automata with concurrency relations and the as- sociated domains.  ... 

Page 2888 of Mathematical Reviews Vol. , Issue 2003d [page]

2003 Mathematical Reviews  
“First, we show that state recurrence and progress are in general undecidable for polynomial hybrid automata.  ...  Our methods are applicable to problems in different areas, e.g., data-flow analysis, analysis of systems with checkpoints, etc., and provide a general, unifying and efficient framework for solving these  ... 

Higher-Order Model Checking: An Overview

Luke Ong
2015 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science  
algorithmics and semantics of higher-order model checking and allied methods of formal analysis.  ...  Because the trees generated by recursion schemes are computation trees of higher-order functional programs, higherorder model checking provides a foundation for model checkers of such programming languages  ...  Acknowledgements: The author is grateful to Takeshi Tsukada for helpful comments on the paper.  ... 
doi:10.1109/lics.2015.9 dblp:conf/lics/Ong15 fatcat:55bfxqlkuzhbtgmzc32m46ooku

A Contextual Equivalence Checker for IMJ* [chapter]

Andrzej S. Murawski, Steven J. Ramsay, Nikos Tzevelekos
2015 Lecture Notes in Computer Science  
This is achieved by reducing the equivalence problem to the emptiness problem for fresh-register pushdown automata.  ...  We present CONEQCT: a contextual equivalence checking tool for terms of IMJ * , a fragment of Interface Middleweight Java for which the problem is decidable.  ...  Research supported by the Engineering and Physical Sciences Research Council (EP/J019577/1) and the Royal Academy of Engineering (RF: Tzevelekos).  ... 
doi:10.1007/978-3-319-24953-7_19 fatcat:4frbqvhz4rf6pkpjpss6pa6zo4

Recursion Schemes, Collapsible Pushdown Automata and Higher-Order Model Checking [chapter]

Luke Ong
2013 Lecture Notes in Computer Science  
A central theme of the work is the fruitful interplay of ideas between the neighbouring fields of semantics and algorithmic verification.  ...  Collapsible pushdown automata are a generalisation of pushdown automata to higher-order stacks -which are iterations of stack of stacks -that contain symbols equipped with links.  ...  I am grateful to all my collaborators for their help. Thanks are also due to EPSRC for financial support.  ... 
doi:10.1007/978-3-642-37064-9_3 fatcat:vmzogjyskfahbeklhyssyajvuy

Verification of Infinite State Systems [chapter]

Ahmed Bouajjani
2003 Lecture Notes in Computer Science  
One of the main actual challenges in the domain of automated verification is the conception of methods and tools allowing to deal with verification problems beyond the finite-state framework.  ...  During the two last decades, significant achievements have been obtained in the case of finite-state systems (systems with finitely many states).  ...  On the other hand, weak bisimilarity between pushdown automata and finite automata is PSPACE-hard, even for a small fixed finite automaton.  ... 
doi:10.1007/978-3-540-45220-1_7 fatcat:4j5lzdbfc5hd7ptdo4tpwvmd2m

From Security Protocols to Pushdown Automata [chapter]

Rémy Chrétien, Véronique Cortier, Stéphanie Delaune
2013 Lecture Notes in Computer Science  
This result is obtained through a characterization of equivalence of protocols in terms of equality of languages of (generalized, real-time) deterministic pushdown automata.  ...  We study the problem of checking equivalence of security protocols for an unbounded number of sessions.  ...  Therefore, checking for equivalence of protocols is as difficult as checking equivalence of deterministic generalized real-time pushdown automata.  ... 
doi:10.1007/978-3-642-39212-2_15 fatcat:p6kk7ho3ejaenfvqris2ghty5q

From Security Protocols to Pushdown Automata

Rémy Chrétien, Véronique Cortier, Stéphanie Delaune
2015 ACM Transactions on Computational Logic  
This result is obtained through a characterization of equivalence of protocols in terms of equality of languages of (generalized, real-time) deterministic pushdown automata.  ...  We study the problem of checking equivalence of security protocols for an unbounded number of sessions.  ...  Therefore, checking for equivalence of protocols is as difficult as checking equivalence of deterministic generalized real-time pushdown automata.  ... 
doi:10.1145/2811262 fatcat:4374sg5xnvc6raq2zshqz7zijy

Foundations of Reversible Computation [chapter]

Bogdan Aman, Gabriel Ciobanu, Robert Glück, Robin Kaarsgaard, Jarkko Kari, Martin Kutrib, Ivan Lanese, Claudio Antares Mezzina, Łukasz Mikulski, Rajagopal Nagarajan, Iain Phillips, G. Michele Pinna (+3 others)
2020 Lecture Notes in Computer Science  
In [10] , the authors present CCSq, a concurrent language for describing quantum systems, and develop verification techniques for checking equivalence between CCSq processes.  ...  The language has a formal semantics and a type system to statically check for reversibility of programs.  ... 
doi:10.1007/978-3-030-47361-7_1 fatcat:3qgnwqrqnvdltkqjbuzfgx7wty

Infinite Computation, Co-induction and Computational Logic [chapter]

Gopal Gupta, Neda Saeedloei, Brian DeVries, Richard Min, Kyle Marple, Feliks Kluźniak
2011 Lecture Notes in Computer Science  
We discuss its applications to modeling ω-automata, model checking, verification, non-monotonic reasoning, developing SAT solvers, etc. We also discuss future research directions.  ...  Our coinductive constraint logic programming realization of pushdown timed automata and timed automata can be regarded as a general framework for modeling/verifying real-time systems.  ...  A pushdown timed automaton (PTA) [4] extends a timed automaton with a stack, just as a pushdown automaton extends a finite automaton.  ... 
doi:10.1007/978-3-642-22944-2_4 fatcat:v2klxrhr6vfpfagwncfzpg56v4

Tree Transducers and Formal Methods (Dagstuhl Seminar 13192)

Sebastian Maneth, Helmut Seidl, Marc Herbstritt
2013 Dagstuhl Reports  
License Creative Commons BY 3.0 Unported license © Sebastian Maneth The Dagstuhl seminar 13192 "Tree Transducers and Formal Methods" was a short two and a half day seminar that took place from May 5th  ...  These points were addressed in particular: Expressiveness versus Complexity: Which transducers offer the best trade-offs between expressiveness and complexity?  ...  Any two-way finite state automaton is equivalent to some one-way finite state automaton.  ... 
doi:10.4230/dagrep.3.5.1 dblp:journals/dagstuhl-reports/ManethS13 fatcat:xxotqpzgnzc3zdlkk4zxsdot5i

Page 6285 of Mathematical Reviews Vol. , Issue 2003h [page]

2003 Mathematical Reviews  
This is particularly important in order to model finite failure and infinite behaviour. Compositionality of a semantics for finite failure is discussed.  ...  The paper provides an answer to an open problem: Two-state Mealy automata over a two-letter alphabet are constructed that generate a semigroup of intermediate growth. K.  ... 

Complexity Bounds for the Verification of Real-Time Software [chapter]

Rohit Chadha, Axel Legay, Pavithra Prabhakar, Mahesh Viswanathan
2010 Lecture Notes in Computer Science  
The control state reachability problem for timed automata is PSPACE-complete and for pushdown timed automata is DEXPTIME-complete. 2.  ...  The bisimulation and simulation problems between a timed automata and a pushdown timed automata is 2-DEXPTIME-complete. 5.  ...  finite state systems and pushdown automata [19, 17] and model-checking µ-calculus properties for higher order pushdown automata [20] to obtain the following result.  ... 
doi:10.1007/978-3-642-11319-2_10 fatcat:4n2kb6dldnbodd6avks3fig5ly
« Previous Showing results 1 — 15 out of 855 results