MLQA 2012 - Revision history

Ender at 14:31, 12 September 2012

2012-09-12T14:31:46Z

← Older revision		Revision as of 14:31, 12 September 2012
Line 235:		Line 235:
	<h3 id="minutess">Minutes</h3>		<h3 id="minutess">Minutes</h3>

	Minutes of MLQA 2012 is avaliable here.		Minutes of MLQA 2012 is avaliable [http://wiki.ercim.eu/wg/MLQA/images/8/80/Minutes_from_the_MLQA_2012_Meeting.pdf here].

Ender at 14:29, 12 September 2012

2012-09-12T14:29:17Z

← Older revision		Revision as of 14:29, 12 September 2012
Line 228:		Line 228:
	</li>		</li>
	</ul>		</ul>


			<hr>

			<div id="minutes"></div>
			<h3 id="minutess">Minutes</h3>

			Minutes of MLQA 2012 is avaliable here.

Ender at 01:44, 29 June 2012

2012-06-29T01:44:46Z

← Older revision		Revision as of 01:44, 29 June 2012
Line 80:		Line 80:

	<h3 id="posters">Posters</h3>		<h3 id="posters">Posters</h3>


	<p>		<p>

Ender at 01:44, 29 June 2012

2012-06-29T01:44:17Z

← Older revision		Revision as of 01:44, 29 June 2012
Line 74:		Line 74:
	<p>		<p>
	Registration will be at a cost of £25. Registration is free for members of SICSA institutions.<br>		Registration will be at a cost of £25. Registration is free for members of SICSA institutions.<br>
	~~Please~~ ~~use~~ the [http://www.epay.ed.ac.uk/browse/extra_info.asp?compid=1&catid=42&modid=2&prodid=795&deptid=24&prodvarid=0 online registration system].		Registration is available through the [http://www.epay.ed.ac.uk/browse/extra_info.asp?compid=1&catid=42&modid=2&prodid=795&deptid=24&prodvarid=0 online registration system].
	</p>		</p>

Ender at 01:36, 29 June 2012

2012-06-29T01:36:49Z

← Older revision		Revision as of 01:36, 29 June 2012
Line 73:		Line 73:

	<p>		<p>
	Registration will be at a cost of £25. Registration is free for members of SICSA institutions.		Registration will be at a cost of £25. Registration is free for members of SICSA institutions.<br>
			Please use the [http://www.epay.ed.ac.uk/browse/extra_info.asp?compid=1&catid=42&modid=2&prodid=795&deptid=24&prodvarid=0 online registration system].
	</p>		</p>

Ender at 13:26, 25 June 2012

2012-06-25T13:26:41Z

← Older revision		Revision as of 13:26, 25 June 2012
Line 181:		Line 181:
	of complex models in terms of cooperations of simpler components in		of complex models in terms of cooperations of simpler components in
	a modular and hierarchical way.		a modular and hierarchical way.
			<br><br>
	However, these elegant and often compact model definitions often hide		However, these elegant and often compact model definitions often hide
	a huge complexity in the structure of the state space. For models with		a huge complexity in the structure of the state space. For models with
Line 214:		Line 215:
	discrete-time and continuous-time Markov Chains, they provide a rich		discrete-time and continuous-time Markov Chains, they provide a rich
	model of computation.		model of computation.
			<br><br>
	We will present the process algebra MAPA for specifying Markov Automata		We will present the process algebra MAPA for specifying Markov Automata
	in a symbolic manner. Specifications in MAPA can be very concise, due to		in a symbolic manner. Specifications in MAPA can be very concise, due to
Line 219:		Line 221:
	be transformed into a linear process format, which is an excellent basis		be transformed into a linear process format, which is an excellent basis
	for symbolic transformation and optimization of Markov Automata.		for symbolic transformation and optimization of Markov Automata.
	</li>		<br><br></li>
	<li>[http://www.pst.ifi.lmu.de/people/staff/tribastone/ Mirco Tribastone], Ludwig-Maximilians-Universität München		<li>[http://www.pst.ifi.lmu.de/people/staff/tribastone/ Mirco Tribastone], Ludwig-Maximilians-Universität München
	<br>		<br>

Ender at 13:25, 25 June 2012

2012-06-25T13:25:58Z

← Older revision		Revision as of 13:25, 25 June 2012
Line 206:		Line 206:
	<br><br>		<br><br>
	</li>		</li>
	~~<!--~~ <li>~~<a href="~~http://wwwhome.cs.utwente.nl/~vdpol/" ~~target="_blank">~~Jaco van de Pol~~</a>~~, University of Twente		<li>[http://wwwhome.cs.utwente.nl/~vdpol/ Jaco van de Pol], University of Twente
	<br>		<br>
	<em>~~title~~ of ~~talk~~</em>		Title: <em>Symbolic Manipulation of Markov Automata</em><br>
			Abstract: Markov automata combine non-deterministic choice, probabilistic choice,
⚫	</li> ~~-->~~
			and stochastic delays, and come with a natural notion of parallel composition.
			Since these automata generalize labeled transition systems and both
			discrete-time and continuous-time Markov Chains, they provide a rich
			model of computation.
			We will present the process algebra MAPA for specifying Markov Automata
			in a symbolic manner. Specifications in MAPA can be very concise, due to
			parallel composition and the use of data types. MAPA specifications can
			be transformed into a linear process format, which is an excellent basis
			for symbolic transformation and optimization of Markov Automata.
		⚫	</li>
	<li>[http://www.pst.ifi.lmu.de/people/staff/tribastone/ Mirco Tribastone], Ludwig-Maximilians-Universität München		<li>[http://www.pst.ifi.lmu.de/people/staff/tribastone/ Mirco Tribastone], Ludwig-Maximilians-Universität München
	<br>		<br>

Ender at 13:22, 25 June 2012

2012-06-25T13:22:17Z

← Older revision		Revision as of 13:22, 25 June 2012
Line 65:		Line 65:

	<p>		<p>
	Abstracts of the invited talks are available [[abstractsX\|here]].		Abstracts of the invited talks are available [[#abstractsX\|here]].
	</p>		</p>

Ender at 13:21, 25 June 2012

2012-06-25T13:21:23Z

← Older revision		Revision as of 13:21, 25 June 2012
Line 65:		Line 65:

	<p>		<p>
	Abstracts of the invited talks are available [[~~abstracts~~\|here]].		Abstracts of the invited talks are available [[abstractsX\|here]].
	</p>		</p>

Line 161:		Line 161:
	<hr>		<hr>

	<div id="~~abstracts~~"></div>		<div id="abstractsX"></div>
	<h3 id="abstracts">Abstracts of Invited Talks</h3>		<h3 id="abstracts">Abstracts of Invited Talks</h3>

Ender at 13:18, 25 June 2012

2012-06-25T13:18:14Z

← Older revision		Revision as of 13:18, 25 June 2012
Line 56:		Line 56:
	<li>[http://wwwhome.cs.utwente.nl/~vdpol/ Jaco van de Pol], University of Twente		<li>[http://wwwhome.cs.utwente.nl/~vdpol/ Jaco van de Pol], University of Twente
	<br>		<br>
			<em>Symbolic manipulation of markov automata</em>
	<em>tbc</em>
	</li>		</li>
	<li>[http://www.pst.ifi.lmu.de/people/staff/tribastone/ Mirco Tribastone], Ludwig-Maximilians-Universität München		<li>[http://www.pst.ifi.lmu.de/people/staff/tribastone/ Mirco Tribastone], Ludwig-Maximilians-Universität München
	<br>		<br>
	<em>Exact ~~Aggregation~~ for ~~Fluid~~ ~~Process~~ ~~Algebra~~ ~~Models~~</em>		<em>Exact aggregation for fluid process algebra models</em>
	</li>		</li>
	</ul>		</ul>