IANDC 2006 - PDF Preprint Papers

IANDC 2006

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed IANDC-2006 Paper

click to vote

IANDC
2006

126views more IANDC 2006»

Coalgebraic semantics for timed processes

13 years 5 months ago

Download homepages.inf.ed.ac.uk

We give a coalgebraic formulation of timed processes and their operational semantics. We model time by a monoid called a "time domain", and we model processes by "t...

Marco Kick, John Power, Alex Simpson

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	126	Coalgebraic semantics for timed processes	claim
2	121	Comparing operational models of name-passing process calculi	claim
3	117	Statistical probabilistic model checking with a focus on time-bounded properties	claim
4	117	A modular approach to defining and characterising notions of simulation	claim
5	113	Automata and fixed point logic: A coalgebraic perspective	claim
6	103	Bisimulation and cocongruence for probabilistic systems	claim
7	102	Polynomial certificates for propositional classes	claim
8	102	Modular proof systems for partial functions with Evans equality	claim
9	101	Mind change efficient learning	claim
10	99	Recursive coalgebras from comonads	claim
11	97	Pure bigraphs: Structure and dynamics	claim
12	95	The alternation hierarchy in fixpoint logic with chop is strict too	claim
13	93	Automation for interactive proof: First prototype	claim
14	93	Aperiodic propagation criteria for Boolean functions	claim
15	86	Table design in dynamic programming	claim
16	83	Implicit complexity over an arbitrary structure: Quantifier alternations	claim
17	82	Recognizability, hypergraph operations, and logical types	claim
18	81	True-concurrency probabilistic models: Branching cells and distributed probabilities for event structures	claim
19	79	Efficient theory combination via boolean search	claim
20	78	A stable programming language	claim
21	77	Lower and upper bounds on obtaining history independence	claim
22	77	Weakly complete axiomatization of exogenous quantum propositional logic	claim
23	69	Logics of communication and change	claim
24	67	Decision procedures for term algebras with integer constraints	claim
25	63	Distributive laws for the coinductive solution of recursive equations	claim
26	52	Incompleteness of states w.r.t. traces in model checking	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers