User Tools

Site Tools


wp4_list

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
Last revision Both sides next revision
wp4_list [2016/03/19 19:02]
imt
wp4_list [2016/03/19 19:57]
imt
Line 1: Line 1:
 **List of publications for WP4** **List of publications for WP4**
 +
 +
 +A. Aldini, M. Bernardo: Expected-Delay-Summing Weak Bisimilarity for Markov Automata, QAPL 2015, EPTCS 194:1-15, 2015.
  
 A. Armas, P. Baldan, M. Dumas, L. García-Bañuelos:​BP-Diff:​ A Tool for Behavioral Comparison of Business Process Models. BPM (Demos) 2014: 1-2 A. Armas, P. Baldan, M. Dumas, L. García-Bañuelos:​BP-Diff:​ A Tool for Behavioral Comparison of Business Process Models. BPM (Demos) 2014: 1-2
Line 6: Line 9:
  
 A. Armas-Cervantes,​ P. Baldan, M. Dumas, L. García-Bañuelos:​ Diagnosing behavioral differences between business process models: An approach based on event structures. Inf. Syst. 56: 304-325 (2016) A. Armas-Cervantes,​ P. Baldan, M. Dumas, L. García-Bañuelos:​ Diagnosing behavioral differences between business process models: An approach based on event structures. Inf. Syst. 56: 304-325 (2016)
 +
 +A. Bizjak, L. Birkedal, M. Miculan: A Model of Countable Nondeterminism in Guarded Type Theory, RTA-TLCA 2014, Springer LNCS 8560:​108–123,​ 2014.
  
 A. Bizjak, L. Birkedal, and M. Miculan: A model of countable nondeterminism in guarded type theory. In G. Dowek, editor, Proc. RTA-TLCA, volume 8560 of Lecture Notes in Computer Science, pages 108–123. Springer, 2014. A. Bizjak, L. Birkedal, and M. Miculan: A model of countable nondeterminism in guarded type theory. In G. Dowek, editor, Proc. RTA-TLCA, volume 8560 of Lecture Notes in Computer Science, pages 108–123. Springer, 2014.
Line 13: Line 18:
 A. Marin, S. Rossi: On the Relations between Lumpability and Reversibility. MASCOTS 2014: 427-432 (WP4) A. Marin, S. Rossi: On the Relations between Lumpability and Reversibility. MASCOTS 2014: 427-432 (WP4)
 CARMA: Collective Adaptive Resource-sharing Markovian Agents. QAPL 2015: 16-31, EPTCS, 194. CARMA: Collective Adaptive Resource-sharing Markovian Agents. QAPL 2015: 16-31, EPTCS, 194.
 +
 +D. Latella, M. Loreti, M. Massink, V. Senni: Stochastically Timed Predicate-Based Communication Primitives for Autonomic Computing, QAPL 2014, EPTCS 154:1-16, 2014.
  
 D. Latella, M. Loreti, M. Massink, Valerio Senni: On StocS: A Stochastic Extension of SCEL. Software, Services, and Systems 2015: 619-640,​Lecture Notes in Computer Science, 8950, Springer, 2014.  D. Latella, M. Loreti, M. Massink, Valerio Senni: On StocS: A Stochastic Extension of SCEL. Software, Services, and Systems 2015: 619-640,​Lecture Notes in Computer Science, 8950, Springer, 2014. 
  
-D. Latella, M. Loreti, M. Massink, Valerio Senni: Stochastically timed predicate-based communication primitives for autonomic computing. QAPL 2014: 1-16, EPTCS, 154. 
  
-D. Latella, M. Loreti, M. Massink: Investigating Fluid-Flow Semantics of Asynchronous Tuple-Based Process Languages for Collective Adaptive SystemsCOORDINATION 2015: 19-34,  Lecture Notes in Computer Science, Springer, 2015.+D. Latella, M. Loreti, M. Massink: Investigating Fluid-Flow Semantics of Asynchronous Tuple-Based Process Languages for Collective Adaptive SystemsCOORDINATION 2015, Springer LNCS 9037:19-34, 2015.
  
-D. Latella, M. Loreti, M. Massink: On-the-fly Fast Mean-Field Model-CheckingTGC 2013: 297-314, ​ ​Lecture Notes in Computer Science, 8358, Springer, 2014.+D. Latella, M. Loreti, M. Massink: On-the-Fly Fast Mean-Field Model-CheckingTGC 2013, Springer LNCS 8358:​297-314, ​2013.
  
-D. Latella, M. Loreti, M. Massink: On-the-fly Fluid Model Checking via Discrete Time Population ModelsEPEW 2015: 193-207,  Lecture Notes in Computer Science, 9037, Springer, 2015.+D. Latella, M. Loreti, M. Massink: On-the-Fly Fluid Model Checking via Discrete Time Population ModelsEPEW 2015, Springer LNCS 9272:193-207, 2015.
  
-D. Latella, M. Loreti, M. Massink: On-the-fly Probabilistic ​Model Checking. ICE 2014: 45-59, ​EPTCS, 166, 2015.+D. Latella, M. Loreti, M. Massink: On-the-Fly PCTL Fast Mean-Field Approximated ​Model-Checking ​for Self-Organising Coordination,​ Science of Computer Programming 110:23-50, 2015. 
 +D. Latella, M. Loreti, M. Massink: On-the-Fly Probabilistic Model Checking, ​ICE 2014, EPTCS 166:​45-59, ​2014.
  
-D. Latella, ​N. Loreti, M. Massink: On-the-fly ​PCTL fast mean-field approximated model-checking for self-organising coordinationSci. Comput. Program. 110: 23-50 (2015+D. Latella, ​M. Loreti, M. Massink: On-the-fly ​Fluid Model Checking via Discrete Time Population ModelsEPEW 2015: 193-207,  Lecture Notes in Computer Science, 9037Springer, 2015.
- +
-D. Sangiorgi, V. VignudelliEnvironmental bisimulations for probabilistic higher-order languages. POPL 2016: 595-607ACM 2016.+
  
-FCorradiniAPoliniB. Re. Inter-organizational Business Process Verification in Public AdministrationBusiness Proc. Manag. Journal 21(5): 1040-1065 (2015)+DSangiorgiVVignudelli: Environmental Bisimulations for Probabilistic Higher-Order LanguagesPOPL 2016, ACM Press, pages 595-607, 2016.
  
 +F. Corradini, A. Polini, B. Re: Inter-Organizational Business Process Verification in Public Administration,​ Business Process Management Journal 21:​1040-1065,​ 2015.
 G. Bacci and M. Miculan: Measurable stochastics for Brane Calculus. Theoretical Computer Science, 431:​117–136,​ 2012. G. Bacci and M. Miculan: Measurable stochastics for Brane Calculus. Theoretical Computer Science, 431:​117–136,​ 2012.
  
Line 39: Line 45:
  
 J. Hillston, M. Loreti: Specification and Analysis of Open-Ended Systems with CARMA. E4MAS 2014: 95-116, Lecture Notes in Computer Science, 9068, Springer, 2014. J. Hillston, M. Loreti: Specification and Analysis of Open-Ended Systems with CARMA. E4MAS 2014: 95-116, Lecture Notes in Computer Science, 9068, Springer, 2014.
 +J. Sproston: Exact and Approximate Abstraction for Classes of Stochastic Hybrid Systems, AVOCS 2014, ECEASST 70, 2014.
  
 +J. Sproston: Verification and Control of Probabilistic Rectangular Hybrid Automata, FORMATS 2015, Springer LNCS 9268:1-9, 2015.
 +
 +L. Aceto, A. Morichetta, F. Tiezzi: Decision Support for Mobile Cloud Computing Applications via Model Checking, MobileCloud 2015, IEEE-CS Press, pages 199-204, 2015.
 L. Aceto, A. Morichetta, F. Tiezzi: Decision Support for Mobile Cloud Computing Applications via Model Checking. MobileCloud 2015: 199-204, IEEE 2015. L. Aceto, A. Morichetta, F. Tiezzi: Decision Support for Mobile Cloud Computing Applications via Model Checking. MobileCloud 2015: 199-204, IEEE 2015.
 +
 +L. Bortolussi, R. De Nicola, V. Galpin, S. Gilmore, J. Hillston, D. Latella, M. Loreti, M. Massink: CARMA: Collective Adaptive Resource-Sharing Markovian Agents,
  
 L. Bortolussi, R. De Nicola, Vashti Galpin, S. Gilmore, J. Hillston, D. Latella, M. Loreti, M. Massink: L. Bortolussi, R. De Nicola, Vashti Galpin, S. Gilmore, J. Hillston, D. Latella, M. Loreti, M. Massink:
 +
 +M. Bernardo, D. Sangiorgi, V. Vignudelli: "On the Discriminating Power of Testing Equivalences for Reactive Probabilistic Systems: Results and Open Problems,
 +
 M. Bernardo, D. Sangiorgi, V. Vignudelli: On the discriminating power of passivation and higher-order interaction. CSL-LICS 2014: 14:1-14:10, ACM 2014. M. Bernardo, D. Sangiorgi, V. Vignudelli: On the discriminating power of passivation and higher-order interaction. CSL-LICS 2014: 14:1-14:10, ACM 2014.
  
 M. Bernardo, D. Sangiorgi, V. Vignudelli: On the discriminating power of testing equivalences for reactive probabilistic systems: results and open problems. QEST 2014: 281-296, Lecture Notes in Computer Science 8657, Springer 2014. M. Bernardo, D. Sangiorgi, V. Vignudelli: On the discriminating power of testing equivalences for reactive probabilistic systems: results and open problems. QEST 2014: 281-296, Lecture Notes in Computer Science 8657, Springer 2014.
  
-M. Bernardo, F. Corradini, L. Tesei: Timed Process Calculi with Deterministic or Stochastic Delays: Commuting between Durational and Durationless ActionsTheoretical Computer Science, ​In Press (2016).+M. Bernardo, F. Corradini, L. Tesei: Timed Process Calculi with Deterministic or Stochastic Delays: Commuting between Durational and Durationless ActionsTheoretical Computer Science, ​to appear.
  
 M. Bernardo, F. Corradini, L. Tesei: Timed process calculi: from durationless actions to durational ones. ICTCS 2014: 21-32, CEUR Workshop Proceedings 1231, CEUR-WS.org 2014. M. Bernardo, F. Corradini, L. Tesei: Timed process calculi: from durationless actions to durational ones. ICTCS 2014: 21-32, CEUR Workshop Proceedings 1231, CEUR-WS.org 2014.
Line 57: Line 72:
 M. Bernardo, R. De Nicola, M. Loreti: Group-by-Group Probabilistic Bisimilarities and Their Logical Characterizations. TGC 2013: 315-330, Lecture Notes in Computer Science, 8358, Springer, 2014. M. Bernardo, R. De Nicola, M. Loreti: Group-by-Group Probabilistic Bisimilarities and Their Logical Characterizations. TGC 2013: 315-330, Lecture Notes in Computer Science, 8358, Springer, 2014.
  
-M. Bernardo, R. De Nicola, M. Loreti: Relating ​strong behavioral equivalences ​for processes ​with nondeterminism ​and probabilities. Theor. Comput. Sci. 546: 63-92 (2014)+M. Bernardo, R. De Nicola, M. Loreti: Relating ​Strong Behavioral Equivalences ​for Processes ​with Nondeterminism ​and Probabilities,​ Theoretical Computer Science ​546:63-922014.
  
-M. Bernardo, R. De Nicola, M. Loreti: Revisiting Trace and Testing Equivalences for Nondeterministic and Probabilistic ProcessesLogical Methods in Computer Science 10(1) (2014)+M. Bernardo, R. De Nicola, M. Loreti: Revisiting Bisimilarity and its Modal Logic for Nondeterministic and Probabilistic Processes, Acta Informatica 52:61-106, 2015. 
 + 
 +M. Bernardo, R. De Nicola, M. Loreti: Revisiting Trace and Testing Equivalences for Nondeterministic and Probabilistic ProcessesLogical Methods in Computer Science 10(1:16):​1-42, ​2014.
  
 M. Bernardo, R. De Nicola, M. Loreti: Revisiting bisimilarity and its modal logic for nondeterministic and probabilistic processes. Acta Inf. 52(1): 61-106 (2015) M. Bernardo, R. De Nicola, M. Loreti: Revisiting bisimilarity and its modal logic for nondeterministic and probabilistic processes. Acta Inf. 52(1): 61-106 (2015)
Line 68: Line 85:
  
 M. Miculan and M. Peressotti: GSOS for non-deterministic processes with quantitative aspects. In N. Bertrand and L. Bortolussi, editors, Proceedings QAPL 2014, volume 154 of EPTCS, pages 17–33, 2014. M. Miculan and M. Peressotti: GSOS for non-deterministic processes with quantitative aspects. In N. Bertrand and L. Bortolussi, editors, Proceedings QAPL 2014, volume 154 of EPTCS, pages 17–33, 2014.
 +
 +M. Miculan, M. Peressotti, GSOS for Non-Deterministic Processes with Quantitative Aspects, QAPL 2014, EPTCS 154:17-33, 2014.
 +
 +M. Miculan, M. Peressotti: Structural Operational Semantics for Non-Deterministic Processes with Quantitative Aspects, Theoretical Computer Science, to appear.
  
 P. Baldan, F. Bonchi, H. Kerstan, B. König: Behavioral Metrics via Functor Lifting. FSTTCS 2014: 403-415 P. Baldan, F. Bonchi, H. Kerstan, B. König: Behavioral Metrics via Functor Lifting. FSTTCS 2014: 403-415
  
 P. Baldan, F. Bonchi, H. Kerstan, B. König: Towards Trace Metrics via Functor Lifting. CALCO 2015: 35-49 P. Baldan, F. Bonchi, H. Kerstan, B. König: Towards Trace Metrics via Functor Lifting. CALCO 2015: 35-49
 +
 +P.A. Abdulla, R. Ciobanu, R. Mayr, A. Sangnier, J. Sproston: Qualitative Analysis of VASS-Induced MDPs, FOSSACS 2016, Springer LNCS 9634:1-16, 2016.
 +
 +P.A. Abdulla, R. Mayr, A. Sangnier, J. Sproston: Solving Parity Games on Integer Vectors, CONCUR 2013, Springer LNCS 8052:​106-120,​ 2013.
  
 R. Crubillé, U. Dal Lago, D. Sangiorgi, V. Vignudelli: On applicative similarity, sequentiality,​ and full abstraction. Correct System Design: 65-82, Lecture Notes in Computer Science 9360, Springer 2015. R. Crubillé, U. Dal Lago, D. Sangiorgi, V. Vignudelli: On applicative similarity, sequentiality,​ and full abstraction. Correct System Design: 65-82, Lecture Notes in Computer Science 9360, Springer 2015.
  
-R. De Nicola, D. Latella, M. Loreti, M. Massink: A uniform definition ​of stochastic process calculi. ​ACM Comput. Surv. 46(1): 5 (2013)+R. De Nicola, D. Latella, M. Loreti, M. Massink: A Uniform Definition ​of Stochastic Process Calculi, ​ACM Computing Surveys ​46(1):52013.
  
 R.B. Uriarte, S. Tsaftaris, F. Tiezzi: Service Clustering for Autonomic Clouds Using Random Forest. CCGRID 2015: 515-524, IEEE 2015.  R.B. Uriarte, S. Tsaftaris, F. Tiezzi: Service Clustering for Autonomic Clouds Using Random Forest. CCGRID 2015: 515-524, IEEE 2015. 
 +
 +S. Balsamo, A. Marin, I. Stojic: Perfect Sampling in Stochastic Petri Nets Using Decision Diagrams. MASCOTS 2015: 126-135 ​
  
 S. Crafa and F. Ranzato: Logical characterizations of behavioral relations on transition systems of probability distributions. ACM Transactions on Computational Logic 16(1):​2:​1-2:​24 ACM Press, 2014. S. Crafa and F. Ranzato: Logical characterizations of behavioral relations on transition systems of probability distributions. ACM Transactions on Computational Logic 16(1):​2:​1-2:​24 ACM Press, 2014.
  
-SBalsamoAMarinIStojicPerfect Sampling ​in Stochastic Petri Nets Using Decision Diagrams. MASCOTS 2015126-135 ​+TBrengosMMiculanMPeressottiBehavioural Equivalences for Coalgebras with Unobservable Moves, Journal of Logical and Algebraic Methods ​in Programming 84:826–852, 2015.
  
 T. Brengos, M. Miculan, and Marco Peressotti: Behavioural equivalences for coalgebras with unobservable moves. Journal of Logical and Algebraic Methods in Programming,​ 84(6):​826–852,​ 2015. T. Brengos, M. Miculan, and Marco Peressotti: Behavioural equivalences for coalgebras with unobservable moves. Journal of Logical and Algebraic Methods in Programming,​ 84(6):​826–852,​ 2015.
  
wp4_list.txt · Last modified: 2016/03/20 12:48 by imt