scholarly journals Event Algebra for Transition Systems Composition - Application to Timed Automata

2013 ◽  
Author(s):  
Elie Fares ◽  
Jean-Paul Bodeveix ◽  
Mamoun Filali
Keyword(s):  
Timed Automata ◽  
Transition Systems ◽  
Event Algebra

scholarly journals Event algebra for transition systems composition application to timed automata

2017 ◽  
Vol 55 (5) ◽  
pp. 363-400
Author(s):  
Elie Fares ◽  
Jean-Paul Bodeveix ◽  
Mamoun Filali
Keyword(s):  
Timed Automata ◽  
Transition Systems ◽  
Event Algebra

scholarly journals Well (and Better) Quasi-Ordered Transition Systems

2010 ◽  
Vol 16 (4) ◽  
pp. 457-515 ◽  
Author(s):  
Parosh Aziz Abdulla
Keyword(s):  
Petri Nets ◽  
Timed Automata ◽  
Timed Petri Nets ◽  
Transition Systems ◽  
State Spaces ◽  
Rewriting Systems ◽  
Symbolic Representations ◽  
Infinite State ◽  
Lossy Channel ◽  
Quasi Ordering

AbstractIn this paper, we give a step by step introduction to the theory ofwell quasi-orderedtransition systems. The framework combines two concepts, namely (i) transition systems which aremonotonicwrt. awell-quasi ordering; and (ii) a scheme for symbolicbackwardreachability analysis. We describe several models with infinite-state spaces, which can be analyzed within the framework, e.g., Petri nets, lossy channel systems, timed automata, timed Petri nets, and multiset rewriting systems. We will also presentbetter quasi-orderedtransition systems which allow the design of efficient symbolic representations of infinite sets of states.

scholarly journals Characteristic Formulae: From Automata to Logic

2007 ◽  
Vol 14 (2) ◽  
Author(s):  
Luca Aceto ◽  
Anna Ingólfsdóttir
Keyword(s):  
Timed Automata ◽  
Specification Language ◽  
Transition Systems ◽  
Labelled Transition Systems ◽  
Logical Specification ◽  
Single Formula

This paper discusses the classic notion of characteristic formulae for processes using variations on Hennessy-Milner logic as the underlying logical specification language. It is shown how to characterize logically (states of) finite labelled transition systems modulo bisimilarity using a single formula in Hennessy-Milner logic with recursion. Moreover, characteristic formulae for timed automata with respect to timed bisimilarity and the faster-than preorder of Moller and Tofts are offered in terms of the logic L_nu of Laroussinie, Larsen and Weise.

Towards an Optimal Generation of Zones Graph Relating Timed Bisimulation Relation and Distribution

2016 ◽  
Vol 7 (3) ◽  
pp. 21-41
Author(s):  
Matmat Riadh ◽  
Kitouni Ilham ◽  
Saidouni Djamel Eddine
Keyword(s):  
Distributed Generation ◽  
Timed Automata ◽  
Time Model ◽  
Transition Systems ◽  
Formal Validation ◽  
Novel Approach ◽  
Finite State ◽  
Local Construction ◽  
State Abstraction ◽  
State Space Generation

The timed automata are extensively used in different fields of formal validation in particular the model checking one. In this paper the authors are interested by a class of TA called durational actions timed automata (daTA) and the zones graph which represents an exact finite state abstraction based on what called Zones. The authors present a novel approach to construct a zone graph, based on the maximality semantics called maximality-based zone graph (MZG) by a local construction approach and they define timed maximality bisimulation relation for real-time model based on the maximality semantics. The authors propose a new method for distributed state space generation of maximality-based zone graph based on DHT structure. They also describe an implementation of this construction (DTaMaZG tool). The experiments given at the end of this article has shown good results especially when comparing with other works that have already proceed in the distributed generation of MLTS (Maximality based Labeled Transition Systems).

Modeling and Verifying Services of Internet of Things Based on Timed Automata

2011 ◽  
Vol 34 (8) ◽  
pp. 1365-1377 ◽  
Author(s):  
Li-Xing LI ◽  
Zhi JIN ◽  
Ge LI
Keyword(s):  
Internet Of Things ◽  
Timed Automata

Neural Transition Systems for Modeling Hierarchical Semantic Representations

2019 ◽  
Author(s):  
Riyaz Bhat ◽  
John Chen ◽  
Rashmi Prasad ◽  
Srinivas Bangalore
Keyword(s):  
Semantic Representations ◽  
Transition Systems

scholarly journals Battery transition systems

2014 ◽  
Vol 49 (1) ◽  
pp. 595-606 ◽  
Author(s):  
Udi Boker ◽  
Thomas A. Henzinger ◽  
Arjun Radhakrishna
Keyword(s):  
Transition Systems

The Complexity of Model-Checking Tail-Recursive Higher-Order Fixpoint Logic

2021 ◽  
Vol 178 (1-2) ◽  
pp. 1-30
Author(s):  
Florian Bruse ◽  
Martin Lange ◽  
Etienne Lozes
Keyword(s):  
Model Checking ◽  
Lower Bounds ◽  
Expressive Power ◽  
Higher Order ◽  
Order Logic ◽  
High Complexity ◽  
Transition Systems ◽  
Recursive Formulas ◽  
Second Order Logic ◽  
Monadic Second Order Logic

Higher-Order Fixpoint Logic (HFL) is a modal specification language whose expressive power reaches far beyond that of Monadic Second-Order Logic, achieved through an incorporation of a typed λ-calculus into the modal μ-calculus. Its model checking problem on finite transition systems is decidable, albeit of high complexity, namely k-EXPTIME-complete for formulas that use functions of type order at most k < 0. In this paper we present a fragment with a presumably easier model checking problem. We show that so-called tail-recursive formulas of type order k can be model checked in (k − 1)-EXPSPACE, and also give matching lower bounds. This yields generic results for the complexity of bisimulation-invariant non-regular properties, as these can typically be defined in HFL.

Sign in / Sign up

Export Citation Format

Share Document