Filters








4,663 Hits in 3.7 sec

Liveness and Fairness in Process-Algebraic Verification [chapter]

Antti Puhakka, Antti Valmari
2001 Lecture Notes in Computer Science  
Although liveness and fairness have been used for a long time in classical model checking, with process-algebraic methods they have seen far less use.  ...  One problem is combining fairness with the compositionality of process algebra. In this article we analyse this problem, and then present an approach for using a class of fairness constraints.  ...  Acknowledgements This work has been funded by the TISE Graduate School and the Academy of Finland, projects "Unifying Action-Based and State-Based Verification Techniques" and "Compositional Verification  ... 
doi:10.1007/3-540-44685-0_14 fatcat:kzvnvtkphre2lmx7f6zso6iv6y

Ensuring Liveness Properties of Distributed Systems (A Research Agenda) [article]

Rob van Glabbeek
2017 arXiv   pre-print
Even simple systems like fair schedulers or mutual exclusion protocols cannot be accurately specified in standard process algebras (or Petri nets) in the absence of fairness assumptions.  ...  Often fairness assumptions need to be made in order to establish liveness properties of distributed systems, but in many situations these lead to false conclusions.  ...  For this reason, fairness assumptions are made in many process-algebraic verification methods, and are deeply ingrained in their methodology [BBK87] .  ... 
arXiv:1711.04240v1 fatcat:peumtlk6rjfy7nwhfloxeoqefa

Ensuring liveness properties of distributed systems: Open problems

Rob van Glabbeek
2019 Journal of Logical and Algebraic Methods in Programming  
Even simple systems like fair schedulers or mutual exclusion protocols cannot be accurately specified in standard process algebras (or Petri nets) in the absence of fairness assumptions.  ...  This theory will encompass process algebra, temporal logic and semantic models.  ...  Achievements of process algebra and related formalisms Process algebra is a family of approaches to the specification, analysis and verification of distributed systems.  ... 
doi:10.1016/j.jlamp.2019.100480 fatcat:fyg3eq6uyrfphghd3i7dlgmt5u

An intruder model for verifying liveness in security protocols

Jan Cederquist, Mohammad Torabi Dashti
2006 Proceedings of the fourth ACM workshop on Formal methods in security - FMSE '06  
We present a process algebraic intruder model for verifying a class of liveness properties of security protocols.  ...  As an application of the proposed intruder model, formal verification of fair exchange protocols is discussed. (see e.g. [4, 27, 37] ).  ...  Acknowledgments We are grateful to Ana Almeida Matos, Ricardo Corin, Cas Cremers, Sandro Etalle, Wan Fokkink and Pieter Hartel for discussions and their helpful comments.  ... 
doi:10.1145/1180337.1180340 dblp:conf/ccs/CederquistD06 fatcat:5a44qzu2mzdz3dmnh4epcqbsy4

Verification of an alternating bit protocol by means of process algebra protocol [chapter]

J. A. Bergstra, J. W. Klop
1986 Lecture Notes in Computer Science  
Axioms and rules of pr0cess algebra. Verification of ABP. This work was sponsored in part by ESPRIT contract 432 METEOR. Remark.  ...  Both safety and liveness are simultaneously dealt with in the equational calculus of process algebra. The structure of this note is as follows: 1. Explanation of the architecture of ABP. 2.  ...  We will present a description and verification of ABP (the alternating bit protocol), in terms of process algebra.  ... 
doi:10.1007/3-540-16444-8_1 fatcat:q7gws4bwcjckjn7aydgp6uec44

Specifying and Verifying Event-Based Fairness Enhanced Systems [chapter]

Jun Sun, Yang Liu, Jin Song Dong, Hai H. Wang
2008 Lecture Notes in Computer Science  
Liveness/Fairness plays an important role in software specification, verification and development. Existing event-based compositional models are safety-centric.  ...  Fairness annotated events can be used to embed liveness/fairness assumptions in event-based models flexibly and naturally.  ...  Acknowledgement Jun Pang, Yuxin Deng and anonymous referees provided helpful comments on early drafts of this paper.  ... 
doi:10.1007/978-3-540-88194-0_4 fatcat:tsa56h7ej5ffrc3v5c7mybc2ru

Page 5268 of Mathematical Reviews Vol. , Issue 98H [page]

1998 Mathematical Reviews  
However, these results cannot be applied to a study of ‘fair semantics’ of programs, as such a fair semantics is a £}-formula in general.  ...  (P-LISBS-I; Lisbon) On the emergence of properties in component-based systems. (English summary) Algebraic methodology and software technology (Munich, 1996), 421-443, Lecture Notes in Comput.  ... 

Page 394 of Mathematical Reviews Vol. , Issue 93a [page]

1993 Mathematical Reviews  
Alpern and F. B. Schneider [Inform. Process. Lett. 21 (1985), no. 4, 181-185] gave a topological charac- terization of safety and liveness properties.  ...  They lift to an algebraic level the standard treatment of actions in the oper- ational semantics of process algebras. Observations are described as terms of an algebra.  ... 

Integration Problems in Telephone Feature Requirements [chapter]

Paul Gibson, Geoff Hamilton, Dominique Méry
1999 IFM'99  
, and no common vocabulary between all participants in the development process.  ...  their needs, whilst building formal models for transformation and verification during design.  ...  Then, the object oriented structure is used to organise the compositional validation and verification processes (in all 3 views).  ... 
doi:10.1007/978-1-4471-0851-1_8 dblp:conf/ifm/GibsonHM99 fatcat:z2uxdgisfvdubo6vh75hs2gpiu

Compositional verification of reactive systems specified by graph transformation [chapter]

Reiko Heckel
1998 Lecture Notes in Computer Science  
A loose semantics for graph transformation rules which has been developed recently is used in this paper for the compositional verification of specifications.  ...  Based on this result one may verify temporal properties by decomposing a specification into several views, analyzing them separately, and deriving the desired property from properties shown for the views  ...  Acknowledgments Thanks to Martin Groi~e-Rhode for helpful discussions and careful reading of the draft, and to Manuel Koch and Fabio Gadducci for joint work on temporal logic for graph transformation.  ... 
doi:10.1007/bfb0053588 fatcat:ws42q6q3lbaj7bob5ncca5ygsa

Page 4548 of Mathematical Reviews Vol. , Issue 92h [page]

1992 Mathematical Reviews  
David Murphy, Testing, betting and timed true concurrency (439-454); Doris Nolte and Lutz Priese, Fairness in models with true concur- rency (455-469); Huajun Qin, Efficient verification of determinate  ...  An algebraic approach (298- 316); Ryszard Janicki and Maciej Koutny, Invariant semantics of nets with inhibitor arcs (317-331); Alan Jeffrey, Abstract timed observation and process algebra (332-345); Bengt  ... 

Page 6637 of Mathematical Reviews Vol. , Issue 90K [page]

1990 Mathematical Reviews  
, A charac- terization of fair computations of finite state SCCS processes (pp. 234-248); Didier Vergamini, Verification of distributed systems: an experiment (pp. 249-259).  ...  , liveness, and lo- cal model checking in the linear time mu-calculus (pp. 166-178); David L.  ... 

Verification methods for finite systems [chapter]

Ahmed Bouajjani, Joseph Sifakis
1991 Lecture Notes in Computer Science  
This need has motivated research on specification formalisms and the associated verification methods and tools. By verification, we mean the comparison of a system against its specifications.  ...  Specifications describe the service provided by the system and  ...  Process algebras are typical representatives of transition-based specification languages.  ... 
doi:10.1007/3540539816_59 fatcat:so4l25s75faspeiiwg5ygoamle

Checking a Mutex Algorithm in a Process Algebra with Fairness [chapter]

Flavio Corradini, Maria Rita Di Berardini, Walter Vogler
2006 Lecture Notes in Computer Science  
In earlier work, we have shown that two variants of weak fairness can be expressed comparatively easily in the timed process algebra PAFAS.  ...  To demonstrate the usefulness of these results, we complement work by Walker [11] and study the liveness property of Dekker's mutual exclusion algorithm within our process algebraic setting.  ...  algebraic setting; with respect to the verification of liveness, Walker was less successful.  ... 
doi:10.1007/11817949_10 fatcat:pfhqcjbabjdjzlnzbpzuqpkmzy

The state explosion problem [chapter]

Antti Valmari
1998 Lecture Notes in Computer Science  
Most process algebras are in this category. Using both Π and Σ is often redundant. Action information can be encoded into states and vice versa.  ...  A process algebra consist of a language for specifying systems, and theory of the behaviour of the system specified in that language.  ... 
doi:10.1007/3-540-65306-6_21 fatcat:2j3eafqfireb7bdt5takxftdna
« Previous Showing results 1 — 15 out of 4,663 results