Filters








69 Hits in 3.1 sec

IMITATOR 3: Synthesis of Timing Parameters Beyond Decidability [chapter]

Étienne André
2021 Lecture Notes in Computer Science  
In contrast, parametric timed model checking synthesizes timing values ensuring correctness. takes as input an extension of parametric timed automata (PTAs), a powerful formalism to formally verify critical  ...  When timing constants are uncertain (in early the design phase, or due to slight variations of the timing bounds), timed model checking techniques may not be satisfactory.  ...  colleagues brought very valuable enhancements, notably Camille Coti and Sami Evangelista [14] (on distributed algorithms), Nguy Hoàng Gia [27] (on non-Zeno algorithms), Vincent Bloemen [12] (on minimal-time  ... 
doi:10.1007/978-3-030-81685-8_26 fatcat:iw6cknv6nzfybbuyxmfyt5n7yy

PSyHCoS: Parameter Synthesis for Hierarchical Concurrent Real-Time Systems [chapter]

Étienne André, Yang Liu, Jun Sun, Jin Song Dong, Shang-Wei Lin
2013 Lecture Notes in Computer Science  
We present here PSyHCoS, a tool for analyzing parametric real-time systems specified using the hierarchical modeling language PSTCSP.  ...  PSyHCoS supports several algorithms for parameter synthesis and model checking, as well as state space reduction techniques.  ...  Other classical model checking algorithms (such as LTL, deadlock freeness, or refinement checking) are also available.  ... 
doi:10.1007/978-3-642-39799-8_70 fatcat:6d4j2gvrqjfs5peugdaispuygi

A Benchmarks Library for Extended Parametric Timed Automata [chapter]

Étienne André, Dylan Marinho, Jaco van de Pol
2021 Lecture Notes in Computer Science  
Parametric timed automata are a powerful formalism for reasoning on concurrent real-time systems with unknown or uncertain timing constants.  ...  We extend here the library with several dozens of new benchmarks; these benchmarks highlight several new features: liveness properties, extensions of (parametric) timed automata (including stopwatches  ...  Parametric Timed Automata Parametric Timed Automata (PTAs) Timed automata (TAs) [AD94] extend finite-state automata with clocks, i.e., real-valued variables evolving at the same rate 1, that can be compared  ... 
doi:10.1007/978-3-030-79379-1_3 fatcat:ul2y2m727ravrdpqr4n7mnzls4

Threefold Analysis of Distributed Systems: IMDS, Petri Net and Distributed Automata DA3

Wiktor Daszczuk
2017 Communiation Papers of the 2017 Federated Conference on Computer Science and Information Systems  
For the graphical specification and simulation of distributed systems, Distributed Autonomous and Asynchronous Automata (DA3) are invented.  ...  CONCLUSIONS AND FURTHER WORK The Dedan program supports an engineer in verification of distributed systems for deadlock freeness, without any knowledge on temporal logics and model checking technique.  ...  These automata are called distributed automata in many papers concerning the behavior of concurrent systems (in some of them additionally equipped with real time clocks for temporal analysis with real-time  ... 
doi:10.15439/2017f32 dblp:conf/fedcsis/Daszczuk17 fatcat:5izzr2ujsjdkpfwsa5f7p2nnkm

Timed Orchestration for Component-based Systems [article]

Chih-Hong Cheng, Lacramioara Astefanoaei, Harald Ruess, Souha Ben Rayana, Saddek Bensalem
2016 arXiv   pre-print
We formalize this problem of configuring and orchestrating flexible production lines as a parameter synthesis problem for systems of parametric timed automata, where interactions are based on skills.  ...  For safety properties, synthesis problems are solved by checking satisfiability of ∃∀SMT constraints.  ...  Verification and synthesis of parametric timed automata have recently been considered, among others, by [16, 5, 17] .  ... 
arXiv:1504.05513v3 fatcat:nv6nvira5vegrln2ah4ixglumq

A Survey on Time-aware Business Process Modeling
english

Saoussen Cheikhrouhou, Slim Kallel, Nawal Guermouche, Mohamed Jmaiel
2013 Proceedings of the 15th International Conference on Enterprise Information Systems  
Indeed, time managing is an effective cost and error reduction strategy.  ...  One key perspective when dealing with Business Process Management (BPM) is time. All business experts agree upon the fact that time is a key resource for each business process within an organisation.  ...  The clock ordering process is used to verify deadlock freeness due to time constraints conflicts.  ... 
doi:10.5220/0004413202360242 dblp:conf/iceis/CheikhrouhouKGJ13 fatcat:2a3buacrkbgsxpgf42ssbqlbri

Formal verification of multitasking applications based on timed automata model

Libor Waszniowski, Zdeněk Hanzálek
2007 Real-time systems  
Keywords Formal methods · Verification · Model-checking · Timed automata · OSEK/VDX · Multitasking Introduction This paper deals with formal modeling of applications running under real-time operating system  ...  The aim of this paper is to show, how a multitasking application running under a real-time operating system compliant with an OSEK/VDX standard can be modeled by timed automata.  ...  When new desired gear (NEUTRAL, 1. . .5, R) is selected, it is engaged in 1020 time units Deadlock-freeness: P12.  ... 
doi:10.1007/s11241-007-9036-z fatcat:z6eik34ehjbztl3ylxqm3er2yq

The UniForM workbench a universal development environment for formal methods [chapter]

Bernd Krieg-Brückner, Jan Peleska, Ernst-Rüdiger Olderog, Alexander Baer
1999 Lecture Notes in Computer Science  
The UniForM Workbench supports combination of Formal Methods (on a solid logical foundation), provides tools for the development of hybrid, real-time or reactive systems, transformation, verification,  ...  ] failed so far due to the complexity of the resulting timed automata.  ...  The FDR tool [FDR96] is very useful for CSP, mostly for validating specifications, proving properties such as deadlock-freeness, and for development, proving the correctness of a refinement in the invent-and-verify  ... 
doi:10.1007/3-540-48118-4_13 fatcat:fwwpfuyds5euzmnl4mts46imqm

Proving safety properties of infinite state systems by compilation into Presburger arithmetic [chapter]

Laurent Fribourg, Hans Olsén
1997 Lecture Notes in Computer Science  
Our approach will be illustrated on three nontrivial examples of Petri nets with unbounded places and parametric initial markings. ?  ...  Final Remarks We have illustrated on three nontrivial examples of Petri nets how our topdown method of decomposition enhanced by forward propagation of the initial values and invariance checks, allows  ...  We have also successfully applied our procedure to examples of automata with counters taken from 10], and on classical examples with nite reachability sets such as dining-philosophers or Peterson's mutual  ... 
doi:10.1007/3-540-63141-0_15 fatcat:hmj6wmqgvffphksiciw6u5zedy

Constructors, Sufficient Completeness, and Deadlock Freedom of Rewrite Theories [chapter]

Camilo Rocha, José Meseguer
2010 Lecture Notes in Computer Science  
Sufficient conditions are given allowing the automatic checking of sufficient completeness, and other related properties, by equational tree automata modulo equational axioms such as associativity, commutativity  ...  The sufficient completeness of constructors for the rules R turns out to be intimately related with deadlock freedom, i.e., R has no deadlocks outside the constructors for R.  ...  Checking sufficient completeness and deadlock freeness of CNAT...  ... 
doi:10.1007/978-3-642-16242-8_42 fatcat:xzolmc5lrrgernjgd7cm5gbnm4

The temporal perspective in business process modeling: a survey and research challenges

Saoussen Cheikhrouhou, Slim Kallel, Nawal Guermouche, Mohamed Jmaiel
2014 Service Oriented Computing and Applications  
One key perspective when dealing with Business Process Management (BPM) is time. All business experts agree upon the fact that time is a key resource for processes within organisations.  ...  Indeed, time managing is an effective cost reduction strategy and thus ensures profit maximization for organisations.  ...  The clock ordering process is used to verify deadlock freeness due to time constraints conflicts.  ... 
doi:10.1007/s11761-014-0170-x fatcat:g3jruheutfh55p2oco4jlt5dce

Engineering Trustworthy Self-Adaptive Software with Dynamic Assurance Cases

Radu Calinescu, Danny Weyns, Simos Gerasimou, Muhammad Usman Iftikhar, Ibrahim Habli, Tim Kelly
2017 IEEE Transactions on Software Engineering  
ENTRUST uses a combination of (1) design-time and runtime modelling and verification, and (2) industry-adopted assurance processes to develop trustworthy self-adaptive software and assurance cases arguing  ...  Correct adaptation functions [69] Thoroughly tested virtual machine used to interpret and run controller models UPPAAL model checking of interacting timed automata to ensure controller deadlock  ...  These are requirements that must be satisfied in any self-adaptive system (e.g., deadlock freeness) and are predefined in a format compatible with that of the controller model templates and with the method  ... 
doi:10.1109/tse.2017.2738640 fatcat:zm2hp3c3g5bsxl72dvcrdl3eiq

Engineering Trustworthy Self-Adaptive Software with Dynamic Assurance Cases [article]

Radu Calinescu, M. Usman Iftikhar University of York, UK,
2018 arXiv   pre-print
ENTRUST uses a combination of (1) design-time and runtime modelling and verification, and (2) industry-adopted assurance processes to develop trustworthy self-adaptive software and assurance cases arguing  ...  Correct adaptation functions [65] Thoroughly tested virtual machine used to interpret and run controller models UPPAAL model checking of interacting timed automata to ensure controller deadlock  ...  These are requirements that must be satisfied in any self-adaptive system (e.g., deadlock freeness) and are predefined in a format compatible with that of the controller model templates and with the method  ... 
arXiv:1703.06350v2 fatcat:puftbpq7bbfznb2x3ntq34n3le

SAT-Solving in Practice, with a Tutorial Example from Supervisory Control

Koen Claessen, Niklas Een, Mary Sheeran, Niklas Sörensson, Alexey Voronov, Knut Åkesson
2009 Discrete event dynamic systems  
Deadlocks A state q ∈ Q is a deadlock state if Γ (q) = ∅, that is if there are no transitions leaving the state.  ...  model checking.  ... 
doi:10.1007/s10626-009-0081-8 fatcat:tcbfoa3xe5e2ziaaxkrgk2nija

Guaranteeing Liveness in an Object Calculus Through Behavioral Typing [chapter]

Elie Najm, Abdelkrim Nimour, Jean-Bernard Stefani
1999 IFIP Advances in Information and Communication Technology  
It also provides for the incremental extension of well-typed (and well-behaved) configrations: when the code of an object is type checked in the context of an interface repository, it can be added a existing  ...  It is based on the asynchronous 11'-calculus and has a typing system that ensures a certain form of deadlock freeness.  ...  A recent interesting deadlock freeness result was achieved in [3] on a process calculus which is more expressive than OL2 and which unifies the 'I) ' and .X calculi.  ... 
doi:10.1007/978-0-387-35578-8_12 fatcat:3fwboxzvazfz7fjuf6q5calmmy
« Previous Showing results 1 — 15 out of 69 results