Πλοήγηση ανά Συγγραφέα "Philippou, Anna"
-
Conference Object
Reversible Computation in Petri Nets
Philippou, Anna; Psara, Kyriaki (Springer International Publishing, 2018)Reversible computation is an unconventional form of computing where any executed sequence of operations can be executed in reverse at any point during computation. In this paper we propose a reversible approach to Petri ...
-
Conference Object
Reversing Computations Modelled by Coloured Petri Nets
Barylska, Kamila; Gogolinska, Anna; Mikulski, Lukasz; Philippou, Anna; Piatkowski, Marcin; Psara, Kyriaki (CEUR-WS.org, 2018)Reversible computation is an unconventional form of computing where any sequence of performed operations can be executed in reverse order at any point during computation. It has recently been attracting increasing attention ...
-
Article
A rigorous analysis of concurrent operations on B-trees
Philippou, Anna; Walker, D. (1997)An account is given of a rigorous study of concurrent operations on a variant of the B-tree in the framework of a general theory of concurrent systems, an extension of the r-calculus. The assertion of correctness of the ...
-
Article
Risk modeling and analysis of interdependencies of critical infrastructures using colored timed petri nets
Agathangelou, Chrysovalandis; Georgiou, Chryssis; Papailiou, Ileana; Philippou, Anna; Pouis, Loucas; Tertytchny, G.; Vakana, Despina (2015)Petri Nets (PNs) and their variations are a graphical, mathematical language that can be used for the specification, analysis and verification of discrete event systems, including Critical Infrastructures (CIs). Colored ...
-
Article
Selfish routing in the presence of network uncertainty
Georgiou, Chryssis; Pavlides, Theophanis; Philippou, Anna (2009)We study the problem of selfish routing in the presence of incomplete network information. Our model consists of a number of users who wish to route their traffic on a network of m parallel links with the objective of ...
-
Article
Simulation and verification in a process calculus for spatially-explicit ecological models
Philippou, Anna; Toro, Mauricio; Antonaki, Margarita (2013)We propose PALPS, a Process Algebra with Locations for Population Systems. PALPS allows us to produce spatially-explicit individual-based ecological models and to reason about their behavior. PALPS has two abstraction ...
-
Article
Social confluence in client-server systems
Philippou, Anna; Walker, D. (1997)An extension to the theory of partial confluence of concurrent systems is presented in the setting of the polyadic π-calculus. The main result, expressed in terms of client-server systems, is that in certain client contexts, ...
-
Conference Object
Symbolic schedulability analysis of real-time systems
Kwak, Hee-Hwan; Lee, Insup; Philippou, Anna; Choi, Jin-Young; Sokolsky, Oleg (IEEE, 1998)We propose a unifying method for analysis of scheduling problems in real-time systems. The method is based on ACSR-VP, a real-time process algebra with value-passing capabilities. We use ACSR-VP to describe an instance of ...
-
Article
Synchronous parallel composition in a process calculus for ecological models
Toro, Mauricio; Philippou, Anna; Kassara, Christina; Sfenthourakis, Spyros (2014)In this paper we extend PALPS, a process calculus proposed for the spatially-explicit, individual-based modeling of ecological systems, with a synchronous parallel operator. The semantics of the resulting calculus, S-PALPS, ...
-
Article
Synchronous parallel composition in a process calculus for ecological modelsAAA
Toro, Mauricio; Philippou, Anna; Kassara, Christina; Sfenthourakis, Spyros (2014)In this paper we extend PALPS, a process calculus proposed for the spatially-explicit, individual-based modeling of ecological systems, with a synchronous parallel operator. The semantics of the resulting calculus, S-PALPS, ...
-
Article
Tools and algorithms for the construction and analysis of systems : 15th international conference, TACAS 2009 : held as part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009, York, UK, March 22-29, 2009 : proceedings
TACAS (Conference) (15th : 2009 : York, England) [Main,author]; Kowaleski, Stefan; Philippou, Anna; ETAPS (Conference) (12th : 2009 : York, ,England) (2009)
-
Article
Tools and Algorithms for the Construction and Analysis of Systems: 15th International Conference, TACAS 2009 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009 York, UK, March 22-29, 2009 Proceedings
Kowalewski, S.; Philippou, Anna (2009)
-
Article
Towards fault adaptive routing in metasurface controller networks
Kouzapas, Dimitrios; Skitsas, Constantinos; Saeed, Taqwa; Soteriou, Vassos; Lestas, Marios; Philippou, Anna; Abadal, Sergi; Liaskos, Christos; Petrou, Loukas; Georgiou, Julius; Pitsillides, Andreas (2020)HyperSurfaces (HSFs) comprise structurally reconfigurable metasurfaces whose electromagnetic properties can be changed via a software interface, using an embedded miniaturized network of controllers, enabling novel ...
-
Article
Type checking privacy policies in the π-calculus
Kouzapas, D.; Philippou, Anna (2015)In this paper we propose a formal framework for studying privacy. Our framework is based on the π -calculus with groups accompanied by a type system for capturing privacy requirements relating to information collection, ...
-
Article
Type checking purpose-based privacy policies in the π-calculus
Kokkinofta, E.; Philippou, Anna (2016)In this paper we propose a formal framework for studying privacy preserving policies based on the notion of purpose. Our framework employs the π-calculus with groups accompanied by a type system for capturing privacy ...
-
Article
A typing system for privacy
Kouzapas, D.; Philippou, Anna (2014)In this paper we report on work-in-progress towards defining a formal framework for studying privacy. Our framework is based on the π-calculus with groups [1] accompanied by a type system for capturing privacy-related ...
-
Article
Verification techniques for distributed algorithms
Philippou, Anna; Michael, G. (2006)A value-passing, asynchronous process calculus and its associated theory of confluence are considered as a basis for establishing the correctness of distributed algorithms. In particular, we present an asynchronous version ...
-
Article
Weak bisimulation for probabilistic systems
Philippou, Anna; Lee, I.; Sokolsky, O. (2000)In this paper, we introduce weak bisimulation in the framework of Labeled Concurrent Markov Chains, that is, probabilistic transition systems which exhibit both probabilistic and nondeterministic behavior. By resolving the ...